Improved Lower Bounds for Learning Intersections of Halfspaces
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 335-349
- https://doi.org/10.1007/11776420_26
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Learnability and AutomatizabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Learning Intersections of Halfspaces with a MarginLecture Notes in Computer Science, 2004
- Noise-tolerant learning, the parity problem, and the statistical query modelJournal of the ACM, 2003
- Weakly learning DNF and characterizing statistical query learning using Fourier analysisPublished by Association for Computing Machinery (ACM) ,1994
- On the computational power of depth 2 circuits with threshold and modulo gatesPublished by Association for Computing Machinery (ACM) ,1994
- Efficient noise-tolerant learning from statistical queriesPublished by Association for Computing Machinery (ACM) ,1993
- Learning decision trees using the Fourier spectrumPublished by Association for Computing Machinery (ACM) ,1991
- PP is closed under intersectionPublished by Association for Computing Machinery (ACM) ,1991
- The expressive power of voting polynomialsPublished by Association for Computing Machinery (ACM) ,1991
- Harmonic Analysis of Polynomial Threshold FunctionsSIAM Journal on Discrete Mathematics, 1990