mlsanityData to 14 Oct 2026

MINTS: Minimalist Thompson Sampling

arXiv 2606.01655 ↗First posted 1 Jun 2026math.OC cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

The Bayesian paradigm offers principled tools for sequential decision-making under uncertainty, but its reliance on a probabilistic model for all parameters can hinder the incorporation of complex structural constraints. We introduce a minimalist Bayesian framework that places a prior only on the location of the optimum, while eliminating nuisance parameters through profile likelihood. This yields a generalized posterior that naturally accommodates structural constraints. As a direct instantiation, we develop MINimalist Thompson Sampling (MINTS). For multi-armed bandits with mean constraints, we establish near-optimal non-asymptotic regret guarantees and sharp almost-sure asymptotic regret characterizations. In particular, MINTS attains the classical Lai--Robbins constant in the unstructured setting and automatically adapts to unimodal structure, achieving the sharp constant determined only by the immediate neighbors of the optimal arm.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 57 references that are in the map. First posted on arXiv 1 Jun 2026.

Builds on

20 of 57 references.

References · 20

  1. 2017A Tutorial on Thompson Samplingcited by 433
  2. 2014Predictive Entropy Search for Efficient Global Optimization of Black-box Functionscited by 204
  3. 2013A General Framework for Updating Belief Distributionscited by 175
  4. 2014Learning to Optimize via Information-Directed Samplingcited by 168
  5. 2016Explore First, Exploit Next: The True Shape of Regret in Bandit Problemscited by 79
  6. 2018Mirrored Langevin Dynamicscited by 61
  7. 2015Sampling from a log-concave distribution with Projected Langevin Monte Carlocited by 52
  8. 2020A Survey of Constrained Gaussian Process Regression: Approaches and Implementation Challengescited by 52
  9. 2013Thompson Sampling for Complex Bandit Problemscited by 43
  10. 2017Sampling from a log-concave distribution with compact support with proximal Langevin Monte Carlocited by 43
  11. 2017Minimal Exploration in Structured Stochastic Banditscited by 41
  12. 2014Unimodal Bandits: Regret Lower Bounds and Optimal Algorithmscited by 37
8 more
  1. 2021A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithmscited by 30
  2. 2020Structure Adaptive Algorithms for Stochastic Banditscited by 19
  3. 2024UCB algorithms for multi-armed bandits: Precise regret and adaptive inferencecited by 19
  4. 2021The Fragility of Optimized Bandit Algorithmscited by 17
  5. 2020Optimal Learning for Structured Banditscited by 14
  6. 2022The Typical Behavior of Bandit Algorithmscited by 12
  7. 2016Unimodal Thompson Sampling for Graph-Structured Armscited by 8
  8. 2026Thompson sampling: Precise arm-pull dynamics and adaptive inferencecited by 6

Built on by

Not cited yet.