89 search results - page 3 / 18 » A Characterization of the Language Classes Learnable with Co... |
164
Voted
COCO
2001
Springer
15 years 9 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...
170
Voted
COLT
2001
Springer
15 years 9 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
139
Voted
COLT
1999
Springer
15 years 9 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
173
Voted
ICGI
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...
152
Voted
ALT
2002
Springer
16 years 2 months ago
2002
Springer
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...