A Model-Based Method for Minimizing CVaR and Beyond

05/27/2023
by   Si Yi Meng, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/10/2022

Stochastic Optimization for Spectral Risk Measures

Spectral risk objectives - also called L-risks - allow for learning syst...
research
11/03/2012

Stochastic ADMM for Nonsmooth Optimization

We present a stochastic setting for optimization problems with nonsmooth...
research
05/22/2019

Learning Robust Options by Conditional Value at Risk Optimization

Options are generally learned by using an inaccurate environment model (...
research
03/25/2021

Minimizing Nonsmooth Convex Functions with Variable Accuracy

We consider unconstrained optimization problems with nonsmooth and conve...
research
06/01/2018

Equivalence Between Wasserstein and Value-Aware Model-based Reinforcement Learning

Learning a generative model is a key component of model-based reinforcem...
research
12/11/2022

Robust Estimation and Inference for Expected Shortfall Regression with Many Regressors

Expected Shortfall (ES), also known as superquantile or Conditional Valu...
research
02/07/2023

Two Losses Are Better Than One: Faster Optimization Using a Cheaper Proxy

We present an algorithm for minimizing an objective with hard-to-compute...

Please sign up or login with your details

Forgot password? Click here to reset