Rigorous learning curve bounds from statistical mechanics
From MaRDI portal
(Redirected from Publication:676243)
Recommendations
Cites work
- scientific article; zbMATH DE number 67623 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- A general lower bound on the number of examples needed for learning
- Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension
- Central limit theorems for empirical measures
- Convergence of stochastic processes
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Learnability with respect to fixed distributions
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- 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
- scientific article; zbMATH DE number 940827 (Why is no real title available?)
- scientific article; zbMATH DE number 7415108 (Why is no real title available?)
- Results in statistical discriminant analysis: A review of the former Soviet Union literature.
- Fast rates for general unbounded loss functions: from ERM to generalized Bayes
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)