mlsanityData to 7 Oct 2026

Risk level dependent Minimax Quantile lower bounds for Interactive Statistical Decision Making

arXiv 2510.05808 ↗First posted 7 Oct 2025cs.IT cs.AI math.ITcited by 2

Not on the map. Why?

Abstract (arXiv)

Minimax risk and regret focus on expectation, missing rare failures critical in safety-critical bandits and reinforcement learning. Minimax quantiles capture these tails. Three strands of prior work motivate this study: minimax-quantile bounds restricted to non-interactive estimation; unified interactive analyses that focus on expected risk rather than risk level specific quantile bounds; and high-probability bandit bounds that still lack a quantile-specific toolkit for general interactive protocols. To close this gap, within the interactive statistical decision making framework, we develop high-probability Fano and Le Cam tools and derive risk level explicit minimax-quantile bounds, including a quantile-to-expectation conversion and a tight link between strict and lower minimax quantiles. Instantiating these results for the two-armed Gaussian bandit immediately recovers optimal-rate bounds.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 7 of its 17 references that are in the map. First posted on arXiv 7 Oct 2025.

Builds on

7 of 17 references.

References · 7

  1. 2017Minimax Regret Bounds for Reinforcement Learningcited by 500
  2. 2018Is Q-learning Provably Efficient?cited by 485
  3. 2021The Statistical Complexity of Interactive Decision Makingcited by 208
  4. 2016Refined Lower Bounds for Adversarial Banditscited by 20
  5. 2022Model-Free Reinforcement Learning with the Decision-Estimation Coefficientcited by 11
  6. 2024High-probability minimax lower boundscited by 11
  7. 2024Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnabilitycited by 11

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.