Characterizing rational versus exponential learning curves
From MaRDI portal
(Redirected from Publication:1370864)
Recommendations
Cites work
- A metric entropy bound is not sufficient for learnability
- A theory of the learnable
- Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension
- Generalization performance of Bayes optimal classification algorithm for learning a perceptron
- scientific article; zbMATH DE number 3767656 (Why is no real title available?)
- scientific article; zbMATH DE number 3776640 (Why is no real title available?)
- scientific article; zbMATH DE number 3436645 (Why is no real title available?)
- scientific article; zbMATH DE number 6846220 (Why is no real title available?)
- Learning curves of the clipped Hebb rule for networks with binary weights
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Rigorous learning curve bounds from statistical mechanics
Cited in
(7)- Nonlinear versus linear learning devices: A procedural perspective
- Lower bounds for the rate of convergence in nonparametric pattern recognition
- Vertical pricing competition in supply chains: the effect of production experience and coordination
- A fractional rate model of learning
- Ten More Years of Error Rate Research
- Non-uniform consistency of online learning with random sampling
- The exponential learning equation as a function of successful trials results in sigmoid performance
This page was built for publication: Characterizing rational versus exponential learning curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370864)
