4255 search results - page 344 / 851 » On Learning Boolean Functions |
182
click to vote
SAB
2010
Springer
15 years 5 months ago
2010
Springer
Biological brains can adapt and learn from past experience. In neuroevolution, i.e. evolving artificial neural networks (ANNs), one way that agents controlled by ANNs can evolve t...
176
click to vote
NIPS
1993
15 years 8 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
144
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
151
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
Rademacher and Gaussian complexities are successfully used in learning theory for measuring the capacity of the class of functions to be learned. One of the most important propert...
175
Voted
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
This paper presents an approach to automatically optimize the retrieval quality of ranking functions. Taking a Swarm Intelligence perspective, we present a novel method, SwarmRank...