Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio  Home/Search
Context Related
| ias.edu/~odonnell/paper...halfspaces.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ias.edu/~odonnell/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We give the rst polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution to within any constant error parameter. We also give the rst quasipolynomial time algorithm for learning any function of a polylog number of polynomial-weight halfspaces under any distribution. As special cases of these results we obtain algorithms for learning intersections and thresholds of halfspaces. Our uniform distribution learning algorithms involve a... (Update)
Cited by: More
Toward Attribute Efficient Learning of Decision Lists and.. - Klivans, Servedio (2006) (Correct)
An Augmented PAC Model for SemiSupervised Learning - Balcan, Blum (2005) (Correct)
On the Noise Sensitivity of Monotone Functions - Mossel, O'Donnell (2003) (Correct)
Active bibliography (related documents): More All
2.3: Computational Applications of Noise Sensitivity - O'Donnell (2003) (Correct)
1.9: Learning DNF from Random Walks - Bshouty, Mossel, O'Donnell, Servedio (2003) (Correct)
1.0: On Learning Monotone DNF under Product Distributions - Servedio (2001) (Correct)
Similar documents based on text: More All
0.5: Boosting and Hard-Core Sets - Klivans, Servedio (1999) (Correct)
0.5: Learning DNF in Time ... - Klivans, Servedio (2001) (Correct)
0.4: Learnability Beyond AC^0 - Jackson, Klivans, al. (Correct)
Related documents from co-citation: More All
3: A random sampling based algorithm for learning the intersection of half-spaces - Vempala - 1997
3: Noise sensitivity of Boolean functions and applications to percolation - Benjamini, Kalai et al.
3: Communications of the ACM (context) - Valiant, of et al. - 1984
BibTeX entry: (Update)
A. Klivans, R. O'Donnell, and R. Servedio. Learning intersections and thresholds of halfspaces. In Proc. 43rd Ann. IEEE Symp. on Foundations of Comp. Sci., pages 177--186, 2002. http://citeseer.ist.psu.edu/klivans02learning.html More
@misc{ klivans02learning,
author = "A. Klivans and R. O'Donnell and R. Servedio",
title = "Learning intersections and thresholds of halfspaces",
text = "A. Klivans, R. O'Donnell, and R. Servedio. Learning intersections and thresholds
of halfspaces. In Proc. 43rd Ann. IEEE Symp. on Foundations of Comp. Sci.,
pages 177--186, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/klivans02learning.html" }
Citations (may not include all citations):1120 Handbook of Mathematical Functions (context) - Abramowitz, Stegun - 1972
493 Communications of the ACM (context) - Valiant, of et al. - 1984
465 Learnability and the VapnikChervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989
221 Perceptrons: an introduction to computational geometry (context) - Minsky, Papert - 1968
148 The perceptron: a probabilistic model for information storag.. (context) - Rosenblatt - 1958
103 Introduction to approximation theory (context) - Cheney - 1966
77 Threshold circuits of bounded depth (context) - Hajnal, Maass et al. - 1993
66 PP is closed under intersection - Beigel, Reingold et al. - 1995
63 Weakly learning DNF and characterizing statistical query lea.. - Blum, Furst et al. - 1994
57 the degree of boolean functions as real polynomials - Nisan, Szegedy - 1992
56 The expressive power of voting polynomials - Aspnes, Beigel et al. - 1994
43 Neural net algorithms that learn in polynomial time from exa.. (context) - Baum - 1991
38 Limit theorems of probability theory (context) - Petrov - 1995
32 The perceptron: a model for brain functioning (context) - Block - 1962
32 fourier transform and learnability (context) - Linial, Mansour et al. - 1993
26 How fast can a threshold gate learn (context) - Maass, Turan - 1994
22 DNF formulas on product distributions (context) - Hancock, Mansour et al. - 1991
20 Learning Boolean functions via the Fourier transform (context) - Mansour - 1994
18 Noise sensitivity of boolean functions and applications to p.. - Benjamini, Kalai et al. - 1999
18 Learning with unreliable boundary queries - Blum, Chalasani et al. - 1998
18 Learning DNF under the uniform distribution in quasi-polynom.. (context) - Verbeurgt - 1990
17 the fourier spectrum of monotone functions - Bshouty, Tamon - 1996
16 On using the fourier transform to learn disjoint DNF - Khardon - 1994
14 learning algorithm for DNF under the uniform distribution - Mansour, log - 1995
13 A technique for upper bounding the spectral norm with applic.. - Bellare - 1992
13 An ecient membership-query algorithm for learning DNF with r.. (context) - Jackson - 1997
12 Boosting and hard-core sets - Klivans, Servedio - 1999
12 A random sampling based algorithm for learning the intersect.. - Vempala - 1997
10 Rational approximation to jxj (context) - Newman - 1964
8 A polynomial time algorithm that learns two hidden unit nets (context) - Baum - 1991
8 Rational approximation techniques for analysis of neural net.. (context) - Siu, Roychowdhury et al. - 1994
7 and a perceptron-like algorithm (context) - Servedio, learning et al. - 1999
7 Cryptographic hardness of distribution-speci c learning (context) - Kharitonov - 1993
6 The complexity of learning formulas and decision trees that .. (context) - Hancock - 1992
5 Learning monotone log-term DNF formulas under the uniform di.. (context) - Sakai, Maruoka - 2000
5 PAC learning intersections of halfspaces with membership que.. - Kwek, Pitt - 1998
4 Learning DNF in time - Klivans, Servedio - 2001
4 personal communication (context) - Peres - 2001
4 Learnability beyond AC (context) - Jackson, Klivans et al. - 2002
4 Mathematical techniques for the analysis of Boolean function.. (context) - Bernasconi - 1998
3 Learning an intersection of a constant number of halfspaces .. - Blum, Kannan - 1997
3 perceptron networks on the uniform distribution (context) - Golea, Marchand et al. - 1994
3 More ecient PAC learning of DNF with membership queries unde.. - Bshouty, Jackson et al. - 1999
3 On learning monotone DNF under product distributions - Servedio - 2001
2 Learning of depth two neural networks with constant fan-in a.. - Auer, Kwek et al. - 1996
1 Ampli cation of weak learning over the uniform distribution (context) - Boneh, Lipton - 1993
1 Log-concave probability distributions: Theory and statistica.. (context) - An - 1995
1 Hardness ampli cation within NP (context) - O'Donnell - 2002
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://math.ias.edu/~odonnell/): More
Computational Applications of Noise Sensitivity - O'Donnell (2003) (Correct)
Learning Juntas - Mossel, O'Donnell, Servedio (2003) (Correct)
New Degree Bounds for Polynomial Threshold Functions - O'Donnell, Servedio (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC