Communications of the ACM
On the learnability of Boolean formulae
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Computational limitations on learning from examples
Journal of the ACM (JACM)
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
Learning 2u DNF formulas and ku decision trees
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Improved learning of AC0 functions
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Exact learning of read-twice DNF formulas (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Fast learning of k-term DNF formulas with queries
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An O(nlog log n) learning algorithm for DNF under the uniform distribution
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Exact learning of read-k disjoint DNF and not-so-disjoint DNF
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Toward efficient agnostic learning
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Learning decision trees using the Fourier spectrum
SIAM Journal on Computing
Cryptographic hardness of distribution-specific learning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient noise-tolerant learning from statistical queries
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On learning visual concepts and DNF formulae
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
Machine Learning
On learning Read-k-Satisfy-j DNF
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
On the Fourier spectrum of monotone functions
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Learning DNF over the uniform distribution using a quantum example oracle
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Learning using group representations (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Specification and simulation of statistical query algorithms for efficiency and noise tolerance
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Simple learning algorithms using divide and conquer
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
On the Fourier spectrum of monotone functions
Journal of the ACM (JACM)
On the boosting ability of top-down decision tree learning algorithms
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On Restricted-Focus-of-Attention Learnability of Boolean Functions
Machine Learning - Special issue on the ninth annual conference on computational theory (COLT '96)
Efficient noise-tolerant learning from statistical queries
Journal of the ACM (JACM)
Noise-tolerant learning, the parity problem, and the statistical query model
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Implementation Issues in the Fourier Transform Algorithm
Machine Learning
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
Theoretical Computer Science
Exact learning of DNF formulas using DNF hypotheses
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Theoretical Computer Science
Boosting and Hard-Core Set Construction
Machine Learning
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
On Learning Correlated Boolean Functions Using Statistical Queries
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
A General Dimension for Approximately Learning Boolean Functions
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
New Lower Bounds for Statistical Query Learning
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Efficiently Approximating Weighted Sums with Exponentially Many Terms
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
On Using Extended Statistical Queries to Avoid Membership Queries
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational 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
New Lower Bounds for Statistical Query Learning
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Noise-tolerant learning, the parity problem, and the statistical query model
Journal of the ACM (JACM)
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the Efficiency of Noise-Tolerant PAC Algorithms Derived from Statistical Queries
Annals of Mathematics and Artificial Intelligence
On using extended statistical queries to avoid membership queries
The Journal of Machine Learning Research
Optimally-smooth adaptive boosting and application to agnostic learning
The Journal of Machine Learning Research
Journal of Computer and System Sciences - STOC 2001
Learning intersections and thresholds of halfspaces
Journal of Computer and System Sciences - Special issue on FOCS 2002
On learning monotone DNF under product distributions
Information and Computation
On approximating weighted sums with exponentially many terms
Journal of Computer and System Sciences
Learning functions of k relevant variables
Journal of Computer and System Sciences - Special issue: STOC 2003
Exact learning of DNF formulas using DNF hypotheses
Journal of Computer and System Sciences - Special issue on COLT 2002
Learning mixtures of product distributions over discrete domains
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Separating Models of Learning from Correlated and Uncorrelated Data
The Journal of Machine Learning Research
A general dimension for query learning
Journal of Computer and System Sciences
Unconditional lower bounds for learning intersections of halfspaces
Machine Learning
Evolvability from learning algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Computational Complexity
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Approximate lineage for probabilistic databases
Proceedings of the VLDB Endowment
Exact learning of random DNF over the uniform distribution
Proceedings of the forty-first annual ACM symposium on Theory of computing
Active learning with multiple views
Journal of Artificial Intelligence Research
Application of a generalization of russo's formula to learning from multiple random oracles
Combinatorics, Probability and Computing
Exploiting Product Distributions to Identify Relevant Variables of Correlation Immune Functions
The Journal of Machine Learning Research
A characterization of strong learnability in the statistical query model
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Characterizing statistical query learning: simplified notions and proofs
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Lower bounds on learning random structures with statistical queries
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Privately releasing conjunctions and the statistical query barrier
Proceedings of the forty-third annual ACM symposium on Theory of computing
Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
On noise-tolerant learning of sparse parities and related problems
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
SIAM Journal on Computing
Spectral norm in learning theory: some selected topics
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Learning DNF by statistical and proper distance queries under the uniform distribution
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Improved lower bounds for learning intersections of halfspaces
COLT'06 Proceedings of the 19th annual conference on Learning Theory
On learning random DNF formulas under the uniform distribution
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Separating models of learning from correlated and uncorrelated data
COLT'05 Proceedings of the 18th annual conference on Learning Theory
On learning finite-state quantum sources
Quantum Information & Computation
A complete characterization of statistical query learning with applications to evolvability
Journal of Computer and System Sciences
When does greedy learning of relevant attributes succeed?: a fourier-based characterization
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Learnability of DNF with representation-specific queries
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Statistical algorithms and a lower bound for detecting planted cliques
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |