Lower bound methods and separation results for on-line learning models
- 1 July 1992
- journal article
- Published by Springer Nature in Machine Learning
- Vol. 9 (2-3) , 107-145
- https://doi.org/10.1007/bf00992674
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Learning binary relations and total ordersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- On the complexity of learning from counterexamplesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Computational limitations on learning from examplesJournal of the ACM, 1988
- Sorting and Recognition Problems for Ordered SetsSIAM Journal on Computing, 1988
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- Balancing poset extensionsOrder, 1984
- Intersections ofk-element setsCombinatorica, 1981
- A note on the number of queries needed to identify regular languagesInformation and Control, 1981
- A combinatorial problem; stability and order for models and theories in infinitary languagesPacific Journal of Mathematics, 1972