A Model-Based Method for Minimizing CVaR and Beyond
Si Yi Meng, Robert M. Gower
Abstract
We develop a variant of the stochastic prox-linear method for minimizing the Conditional Value-at-Risk (CVaR) objective. CVaR is a risk measure focused on minimizing worst-case performance, defined as the average of the top quantile of the losses. In machine learning, such a risk measure is useful to train more robust models. Although the stochastic subgradient method (SGM) is a natural choice for minimizing the CVaR objective, we show that our stochastic prox-linear (SPL+) algorithm can better exploit the structure of the objective, while still providing a convenient closed form update. Our SPL+ method also adapts to the scaling of the loss function, which allows for easier tuning. We then specialize a general convergence theorem for SPL+ to our setting, and show that it allows for a wider selection of step sizes compared to SGM. We support this theoretical finding experimentally.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3929c20e-90ec-4fc5-b2a6-bbe0e456e865Cited by top-tier papers4
- An Exploration of Non-Euclidean Gradient Descent: Muon and its Many VariantsMichael Crawshaw, Chirag Modi, Mingrui Liu, Robert GowerICML 2026 · 24 citations
- MoMo: Momentum Models for Adaptive Learning RatesFabian Schaipp, Ruben Ohana, Michael Eickenberg, Aaron Defazio et al.ICML 2024 · 21 citations
- Generating Informative Samples for Risk-Averse Fine-Tuning of Downstream TasksHeasung Kim, Taekyun Lee, Hyeji Kim, Gustavo de VecianaNeurIPS 2025 · 2 citations
- A Near-Optimal Single-Loop Stochastic Algorithm for Convex Finite-Sum Coupled Compositional OptimizationBokun Wang, Tianbao YangICML 2025
Builds on1
Related papers
- Distributionally Robust Optimization with Bias and Variance ReductionRonak Mehta, Vincent Roulet, Krishna Pillutla, Zaïd HarchaouiICLR 2024 · 6 citations
- Risk-Aware Stochastic Shortest PathTobias MeggendorferAAAI 2022 · 13 citations
- Two steps to risk sensitivityChris Gagne, Peter DayanNeurIPS 2021 · 17 citations
- PAC-Bayesian Bound for the Conditional Value at RiskZakaria Mhammedi, Benjamin Guedj, Robert C. WilliamsonNeurIPS 2020 · 25 citations
- Non-convex Distributionally Robust Optimization: Non-asymptotic AnalysisJikai Jin, Bohang Zhang, Haiyang Wang, Liwei WangNeurIPS 2021 · 65 citations
