Online Estimation and Optimization of Utility-Based Shortfall Risk

Utility-based shortfall risk (UBSR) is a risk metric that is increasingly popular in financial applications, owing to certain desirable properties that it enjoys. We consider the problem of estimating UBSR in a recursive setting, in which samples from the underlying loss distribution are available one at a time. We cast the UBSR estimation problem as a root-finding problem and propose stochastic approximation-based estimation schemes. We derive nonasymptotic bounds on the estimation error in the number of samples. We also consider the problem of UBSR optimization within a parameterized class of random variables. We propose a stochastic gradient descent–based algorithm for UBSR optimization and derive nonasymptotic bounds on its convergence.

Authors

Institutions

Publication Details

Journal
Mathematics of Operations Research
Published
2024-09-16
DOI
https://doi.org/10.1287/moor.2022.0266
Citations
1
Primary Topic
Risk and Portfolio Optimization
Type
article
Field-Weighted Citation Impact
0.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Online Estimation and Optimization of Utility-Based Shortfall Risk

Krishna Jagannathan, Arvind S. Menon, V. S. Hegde, L. A. Prashanth
1 citations
Mathematics of Operations Research
Risk and Portfolio Optimization
0.49
article

Online Estimation and Optimization of Utility-Based Shortfall Risk

Krishna Jagannathan, Arvind S. Menon, V. S. Hegde, L. A. Prashanth
article en
1 citations

Abstract

Utility-based shortfall risk (UBSR) is a risk metric that is increasingly popular in financial applications, owing to certain desirable properties that it enjoys. We consider the problem of estimating UBSR in a recursive setting, in which samples from the underlying loss distribution are available one at a time. We cast the UBSR estimation problem as a root-finding problem and propose stochastic approximation-based estimation schemes. We derive nonasymptotic bounds on the estimation error in the number of samples. We also consider the problem of UBSR optimization within a parameterized class of random variables. We propose a stochastic gradient descent–based algorithm for UBSR optimization and derive nonasymptotic bounds on its convergence.

Mathematics of Operations ResearchVol. 50(4)
Indian Institute of Technology Madras (IN)
Openalex Percentile: Top 38%
Risk and Portfolio Optimization
0.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.