mlsanityData to 7 Oct 2026

Risk-Averse Stochastic Convex Bandit

arXiv 1810.00737 ↗First posted 1 Oct 2018cs.LG stat.MLcited by 13

Not on the map. Why?

Abstract (arXiv)

Motivated by applications in clinical trials and finance, we study the problem of online convex optimization (with bandit feedback) where the decision maker is risk-averse. We provide two algorithms to solve this problem. The first one is a descent-type algorithm which is easy to implement. The second algorithm, which combines the ellipsoid method and a center point device, achieves (almost) optimal regret bounds with respect to the number of rounds. To the best of our knowledge this is the first attempt to address risk-aversion in the online convex bandit problem.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 1 Oct 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 3; 2023: 1; 2024: 2; 2025: 2; 2026: 1.

13 papers.

Sort: