Sciweavers

216 search results - page 1 / 44
» PAC Learning from Positive Statistical Queries
Sort
View
ALT
1998
Springer
13 years 9 months ago
PAC Learning from Positive Statistical Queries
Learning from positive examples occurs very frequently in natural learning. The PAC learning model of Valiant takes many features of natural learning into account, but in most case...
François Denis
FOCS
2009
IEEE
13 years 11 months ago
A Complete Characterization of Statistical Query Learning with Applications to Evolvability
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...
Vitaly Feldman
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
13 years 9 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
ALT
1997
Springer
13 years 9 months ago
Learning DFA from Simple Examples
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...
Rajesh Parekh, Vasant Honavar
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
14 years 5 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman