73 search results - page 10 / 15 » The Complexity of Learning Concept Classes with Polynomial G... |
FSTTCS
1992
Springer
13 years 11 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
AI
2004
Springer
13 years 7 months ago
2004
Springer
Efficient Learning Equilibrium (ELE) is a natural solution concept for multi-agent encounters with incomplete information. It requires the learning algorithms themselves to be in ...
ALT
1997
Springer
13 years 11 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
UAI
2008
13 years 9 months ago
2008
Continuous state spaces and stochastic, switching dynamics characterize a number of rich, realworld domains, such as robot navigation across varying terrain. We describe a reinfor...