COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
An improved boosting algorithm and its implications on learning complexity
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
The minimum consistent DFA problem cannot be approximated within any polynomial
Journal of the ACM (JACM)
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Exploiting random walks for learning
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Learning from a consistently ignorant teacher
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Efficient distribution-free learning of probabilistic concepts
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
More theorems about scale-sensitive dimensions and learning
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Journal of the ACM (JACM)
Learning with maximum-entropy distributions
COLT '97 Proceedings of the tenth 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
Learning with Maximum-Entropy Distributions
Machine Learning
Learning Regular Languages from Simple Positive Examples
Machine Learning
Stochastic Finite Learning of the Pattern Languages
Machine Learning
A geometric approach to leveraging weak learners
Theoretical Computer Science
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Learning from Positive and Unlabeled Examples
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
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
When Can Two Unsupervised Learners Achieve PAC Separation?
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Exploiting random walks for learning
Information and Computation
On the proper learning of axis-parallel concepts
The Journal of Machine Learning Research
An efficient boosting algorithm for combining preferences
The Journal of Machine Learning Research
Efficient algorithms for learning functions with bounded variation
Information and Computation
Some connections between learning and optimization
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Learning from positive and unlabeled examples
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
From learning in the limit to stochastic finite learning
Theoretical Computer Science - Algorithmic learning theory
Learning indexed families of recursive languages from positive data: A survey
Theoretical Computer Science
Learning recursive functions: A survey
Theoretical Computer Science
On agnostic boosting and parity learning
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Some connections between learning and optimization
Discrete Applied Mathematics
Learning Halfspaces with Malicious Noise
The Journal of Machine Learning Research
Probably approximately correct learning
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Oblivious PAC learning of concept hierarchies
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Algorithms and theory of computation handbook
| Hi-index | 0.00 |