10054 search results - page 84 / 2011 » On the Complexity of Function Learning |
123
click to vote
ML
2000
ACM
15 years 7 days ago
2000
ACM
A new class of evolutionary computation processes is presented, called Learnable Evolution Model or LEM. In contrast to Darwinian-type evolution that relies on mutation, recombinat...
100
Voted
SAGT
2010
Springer
14 years 11 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
106
Voted
EUROGP
2009
Springer
15 years 7 months ago
2009
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
90
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Learning goal-scoring behaviour from scratch for simulated robot soccer is considered to be a very difficult problem, and is often achieved by endowing players with an innate set ...
106
Voted
JMLR
2007
15 years 10 days ago
2007
We introduce standardised building blocks designed to be used with variational Bayesian learning. The blocks include Gaussian variables, summation, multiplication, nonlinearity, a...