paper-with-me

Papers

X-Armed Bandits: Optimizing Quantiles, CVaR and Other Risks

2019-04-17 · Léonard Torossian, Aurélien Garivier, Victor Picheny

We propose and analyze StoROO, an algorithm for risk optimization on stochastic black-box functions derived from StoOO. Motivated by risk-averse decision making fields like agriculture, medicine, biology or finance, we do not focus on the mean payoff but on generic functionals of the return distribution. We provide a generic regret analysis of StoROO and illustrate its applicability with two examples: the optimization of quantiles and CVaR. Inspired by the bandit literature and black-box mean optimizers, StoROO relies on the possibility to construct confidence intervals for the targeted functional based on random-size samples. We detail their construction in the case of quantiles, providing tight bounds based on Kullback-Leibler divergence. We finally present numerical experiments that show a dramatic impact of tight bounds for the optimization of quantiles and CVaR.

📄 PDF Abstract BibTeX arXiv:1904.08205

Code (0)

등록된 구현이 없습니다.

Tasks

Decision Making

Similar Papers 제목 키워드 기반

Risk averse non-stationary multi-armed bandits

2021-09-28 · Leo Benac, Frédéric Godin

This paper tackles the risk averse multi-armed bandits problem when incurred losses are non-stationary. The conditional value-at-risk (CVaR) is used as the objective function. Two estimation methods are proposed for this…

Multi-Armed Bandits

Risk-Constrained Thompson Sampling for CVaR Bandits

2020-11-16 · Joel Q. L. Chang, Qiuyu Zhu, Vincent Y. F. Tan

The multi-armed bandit (MAB) problem is a ubiquitous decision-making problem that exemplifies the exploration-exploitation tradeoff. Standard formulations exclude risk in decision making. Risk notably complicates the bas…

Decision MakingThompson Sampling

Minimax Quantile Lower Bounds for Interactive Statistical Decision Making with Privacy

2026-06-22 · Raghav Bongole, Amirreza Zamani, Tobias J. Oechtering, Mikael Skoglund arxiv

Minimax risk and regret are expectation-based criteria and do not capture rare but consequential failures. To address this concern, we develop a $δ$-explicit minimax-quantile theory for interactive statistical decision m…

Decision Making

Risk-aware linear bandits with convex loss

2022-09-15 · Patrick Saux, Odalric-Ambrym Maillard

In decision-making problems such as the multi-armed bandit, an agent learns sequentially by optimizing a certain feedback. While the mean reward criterion has been extensively studied, other measures that reflect an aver…

Decision MakingMulti-Armed Bandits

Risk-Aware Algorithms for Combinatorial Semi-Bandits

2021-12-02 · Shaarad Ayyagari, Ambedkar Dukkipati

In this paper, we study the stochastic combinatorial multi-armed bandit problem under semi-bandit feedback. While much work has been done on algorithms that optimize the expected reward for linear as well as some general…