Communications of the ACM
Learning decision trees from random examples needed for learning
Information and Computation
Learning decision trees using the Fourier spectrum
SIAM Journal on Computing
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
An O(nlog log n) learning algorithm for DNF under the uniform distribution
Journal of Computer and System Sciences
Randomized algorithms
Exact learning Boolean functions via the monotone theory
Information and Computation
On the Fourier spectrum of monotone functions
Journal of the ACM (JACM)
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
Journal of Computer and System Sciences
Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
SIAM Journal on Computing
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
Extension of the PAC framework to finite and countable Markov chains
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
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
Learning Sub-classes of Monotone DNF on the Uniform Distribution
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
On Learning Monotone DNF under Product Distributions
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On using extended statistical queries to avoid membership queries
The Journal of Machine Learning Research
Uniform-distribution attribute noise learnability
Information and Computation
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0,1}^n. We give a polynomial time algorithm for learning decision trees and DNF formulas in this model. This is the first efficient 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.