Nader Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio  Home/Search
Context Related
| ias.edu/~odonnell/pap...randomwalks.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 consider a model of learning Boolean functions from examples generated by a uniform random walk on . We give a polynomial time algorithm for learning decision trees and DNF formulas in this model. This is the first e#cient algorithm for learning these classes in a natural passive learning model where the learner has no influence over the choice of examples used for learning. (Update)
Cited by: More
Decision Trees: More Theoretical Justification for Practical.. - Fiat, Pechyony (Correct)
Decision Trees: More Theoretical Justification for Practical.. - Pechyony (2004) (Correct)
Decision Trees: More Theoretical Justification - For Practical Algorithms (Correct)
Active bibliography (related documents): More All
1.9: Computational Applications of Noise Sensitivity - O'Donnell (2003) (Correct)
1.9: Learning Intersections and Thresholds of Halfspaces - Klivans, O'Donnell, Servedio (2002) (Correct)
0.9: Learning Juntas - Mossel, O'Donnell, Servedio (2003) (Correct)
Similar documents based on text: More All
0.3: Learning Monotone DNF from a Teacher that Almost Does Not.. - Bshouty, Eiron (2002) (Correct)
0.3: Coin flipping from a cosmic source: On error correction of.. - Mossel, O'Donnell (2002) (Correct)
0.3: On the Noise Sensitivity of Monotone Functions - Mossel, O'Donnell (2003) (Correct)
Related documents from co-citation: More All
5: cient noise-tolerant learning from statistical queries (context) - Kearns - 1993
5: Weakly learning DNF and characterizing statistical query learning using Fourier .. - Blum, Furst et al. - 1994
5: On using extended statistical queries to avoid membership queries - Bshouty, Feldman - 2002
BibTeX entry: (Update)
N. Bshouty, E. Mossel, R. O'Donnell, and R. Servedio. Learning DNF from random walks. To appear, 2003. http://citeseer.ist.psu.edu/bshouty03learning.html More
@misc{ bshouty03learning,
author = "N. Bshouty and E. Mossel and R. O'Donnell and R. Servedio",
title = "Learning DNF from random walks",
text = "N. Bshouty, E. Mossel, R. O'Donnell, and R. Servedio. Learning DNF from
random walks. To appear, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/bshouty03learning.html" }
Citations (may not include all citations):493 Communications of the ACM (context) - Valiant, of et al. - 1984
180 Boosting a weak learning algorithm by majority - Freund - 1990
149 A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989
96 Learning decision trees using the Fourier spectrum - Kushilevitz, Mansour - 1993
90 A pseudorandom generator from any one-way function - Hastad, Impagliazzo et al. - 1999
74 Exact learning via the monotone theory (context) - Bshouty - 1995
63 Weakly learning DNF and characterizing statistical query lea.. - Blum, Furst et al. - 1994
42 Learning decision trees from random examples (context) - Ehrenfeucht, Haussler - 1989
32 Fourier transform and learnability (context) - Linial, Mansour et al. - 1993
31 Cryptographic hardness of distribution-specific learning (context) - Kharitonov - 1993
23 A Markovian extension of Valiant's learning model (context) - Aldous, Vazirani - 1990
22 DNF formulas on product distributions (context) - Hancock, Mansour et al. - 1991
18 Learning DNF under the uniform distribution in quasi-polynom.. (context) - Verbeurgt - 1990
18 Noise sensitivity of boolean functions and applications to p.. - Benjamini, Kalai et al. - 1999
18 the computational power of depth 2 circuits with threshold a.. - Krause, Pudlak - 1994
17 the Fourier spectrum of monotone functions - Bshouty, Tamon - 1996
16 On using the Fourier transform to learn disjoint DNF - Khardon - 1994
14 Learning DNF over the uniform distribution using a quantum e.. - Bshouty, Jackson - 1999
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
12 Boosting and hard-core sets - Klivans, Servedio - 1999
10 cient membership-query algorithm for learning DNF with respe.. (context) - Jackson - 1997
10 On using extended statistical queries to avoid membership qu.. - andV - 2002
8 Exploiting random walks for learning - Bartlett, Fischer et al. - 1994
7 Hardness amplification within NP (context) - O'Donnell - 2002
7 and a Perceptron-like algorithm (context) - Servedio, learning et al. - 1999
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 Extension of the PAC framework to finite and countable Marko.. - Gamarnik - 1999
4 Learning DNF in time - Klivans, Servedio - 2001
4 Learnability beyond AC (context) - Jackson, Klivans et al. - 2002
3 On learning monotone DNF under product distributions - Servedio - 2001
3 cient PAC learning of DNF with membership queries under the .. (context) - Bshouty, Jackson et al. - 1999
2 Amplification of weak learning over the uniform distribution (context) - Boneh, Lipton - 1993
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