A Distribution Optimization Framework for Confidence Bounds of Risk Measures
Hao Liang, Zhi-Quan Luo
Abstract
We present a distribution optimization framework that significantly improves confidence bounds for various risk measures compared to previous methods. Our framework encompasses popular risk measures such as the entropic risk measure, conditional value at risk (CVaR), spectral risk measure, distortion risk measure, equivalent certainty, and rank-dependent expected utility, which are well established in risk-sensitive decision-making literature. To achieve this, we introduce two estimation schemes based on concentration bounds derived from the empirical distribution, specifically using either the Wasserstein distance or the supremum distance. Unlike traditional approaches that add or subtract a confidence radius from the empirical risk measures, our proposed schemes evaluate a specific transformation of the empirical distribution based on the distance. Consequently, our confidence bounds consistently yield tighter results compared to previous methods. We further verify the efficacy of the proposed framework by providing tighter problem-dependent regret bound for the CVaR bandit.
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 55a8ce1a-5d48-4391-a6aa-95e697fa682eCited by top-tier papers1
Ask how each one uses itBuilds on5
- Being Optimistic to Be Conservative: Quickly Learning a CVaR PolicyRamtin Keramati, Christoph Dann, Alex Tamkin, Emma BrunskillAAAI 2020 · 86 citations
- Universal Off-Policy EvaluationYash Chandak, Scott Niekum, Bruno C. da Silva, Erik G. Learned-Miller et al.NeurIPS 2021 · 64 citations
- Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed distributionsPrashanth L. A., Krishna P. Jagannathan, Ravi Kumar KollaICML 2020 · 53 citations
- Optimal Thompson Sampling strategies for support-aware CVaR banditsDorian Baudry, Romain Gautron, Emilie Kaufmann, Odalric MaillardICML 2021 · 40 citations
- Estimation of Spectral Risk MeasuresAjay Kumar Pandey, Prashanth L. A., Sanjay P. BhatAAAI 2021 · 12 citations
Related papers
- Regret Bounds for Markov Decision Processes with Recursive Optimized Certainty EquivalentsWenhao Xu, Xuefeng Gao, Xuedong HeICML 2023 · 14 citations
- Optimal Best-Arm Identification Methods for Tail-Risk MeasuresShubhada Agrawal, Wouter M. Koolen, Sandeep JunejaNeurIPS 2021 · 34 citations
- A Unifying Theory of Thompson Sampling for Continuous Risk-Averse BanditsJoel Q. L. Chang, Vincent Y. F. TanAAAI 2022 · 18 citations
- A Reductions Approach to Risk-Sensitive Reinforcement Learning with Optimized Certainty EquivalentsKaiwen Wang, Dawen Liang, Nathan Kallus, Wen SunICML 2025
- Learning Bounds for Risk-sensitive LearningJaeho Lee, Sejun Park, Jinwoo ShinNeurIPS 2020 · 52 citations
