Communications of the ACM
Learning regular sets from queries and counterexamples
Information and Computation
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
Learning DNF under the uniform distribution in quasi-polynomial time
COLT '90 Proceedings of the third annual workshop on Computational learning theory
A polynomial time algorithm that learns two hidden unit nets
Neural Computation
Learning monotone ku DNF formulas on product distributions
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
On the degree of Boolean functions as real polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A technique for upper bounding the spectral norm with applications to learning
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Cryptographic hardness of distribution-specific learning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The complexity of learning formulas and decision trees that have restricted reads
The complexity of learning formulas and decision trees that have restricted reads
Amplification of weak learning under the uniform distribution
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Threshold circuits of bounded depth
Journal of Computer and System Sciences
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
On using the Fourier transform to learn Disjoint DNF
Information Processing Letters
How fast can a threshold gate learn?
Proceedings of a workshop on Computational learning theory and natural learning systems (vol. 1) : constraints and prospects: constraints and prospects
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
PP is closed under intersection
Selected papers of the 23rd annual ACM symposium on Theory of computing
An O(nlog log n) learning algorithm for DNF under the uniform distribution
Journal of Computer and System Sciences
On the Fourier spectrum of monotone functions
Journal of the ACM (JACM)
Learning of depth two neural networks with constant fan-in at the hidden nodes (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Learning an intersection of a constant number of halfspaces over a uniform distribution
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
A simple algorithm for learning O (log n)-term DNF
Information Processing Letters
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
Journal of Computer and System Sciences
Learning with unreliable boundary queries
Journal of Computer and System Sciences - Special issue on the eighth annual workshop on computational learning theory, July 5–8, 1995
More efficient PAC-learning of DNF with membership queries under the uniform distribution
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
On PAC learning using Winnow, Perceptron, and a Perceptron-like algorithm
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Hardness amplification within NP
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Machine Learning
Machine Learning
A Random Sampling based Algorithm for Learning the Intersection of Half-spaces
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the applications of multiplicity automata in learning
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Agnostically Learning Halfspaces
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On the fourier tails of bounded functions over the discrete cube
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Toward Attribute Efficient Learning of Decision Lists and Parities
The Journal of Machine Learning Research
Separating AC0 from depth-2 majority circuits
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Every Linear Threshold Function has a Low-Weight Approximator
Computational Complexity
Unconditional lower bounds for learning intersections of halfspaces
Machine Learning
Computational Complexity
A tamper-proof and lightweight authentication scheme
Pervasive and Mobile Computing
Cryptographic hardness for learning intersections of halfspaces
Journal of Computer and System Sciences
A lower bound for agnostically learning disjunctions
COLT'07 Proceedings of the 20th annual conference on Learning theory
Optimal bounds for sign-representing the intersection of two halfspaces by polynomials
Proceedings of the forty-second ACM symposium on Theory of computing
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
Proceedings of the forty-second ACM symposium on Theory of computing
An invariance principle for polytopes
Proceedings of the forty-second ACM symposium on Theory of computing
Learning and lower bounds for AC0 with threshold gates
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
On the hardness of learning intersections of two halfspaces
Journal of Computer and System Sciences
The regularized least squares algorithm and the problem of learning halfspaces
Information Processing Letters
Any AND-OR Formula of Size $N$ Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
SIAM Journal on Computing
Bounded Independence Fools Halfspaces
SIAM Journal on Computing
Private data release via learning thresholds
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Submodular functions are noise stable
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On PAC learning algorithms for rich boolean function classes
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
SIAM Journal on Computing
An invariance principle for polytopes
Journal of the ACM (JACM)
| Hi-index | 0.00 |
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 constant error parameter. We also give the first quasipolynomial time algorithm for learning any Boolean function of a polylog number of polynomial-weight halfspaces under any distribution on the Boolean hypercube. As special cases of these results we obtain algorithms for learning intersections and thresholds of halfspaces. Our uniform distribution learning algorithms involve a novel non-geometric approach to learning halfspaces; we use Fourier techniques together with a careful analysis of the noise sensitivity of functions of halfspaces. Our algorithms for learning under any distribution use techniques from real approximation theory to construct low-degree polynomial threshold functions. Finally, we also observe that any function of a constant number of polynomial-weight halfspaces can be learned in polynomial time in the model of exact learning from membership and equivalence queries.