Universal Rates of Empirical Risk Minimization
Steve Hanneke, Mingyue Xu

TL;DR
This paper establishes a fundamental classification of universal learning rates for empirical risk minimization, revealing only four possible decay patterns and characterizing the classes that correspond to each rate.
Contribution
It introduces a tetrachotomy of universal ERM learning rates and provides a complete classification of concept classes based on these rates using new complexity measures.
Findings
Four universal ERM learning rates: exponential, polynomial, logarithmic, and slow.
Complete characterization of concept classes for each learning rate.
Development of new combinatorial dimensions for precise rate analysis.
Abstract
The well-known empirical risk minimization (ERM) principle is the basis of many widely used machine learning algorithms, and plays an essential role in the classical PAC theory. A common description of a learning algorithm's performance is its so-called "learning curve", that is, the decay of the expected error as a function of the input sample size. As the PAC model fails to explain the behavior of learning curves, recent research has explored an alternative universal learning model and has ultimately revealed a distinction between optimal universal and uniform learning rates (Bousquet et al., 2021). However, a basic understanding of such differences with a particular focus on the ERM principle has yet to be developed. In this paper, we consider the problem of universal learning by ERM in the realizable case and study the possible universal rates. Our main result is a fundamental…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsRisk and Portfolio Optimization
MethodsFocus
