Sciweavers

24 search results - page 3 / 5
» A Query Algorithm for Agnostically Learning DNF
Sort
View
ALT
2002
Springer
14 years 6 months ago
The Complexity of Learning Concept Classes with Polynomial General Dimension
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...
Johannes Köbler, Wolfgang Lindner
COLT
2001
Springer
14 years 2 months ago
On Using Extended Statistical Queries to Avoid Membership Queries
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 ...
Nader H. Bshouty, Vitaly Feldman
COLT
1993
Springer
14 years 1 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
ISTCS
1997
Springer
14 years 1 months ago
Learning with Queries Corrupted by Classification Noise
Kearns introduced the "statistical query" (SQ) model as a general method for producing learning algorithms which are robust against classification noise. We extend this ...
Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman
FOCS
2009
IEEE
14 years 4 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