A Researcher's Guide to Empirical Risk Minimization
Lars van der Laan

TL;DR
This paper offers a comprehensive, modular framework for deriving high-probability regret bounds in empirical risk minimization, including cases with nuisance components relevant to causal inference and domain adaptation.
Contribution
It introduces a unified three-step recipe for ERM regret bounds, extends analysis to nuisance-augmented ERM, and provides new bounds in the in-sample regime under smoothness conditions.
Findings
Unified three-step recipe for ERM regret bounds
Extension of regret bounds to nuisance-augmented ERM
Fast oracle rates achievable in in-sample regimes
Abstract
This guide provides a reference for high-probability regret bounds in empirical risk minimization (ERM). The presentation is modular: we begin with intuition and general proof strategies, then state broadly applicable guarantees under high-level conditions and provide tools for verifying them for specific losses and function classes. We emphasize that many ERM rate derivations can be organized around a three-step recipe -- a basic inequality, a uniform local concentration bound, and a fixed-point argument -- which yields regret bounds in terms of a critical radius, defined via localized Rademacher complexity, under a mild Bernstein-type variance-risk condition. To make these bounds concrete, we upper bound the critical radius using local maximal inequalities and metric-entropy integrals, thereby recovering familiar rates for VC-subgraph, Sobolev/H\"older, and bounded-variation classes.…
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Bayesian Modeling and Causal Inference · Advanced Causal Inference Techniques
