Empirical error-confidence curves for neural network and Gaussian classifiers.
"Error-Confidence" measures the probability that the proportion of errors made by a classifier will be within epsilon of EB, the optimal (Bayes) error. Probably Almost Bayes (PAB) theory attempts to quantify how this confidence increases with the number of training samples. We investigate the relationship empirically by comparing average error versus number of training patterns (m) for linear and neural network classifiers. On Gaussian problems, the resulting EC curves demonstrate that the PAB bounds are extremely conservative. Asymptotic statistics predicts a linear relationship between the logarithms of the average error and the number of training patterns. For low Bayes error rates we found excellent agreement between the prediction and the linear discriminant performance. At higher Bayes error rates we still found a linear relationship, but with a shallower slope than the predicted-1. When the underlying true model is a three-layer network, the EC curves show a greater dependence on classifier capacity, and the linear predictions no longer seem to hold.
Machine Learning & Perception Group, Ricoh California Research Center, Menlo Park, CA 94025, USA. wolff@crc.ricoh.com
G J
GJ
Wolff
D G
DG
Stork
A
A
Owen
D001499:Bayes Theorem; D003198:Computer Simulation; D016001:Confidence Intervals; D016571:Neural Networks, Computer; D016011:Normal Distribution; D011336:Probability; D015203:Reproducibility of Results