10054 search results - page 2 / 2011 » On the Complexity of Function Learning |
55
Voted
INFORMS
2002
14 years 9 months ago
2002
71
Voted
ALT
2003
Springer
15 years 6 months ago
2003
Springer
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
ICML
2004
IEEE
15 years 2 months ago
2004
IEEE
The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensi...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
ALT
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...