845 search results - page 5 / 169 » Complexity Dimensions and Learnability |
COCO
2001
Springer
13 years 12 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
A new method for optimizing complex functions and systems is described that employs Learnable Evolution Model (LEM), a form of non-Darwinian evolutionary computation guided by mac...
ML
1998
ACM
13 years 7 months ago
1998
ACM
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
ICML
1996
IEEE
14 years 8 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
COLT
1999
Springer
13 years 11 months ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...