mlsanityData to 14 Oct 2026

Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits

arXiv 2503.00273 ↗First posted 1 Mar 2025stat.ML cs.IT cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

We study the evolution of information in interactive decision making through the lens of a stochastic multi-armed bandit problem. Focusing on a fundamental example where a unique optimal arm outperforms the rest by a fixed margin, we characterize the optimal success probability and mutual information over time. Our findings reveal distinct growth phases in mutual information -- initially linear, transitioning to quadratic, and finally returning to linear -- highlighting curious behavioral differences between interactive and non-interactive environments. In particular, we show that optimal success probability and mutual information can be decoupled, where achieving optimal learning does not necessarily require maximizing information gain. These findings shed new light on the intricate interplay between information and learning in interactive decision making.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 22 of its 56 references that are in the map. First posted on arXiv 1 Mar 2025.

Builds on

22 of 56 references.

References · 22

  1. 2016Optimal Best Arm Identification with Fixed Confidencecited by 239
  2. 2021The Statistical Complexity of Interactive Decision Makingcited by 218
  3. 2014An Information-Theoretic Analysis of Thompson Samplingcited by 178
  4. 2014Learning to Optimize via Information-Directed Samplingcited by 168
  5. 2016Simple Bayesian Algorithms for Best Arm Identificationcited by 117
  6. 2019Batched Multi-armed Bandits Problemcited by 98
  7. 2016Explore First, Exploit Next: The True Shape of Regret in Bandit Problemscited by 79
  8. 2016Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problemcited by 79
  9. 2019The True Sample Complexity of Identifying Good Armscited by 37
  10. 2022On the Complexity of Adversarial Decision Makingcited by 33
  11. 2017The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regimecited by 31
  12. 2023Tight Guarantees for Interactive Decision Making with the Decision-Estimation Coefficientcited by 30
10 more
  1. 2022Revisiting Simple Regret: Fast Rates for Returning a Good Armcited by 25
  2. 2022Minimax Optimal Algorithms for Fixed-Budget Best Arm Identificationcited by 20
  3. 2021Optimal Gradient-based Algorithms for Non-concave Bandit Optimizationcited by 15
  4. 2022Bayesian Fixed-Budget Best-Arm Identificationcited by 13
  5. 2021Bandit Phase Retrievalcited by 12
  6. 2023Optimal Bounds for Noisy Sortingcited by 8
  7. 2023Statistical Complexity and Optimal Algorithms for Non-linear Ridge Banditscited by 7
  8. 2023Noisy Computing of the mathsfOR and mathsfMAX Functionscited by 1
  9. 2024Noisy Computing of the Threshold Functioncited by 1
  10. 2025Tight Bounds for Noisy Computation of High-Influence Functions, Connectivity, and Thresholdcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.