COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
More theorems about scale-sensitive dimensions and learning
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
On the complexity of learning from drifting distributions
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Strong minimax lower bounds for learning
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Learning of depth two neural networks with constant fan-in at the hidden nodes (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Journal of the ACM (JACM)
Approximating hyper-rectangles: learning and pseudo-random sets
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved lower bounds for learning from noisy examples: an information-theoretic approach
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
The complexity of learning according to two models of a drifting environment
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
On the sample complexity of learning functions with bounded variation
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Strong Minimax Lower Bounds for Learning
Machine Learning - Special issue on the ninth annual conference on computational theory (COLT '96)
The Complexity of Learning According to Two Models of a Drifting Environment
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Improved bounds on the sample complexity of learning
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On-line learning with malicious noise and the closure algorithm
Annals of Mathematics and Artificial Intelligence
Information Processing Letters
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On Agnostic Learning with {0, *, 1}-Valued and Real-Valued Hypotheses
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Machine Learning
Information Processing Letters
Efficient algorithms for learning functions with bounded variation
Information and Computation
A new PAC bound for intersection-closed concept classes
Machine Learning
Learning intersection-closed classes with signatures
Theoretical Computer Science
Shifting: One-inclusion mistake bounds and sample compression
Journal of Computer and System Sciences
Using the doubling dimension to analyze the generalization of learning algorithms
Journal of Computer and System Sciences
Information and Computation
One-inclusion hypergraph density revisited
Information Processing Letters
Algorithms and theory of computation handbook
Bayesian active learning using arbitrary binary valued queries
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Functional classification with margin conditions
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Unlabeled compression schemes for maximum classes
COLT'05 Proceedings of the 18th annual conference on Learning Theory
A geometric approach to sample compression
The Journal of Machine Learning Research
Activized learning: transforming passive to active with improved label complexity
The Journal of Machine Learning Research
On the necessity of irrelevant variables
The Journal of Machine Learning Research
| Hi-index | 0.00 |