Characterizing rational versus exponential learning curves
From MaRDI portal
Publication:1370864
DOI10.1006/jcss.1997.1505zbMath0880.68104OpenAlexW2016257995MaRDI QIDQ1370864
Publication date: 28 October 1997
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1997.1505
Related Items (3)
Ten More Years of Error Rate Research ⋮ Vertical pricing competition in supply chains: the effect of production experience and coordination ⋮ Lower bounds for the rate of convergence in nonparametric pattern recognition
Cites Work
- Rigorous learning curve bounds from statistical mechanics
- Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- A theory of the learnable
- Learning curves of the clipped Hebb rule for networks with binary weights
- Generalization performance of Bayes optimal classification algorithm for learning a perceptron
- A metric entropy bound is not sufficient for learnability
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Characterizing rational versus exponential learning curves
