Learning intersections of halfspaces with a margin
Authors:
- Adam R. KlivansAKAdam R. Klivans
- Rocco A. ServedioRSRocco A. Servedio
- 1 February 2008
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 74 (1) , 35-48
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Database-friendly random projections: Johnson-Lindenstrauss with binary coinsJournal of Computer and System Sciences, 2003
- Learning DNF in time2001
- Large margin classification using the perceptron algorithm1998
- Learning an Intersection of a Constant Number of Halfspaces over a Uniform DistributionJournal of Computer and System Sciences, 1997
- Classification by polynomial surfacesDiscrete Applied Mathematics, 1995
- PP Is Closed under IntersectionJournal of Computer and System Sciences, 1995
- When do extra majority gates help? Polylog (N) majority gates are equivalent to onecomputational complexity, 1994
- A Polynomial Time Algorithm That Learns Two Hidden Unit NetsNeural Computation, 1990
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Rational approximation to $| x| $.Michigan Mathematical Journal, 1964