Ming Li and P. M. B. Vitanyi. A theory of learning simple concepts under simple distributions and average case complexity for the universal distribution. In Proc. of the 30th IEEE Annual Symp. on Foundation of Computer Science, pages 34--39, 1989. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Simple Strategies for Large Zero-Sum Games with Applications.. - Lipton, Young (1994) (7 citations) (Correct)
Probabilistic Analysis of Learning in Artificial Neural Networks: .. - Anthony (1994) (10 citations) (Correct)
Computational Learning Theory for Artificial Neural Networks - Anthony, Biggs (1993) (2 citations) (Correct)
The Complexity of Malign Ensembles - Miltersen (1993) (5 citations) (Correct)
Discovering Neural Nets With Low Kolmogorov Complexity And High .. - Schmidhuber (1997) (10 citations) (Correct)
Probabilistic Learning Theory, with Emphasis on Sample Complexity - Anthony (Correct)
On Average Case Complexity of SAT for Symmetric Distributions - Makowsky, Sharell (1995) (3 citations) (Correct)
Meaning Helps Learning Syntax - Tellier (1998) (3 citations) (Correct)
Discovering Problem Solutions With Low Kolmogorov Complexity.. - Schmidhuber (1994) (2 citations) (Correct)
On Learning Visual Concepts and DNF Formulae - Kushilevitz, Roth (1993) (14 citations) (Correct)
A Survey of Adaptive Sorting Algorithms - Estivill-Castro, Wood (1992) (8 citations) (Correct)
Philosophical Issues in Kolmogorov Complexity - Li, Vitányi (1992) (1 citation) Self-citation (Li) (Correct)
Computational Machine Learning in Theory and Praxis - Li, Vitányi (1995) (6 citations) Self-citation (Li) (Correct)
Theories of Learning - Li, Vitányi Self-citation (Li) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC