Generalization and Robustness of the Tilted Empirical Risk
Not on the map. Why?
Abstract (arXiv)
The generalization error (risk) of a supervised statistical learning algorithm quantifies its prediction ability on previously unseen data. Inspired by exponential tilting, citetli2020tilted proposed the it tilted empirical risk (TER) as a non-linear risk metric for machine learning applications such as classification and regression problems. In this work, we examine the generalization error of the tilted empirical risk in the robustness regime under textitnegative tilt. Our first contribution is to provide uniform and information-theoretic bounds on the it tilted generalization error, defined as the difference between the population risk and the tilted empirical risk, under negative tilt for unbounded loss function under bounded (1+ε)-th moment of loss function for some ε∈(0,1] with a convergence rate of O(n-ε/(1+ε)) where n is the number of training samples, revealing a novel application for TER under no distribution shift. Secondly, we study the robustness of the tilted empirical risk with respect to noisy outliers at training time and provide theoretical guarantees under distribution shift for the tilted empirical risk. We empirically corroborate our findings in simple experimental setups where we evaluate our bounds to select the value of tilt in a data-driven manner.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 30 of its 76 references that are in the map. First posted on arXiv 28 Sep 2024.
Builds on
30 of 76 references.
References · 30
- 2017Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networkscited by 304
- 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 299
- 2017Size-Independent Sample Complexity of Neural Networkscited by 289
- 2021User-friendly introduction to PAC-Bayes boundscited by 234
- 2020Reasoning About Generalization via Conditional Mutual Informationcited by 145
- 2019Tightening Mutual Information Based Bounds on Generalization Errorcited by 117
- 2020Tilted Empirical Risk Minimizationcited by 103
- 2015How much does your data exploration overfit? Controlling bias via information usagecited by 95
- 2021Towards a Theoretical Framework of Out-of-Distribution Generalizationcited by 94
- 2019Sharper bounds for uniformly stable algorithmscited by 91
- 2017Generalization Bounds of SGLD for Non-convex Learning: Two Theoretical Viewpointscited by 82
- 2018Chaining Mutual Information and Tightening Generalization Boundscited by 65
18 more
- 2020PAC-Bayes Analysis Beyond the Usual Boundscited by 63
- 2018Stability and Convergence Trade-off of Iterative Optimization Algorithmscited by 53
- 2016Simpler PAC-Bayesian Bounds for Hostile Datacited by 45
- 2020Generalization Bounds via Information Density and Conditional Information Densitycited by 43
- 2021On Tilted Losses in Machine Learning: Theory and Applicationscited by 42
- 2020Learning Bounds for Risk-sensitive Learningcited by 33
- 2022Generalization Bounds via Convex Analysiscited by 27
- 2022PAC-Bayes Generalisation Bounds for Heavy-Tailed Losses through Supermartingalescited by 23
- 2022Proportional Fairness in Federated Learningcited by 20
- 2020Jensen-Shannon Information Based Characterization of the Generalization Error of Learning Algorithmscited by 19
- 2019PAC-Bayes under potentially heavy tailscited by 16
- 2013Relative Deviation Learning Bounds and Generalization with Unbounded Loss Functionscited by 15
- 2019Efron-Stein PAC-Bayesian Inequalitiescited by 15
- 2023Online-to-PAC Conversions: Generalization Bounds via Regret Analysiscited by 14
- 2021Information-Theoretic Bounds on the Moments of the Generalization Error of Learning Algorithmscited by 12
- 2021Tilted Cross Entropy (TCE): Promoting Fairness in Semantic Segmentationcited by 12
- 2024Towards Robust Out-of-Distribution Generalization Bounds via Sharpnesscited by 10
- 2023Mean-field Analysis of Generalization Errorscited by 5
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025Power Homotopy for Zeroth-Order Non-Convex Optimizationscited by 1
- 2025Zeroth-Order Sharpness-Aware Learning with Exponential Tiltingcited by 0
- 2025Risk-Entropic Flow Matchingcited by 0
- 2026Progressive Power Homotopy for Non-convex Optimizationcited by 0
- 2026Progressive Power Homotopy for Non-convex Optimization22 Jan 2026
- 2025Risk-Entropic Flow Matching28 Nov 2025
- 2025Power Homotopy for Zeroth-Order Non-Convex Optimizations17 Nov 2025
- 2025Zeroth-Order Sharpness-Aware Learning with Exponential Tilting17 Oct 2025