mlsanityData to 7 Oct 2026

Empirical Risk Minimization with Relative Entropy Regularization: Optimality and Sensitivity Analysis

arXiv 2202.04385 ↗First posted 9 Feb 2022cs.LG cs.IT math.ITcited by 8

Not on the map. Why?

Abstract (arXiv)

The optimality and sensitivity of the empirical risk minimization problem with relative entropy regularization (ERM-RER) are investigated for the case in which the reference is a sigma-finite measure instead of a probability measure. This generalization allows for a larger degree of flexibility in the incorporation of prior knowledge over the set of models. In this setting, the interplay of the regularization parameter, the reference measure, the risk function, and the empirical risk induced by the solution of the ERM-RER problem is characterized. This characterization yields necessary and sufficient conditions for the existence of a regularization parameter that achieves an arbitrarily small empirical risk with arbitrarily high probability. The sensitivity of the expected empirical risk to deviations from the solution of the ERM-RER problem is studied. The sensitivity is then used to provide upper and lower bounds on the expected empirical risk. Moreover, it is shown that the expectation of the sensitivity is upper bounded, up to a constant factor, by the square root of the lautum information between the models and the datasets.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 8 of its 38 references that are in the map. First posted on arXiv 9 Feb 2022.

Builds on

8 of 38 references.

References · 8

  1. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
  2. 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 299
  3. 2019A Primer on PAC-Bayesian Learningcited by 130
  4. 2015Statistical physics of inference: Thresholds and algorithmscited by 128
  5. 2015How much does your data exploration overfit? Controlling bias via information usagecited by 95
  6. 2018Chaining Mutual Information and Tightening Generalization Boundscited by 65
  7. 2020PAC-Bayes unleashed: generalisation bounds with unbounded lossescited by 43
  8. 2019Still no free lunches: the price to pay for tighter PAC-Bayes boundscited by 14

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 3; 2024: 2; 2025: 2.

8 papers.