Tilted Empirical Risk Minimization
Tian Li, Ahmad Beirami, Maziar Sanjabi, Virginia Smith
Abstract
Empirical risk minimization (ERM) is typically designed to perform well on the average loss, which can result in estimators that are sensitive to outliers, generalize poorly, or treat subgroups unfairly. While many methods aim to address these problems individually, in this work, we explore them through a unified framework---tilted empirical risk minimization (TERM). In particular, we show that it is possible to flexibly tune the impact of individual losses through a straightforward extension to ERM using a hyperparameter called the tilt. We provide several interpretations of the resulting framework: We show that TERM can increase or decrease the influence of outliers, respectively, to enable fairness or robustness; has variance-reduction properties that can benefit generalization; and can be viewed as a smooth approximation to a superquantile method. We develop batch and stochastic first-order optimization methods for solving TERM, and show that the problem can be efficiently solved relative to common alternatives. Finally, we demonstrate that TERM can be used for a multitude of applications, such as enforcing fairness between subgroups, mitigating the effect of outliers, and handling class imbalance. TERM is not only competitive with existing solutions tailored to these individual problems, but can also enable entirely new applications, such as simultaneously addressing outliers and promoting fairness.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers34
- Ditto: Fair and Robust Federated Learning Through PersonalizationTian Li, Shengyuan Hu, Ahmad Beirami, Virginia SmithICML 2021 · 1,313 citations
- Probable Domain Generalization via Quantile Risk MinimizationCian Eastwood, Alexander Robey, Shashank Singh, Julius von Kügelgen et al.NeurIPS 2022 · 99 citations
- An Online Method for A Class of Distributionally Robust Optimization with Non-convex ObjectivesQi Qi, Zhishuai Guo, Yi Xu, Rong Jin et al.NeurIPS 2021 · 61 citations
- Learning Bounds for Risk-sensitive LearningJaeho Lee, Sejun Park, Jinwoo ShinNeurIPS 2020 · 52 citations
- Probabilistically Robust Learning: Balancing Average and Worst-case PerformanceAlexander Robey, Luiz F. O. Chamon, George J. Pappas, Hamed HassaniICML 2022 · 50 citations
Builds on5
- Fair Resource Allocation in Federated LearningTian Li, Maziar Sanjabi, Ahmad Beirami, Virginia SmithICLR 2020 · 971 citations
- What is Local Optimality in Nonconvex-Nonconcave Minimax Optimization?Chi Jin, Praneeth Netrapalli, Michael I. JordanICML 2020 · 381 citations
- Can gradient clipping mitigate label noise?Aditya Krishna Menon, Ankit Singh Rawat, Sashank J. Reddi, Sanjiv KumarICLR 2020 · 163 citations
- FR-Train: A Mutual Information-Based Approach to Fair and Robust TrainingYuji Roh, Kangwook Lee, Steven Whang, Changho SuhICML 2020 · 90 citations
- Fairness for Robust Log Loss ClassificationAshkan Rezaei, Rizal Fathony, Omid Memarrast, Brian D. ZiebartAAAI 2020 · 63 citations
Related papers
- Tilted Sparse Additive ModelsYingjie Wang, Hong Chen, Weifeng Liu, Fengxiang He et al.ICML 2023 · 6 citations
- Generalization and Robustness of the Tilted Empirical RiskGholamali Aminian, Amir R. Asadi, Tian Li, Ahmad Beirami et al.ICML 2025
- Correcting Overparameterization Effects in Fair Empirical Risk MinimizationXiaoyi MAI, Jean-Michel LoubesICML 2026
- When do Minimax-fair Learning and Empirical Risk Minimization Coincide?Harvineet Singh, Matthäus Kleindessner, Volkan Cevher, Rumi Chunara et al.ICML 2023 · 6 citations
- f-FERM: A Scalable Framework for Robust Fair Empirical Risk MinimizationSina Baharlouei, Shivam Patel, Meisam RazaviyaynICLR 2024 · 4 citations
