Learning Simple Concepts Under Simple Distributions (1991)

Cached

Download Links

by Ming Li , Paul M. B. Vitányi
Venue:SIAM JOURNAL OF COMPUTING
Citations:56 - 3 self

Documents Related by Co-Citation

1695 A Theory of the Learnable – L. G. Valiant - 1984
1683 An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition – Ming Li, Paul Vitanyi - 1997
120 Machine Learning: A Theoretical Approach – B K Natarajan - 1992
506 Learning regular sets from queries and counterexamples – D Angluin - 1987
77 Inductive Inference, DFAs and Computational Complexity – Leonard Pitt - 1989
220 Complexity of automaton identification from given data – E M Gold - 1978
522 Three approaches to the quantitative definition of information – K Kolmogorov
90 On the symmetry of algorithmic information – P Gács - 1974
330 A Theory of Program Size Formally Identical to Information Theory – Gregory J. Chaitin - 1975
306 Cryptographic Limitations on Learning Boolean Formulae and Finite Automata – Michael Kearns, Leslie Valiant - 1989
162 Inference of reversible languages – Dana Angluin, Yale Untverstty - 1982
95 of information conservation (nongrowth) and aspects of the foundation of probability theory, Probl – L A Levin, Laws
647 Queries and concept learning – D Angluin - 1988
3836 J.D.: Introduction to automata theory, languages, and computation – J E Hopcroft, R Motwani, Ullman
102 Inferring Regular Languages in Polynomial Update Time – J Oncina, P Garcia - 1992
118 Universal sequential search problems – L A Levin - 1973
90 Equivalence of models for polynomial learnability – D HAUSSLER, M KEARNS, N LITTLESTONE, M K WARMUTH - 1988
227 On the Length of Programs for Computing Finite Binary Sequences – Gregory J. Chaitin - 1966
596 An Introduction to Computational Learning Theory – M J Kearns, U V Vazirani - 1994