Equivalence of the Empirical Risk Minimization to Regularization on the Family of f-Divergences
Not on the map. Why?
Abstract (arXiv)
The solution to empirical risk minimization with f-divergence regularization (ERM-fDR) is presented under mild conditions on f. Under such conditions, the optimal measure is shown to be unique. Examples of the solution for particular choices of the function f are presented. Previously known solutions to common regularization choices are obtained by leveraging the flexibility of the family of f-divergences. These include the unique solutions to empirical risk minimization with relative entropy regularization (Type-I and Type-II). The analysis of the solution unveils the following properties of f-divergences when used in the ERM-fDR problem: ibigl) f-divergence regularization forces the support of the solution to coincide with the support of the reference measure, which introduces a strong inductive bias that dominates the evidence provided by the training data; and iibigl) any f-divergence regularization is equivalent to a different f-divergence regularization with an appropriate transformation of the empirical risk function.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 8 of its 45 references that are in the map. First posted on arXiv 1 Feb 2024.
Builds on
8 of 45 references.
References · 8
- 2017A Closer Look at Memorization in Deep Networkscited by 942
- 2015How much does your data exploration overfit? Controlling bias via information usagecited by 95
- 2020Non-exponentially weighted aggregation: regret bounds for unbounded loss functionscited by 18
- 2022Empirical Risk Minimization with Relative Entropy Regularizationcited by 13
- 2023On the Validation of Gibbs Algorithms: Training Datasets, Test Datasets and their Aggregationcited by 10
- 2023Generalization Analysis of Machine Learning Algorithms via the Worst-Case Data-Generating Probability Measurecited by 7
- 2023Analysis of the Relative Entropy Asymmetry in the Regularization of Empirical Risk Minimizationcited by 5
- 2023Information-theoretic Analysis of Test Data Sensitivity in Uncertaintycited by 3
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 3.
6 papers.
- 2024The Method of Gaps: Exact Expressions for the Generalization Error of Supervised Learning Algorithmscited by 5
- 2025Proofs for Folklore Theorems on the Radon-Nikodym Derivativecited by 4
- 2026Decentralized Machine Learning with Centralized Performance Guarantees via Gibbs Algorithmscited by 2
- 2025A Dual Optimization View to Empirical Risk Minimization with f-Divergence Regularizationcited by 1
- 2026Empirical Risk Minimization with f-Divergence Regularizationcited by 0
- 2026Machine Unlearning for Gibbs Supervised Learning Algorithmscited by 0
- 2026Machine Unlearning for Gibbs Supervised Learning Algorithms24 Sep 2026
- 2026Decentralized Machine Learning with Centralized Performance Guarantees via Gibbs Algorithms22 Apr 2026
- 2026Empirical Risk Minimization with f-Divergence Regularization19 Jan 2026
- 2025A Dual Optimization View to Empirical Risk Minimization with f-Divergence Regularization5 Aug 2025
- 2025Proofs for Folklore Theorems on the Radon-Nikodym Derivative30 Jan 2025
- 2024The Method of Gaps: Exact Expressions for the Generalization Error of Supervised Learning Algorithms18 Nov 2024