Optimal Best-Arm Identification Methods for Tail-Risk Measures
Not on the map. Why?
Abstract (arXiv)
Conditional value-at-risk (CVaR) and value-at-risk (VaR) are popular tail-risk measures in finance and insurance industries as well as in highly reliable, safety-critical uncertain environments where often the underlying probability distributions are heavy-tailed. We use the multi-armed bandit best-arm identification framework and consider the problem of identifying the arm from amongst finitely many that has the smallest CVaR, VaR, or weighted sum of CVaR and mean. The latter captures the risk-return trade-off common in finance. Our main contribution is an optimal δ-correct algorithm that acts on general arms, including heavy-tailed distributions, and matches the lower bound on the expected number of samples needed, asymptotically (as δ approaches 0). The algorithm requires solving a non-convex optimization problem in the space of probability measures, that requires delicate analysis. En-route, we develop new non-asymptotic empirical likelihood-based concentration inequalities for tail-risk measures which are tighter than those for popular truncation-based empirical estimators.
Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Aug 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 2; 2023: 1; 2024: 1; 2025: 6; 2026: 4.
17 papers.
Sort:
- 2022Top Two Algorithms Revisitedcited by 34
- 2021Regret Minimization in Heavy-Tailed Banditscited by 24
- 2025Sequential Learning of the Pareto Front for Multi-objective Banditscited by 13
- 2021A Unifying Theory of Thompson Sampling for Continuous Risk-Averse Banditscited by 9
- 2024A General Framework for Clustering and Distribution Matching with Bandit Feedbackcited by 7
- 2025On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Boundscited by 5
- 2021From Optimality to Robustness: Dirichlet Sampling Strategies in Stochastic Banditscited by 4
- 2025Eventually LIL Regret: Almost Sure lnln T Regret for a sub-Gaussian Mixture on Unbounded Datacited by 2
- 2025Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequencescited by 2
- 2026Multi-Armed Sequential Hypothesis Testing by Bettingcited by 1
- 2022Towards an efficient and risk aware strategy for guiding farmers in identifying best crop managementcited by 0
- 2023Best arm identification in rare eventscited by 0
5 more
- 2025EVaR-Optimal Arm Identification in Banditscited by 0
- 2025UCB for Large-Scale Pure Exploration: Beyond Sub-Gaussianitycited by 0
- 2026Asymptotically Optimal Sequential Testing with Markovian Datacited by 0
- 2026Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewardscited by 0
- 2026Cover meets Robbins while Betting on Bounded Data: ln n Regret and Almost Sure lnln n Regretcited by 0
- 2026Cover meets Robbins while Betting on Bounded Data: ln n Regret and Almost Sure lnln n Regret22 Apr 2026
- 2026Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards16 Apr 2026
- 2026Multi-Armed Sequential Hypothesis Testing by Betting18 Mar 2026
- 2026Asymptotically Optimal Sequential Testing with Markovian Data19 Feb 2026
- 2025Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequences15 Dec 2025
- 2025Eventually LIL Regret: Almost Sure lnln T Regret for a sub-Gaussian Mixture on Unbounded Data13 Dec 2025
- 2025UCB for Large-Scale Pure Exploration: Beyond Sub-Gaussianity27 Nov 2025
- 2025EVaR-Optimal Arm Identification in Bandits6 Oct 2025
- 2025On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Bounds28 Apr 2025
- 2025Sequential Learning of the Pareto Front for Multi-objective Bandits29 Jan 2025
- 2024A General Framework for Clustering and Distribution Matching with Bandit Feedback8 Sep 2024
- 2023Best arm identification in rare events14 Mar 2023
5 more
- 2022Towards an efficient and risk aware strategy for guiding farmers in identifying best crop management10 Oct 2022
- 2022Top Two Algorithms Revisited13 Jun 2022
- 2021From Optimality to Robustness: Dirichlet Sampling Strategies in Stochastic Bandits18 Nov 2021
- 2021A Unifying Theory of Thompson Sampling for Continuous Risk-Averse Bandits25 Aug 2021
- 2021Regret Minimization in Heavy-Tailed Bandits7 Feb 2021
- 2022Top Two Algorithms Revisitedcited by 34
- 2021Regret Minimization in Heavy-Tailed Banditscited by 24
- 2025Sequential Learning of the Pareto Front for Multi-objective Banditscited by 13
- 2021A Unifying Theory of Thompson Sampling for Continuous Risk-Averse Banditscited by 9
- 2024A General Framework for Clustering and Distribution Matching with Bandit Feedbackcited by 7
- 2025On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Boundscited by 5
- 2021From Optimality to Robustness: Dirichlet Sampling Strategies in Stochastic Banditscited by 4
- 2025Eventually LIL Regret: Almost Sure lnln T Regret for a sub-Gaussian Mixture on Unbounded Datacited by 2
- 2025Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequencescited by 2
- 2026Multi-Armed Sequential Hypothesis Testing by Bettingcited by 1
- 2022Towards an efficient and risk aware strategy for guiding farmers in identifying best crop managementcited by 0
- 2023Best arm identification in rare eventscited by 0
12 most cited of 17 All 17 (JSON)
- 2026Cover meets Robbins while Betting on Bounded Data: ln n Regret and Almost Sure lnln n Regret22 Apr 2026
- 2026Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards16 Apr 2026
- 2026Multi-Armed Sequential Hypothesis Testing by Betting18 Mar 2026
- 2026Asymptotically Optimal Sequential Testing with Markovian Data19 Feb 2026
- 2025Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequences15 Dec 2025
- 2025Eventually LIL Regret: Almost Sure lnln T Regret for a sub-Gaussian Mixture on Unbounded Data13 Dec 2025
- 2025UCB for Large-Scale Pure Exploration: Beyond Sub-Gaussianity27 Nov 2025
- 2025EVaR-Optimal Arm Identification in Bandits6 Oct 2025
- 2025On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Bounds28 Apr 2025
- 2025Sequential Learning of the Pareto Front for Multi-objective Bandits29 Jan 2025
- 2024A General Framework for Clustering and Distribution Matching with Bandit Feedback8 Sep 2024
- 2023Best arm identification in rare events14 Mar 2023
12 newest of 17 All 17 (JSON)