Rigorous learning curve bounds from statistical mechanics
From MaRDI portal
Publication:676243
DOI10.1007/BF00114010zbMATH Open0870.68131OpenAlexW4253803546MaRDI QIDQ676243FDOQ676243
Authors: David Haussler, Michael Kearns, H. Sebastian Seung, Naftali Tishby 
Publication date: 6 May 1997
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00114010
Recommendations
Cites Work
- Title not available (Why is that?)
- Convergence of stochastic processes
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Central limit theorems for empirical measures
- A general lower bound on the number of examples needed for learning
- Learnability with respect to fixed distributions
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension
- Title not available (Why is that?)
- The space of interactions in neural network models
Cited In (7)
- A random matrix analysis of random Fourier features: beyond the Gaussian kernel, a precise phase transition, and the corresponding double descent*
- Learning from stochastic rules under finite temperature - optimal temperature and asymptotic learning curve
- Characterizing rational versus exponential learning curves
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast rates for general unbounded loss functions: from ERM to generalized Bayes
- Results in statistical discriminant analysis: A review of the former Soviet Union literature.
This page was built for publication: Rigorous learning curve bounds from statistical mechanics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676243)
