Sciweavers

9 search results - page 2 / 2
» Uniform Characterizations of Polynomial-Query Learnabilities
Sort
View
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, ...
COLT
2001
Springer
13 years 10 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
ALT
2009
Springer
14 years 2 months ago
Learning from Streams
Abstract. Learning from streams is a process in which a group of learners separately obtain information about the target to be learned, but they can communicate with each other in ...
Sanjay Jain, Frank Stephan, Nan Ye
ECCC
2010
124views more  ECCC 2010»
13 years 5 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio