Lower bounds in pattern recognition and learning

This publication has 12 references indexed in Scilit:

• Sharper Bounds for Gaussian and Empirical Processes
  The Annals of Probability, 1994
• Learnability and the Vapnik-Chervonenkis dimension
  Journal of the ACM, 1989
• A general lower bound on the number of examples needed for learning
  Information and Computation, 1989
• Automatic pattern recognition: a study of the probability of error
  IEEE Transactions on Pattern Analysis and Machine Intelligence, 1988
• On estimating a density using Hellinger distance and some other strange facts
  Probability Theory and Related Fields, 1986
• A theory of the learnable
  Communications of the ACM, 1984
• Approximation dans les espaces m triques et th orie de l'estimation
  Probability Theory and Related Fields, 1983
• Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations
  Theory of Probability & Its Applications, 1982
• Convergence of Estimates Under Dimensionality Restrictions
  The Annals of Statistics, 1973
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
  Theory of Probability & Its Applications, 1971