4 search results - page 1 / 1 » Polynomial inference of universal automata from membership a... |
COLT
1994
Springer
13 years 8 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
ICGI
2010
Springer
13 years 5 months ago
2010
Springer
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
ALT
2004
Springer
14 years 1 months ago
2004
Springer
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...