Sciweavers

Share
5 search results - page 1 / 1
» Polynomial inference of universal automata from membership a...
Sort
View
IANDC
2016
87views Biometrics» more  IANDC 2016»
4 years 4 months ago
Polynomial inference of universal automata from membership and equivalence queries
We present a MAT learning algorithm that infers the universal automaton for a regular target language using a polynomial number of queries with respect to that automaton. The univ...
Johanna Björklund, Henning Fernau, Anna Kaspr...
COLT
1994
Springer
10 years 2 hour ago
An Optimal Parallel Algorithm for Learning DFA
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
José L. Balcázar, Josep Díaz,...
ICGI
2010
Springer
9 years 9 months ago
Generalizing over Several Learning Settings
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...
Anna Kasprzik
ALT
2004
Springer
10 years 4 months ago
New Revision Algorithms
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 ...
Judy Goldsmith, Robert H. Sloan, Balázs Sz&...
FOCS
2002
IEEE
10 years 26 days ago
Learning Intersections and Thresholds of Halfspaces
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...
Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
books