mlsanityData to 14 Oct 2026

Set Membership Estimation for Stochastic Linear Contextual Bandits

arXiv 2606.20022 ↗First posted 18 Jun 2026stat.ML cs.LG math.OCcited by 0

Not on the map. Why?

Abstract (arXiv)

Contextual bandit learning has attracted increasing attention in engineering applications due to its ability to incorporate side/context information in time-varying environments. A widely used approach for contextual bandits is optimism in the face of uncertainty (OFU), in which uncertainty sets for unknown parameters are constructed and decisions are made optimistically over these sets. In the bandit literature, uncertainty sets are typically derived using statistical learning tools, such as confidence intervals. In contrast, set membership estimation (SME), a well-established uncertainty quantification approach in control and system identification, has received little attention in the bandit literature. This paper investigates the connection between SME and contextual bandits by focusing on linear contextual bandits as a starting point. We propose an SME-based OFU algorithm and establish a sublinear regret bound under proper assumptions. Simulations further demonstrate the promising performance of SME-OFU compared with existing methods. This supplementary manuscript provides more proof details in Section IV and the Appendix.

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

Builds on

30 of 62 references.

References · 30

  1. 2020Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oraclescited by 197
  2. 2018Learning Without Mixing: Towards A Sharp Analysis of Linear System Identificationcited by 158
  3. 2021Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learningcited by 66
  4. 2016Conservative Contextual Linear Banditscited by 57
  5. 2019Nearly Minimax-Optimal Regret for Linearly Parameterized Banditscited by 54
  6. 2022Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptionscited by 51
  7. 2020Efficient and Robust Algorithms for Adversarial Linear Contextual Banditscited by 43
  8. 2018Balanced Linear Contextual Banditscited by 30
  9. 2021Leveraging Good Representations in Linear Contextual Banditscited by 29
  10. 2022Shuffle Private Linear Contextual Banditscited by 27
  11. 2021Doubly robust Thompson sampling for linear payoffscited by 21
  12. 2022Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithmscited by 19
18 more
  1. 2023Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Banditscited by 19
  2. 2017An Actor-Critic Contextual Bandit Algorithm for Personalized Mobile Health Interventionscited by 17
  3. 2019Tight Regret Bounds for Infinite-armed Linear Contextual Banditscited by 17
  4. 2020Stochastic Linear Contextual Bandits with Diverse Contextscited by 16
  5. 2022Thompson Sampling for High-Dimensional Sparse Linear Contextual Banditscited by 16
  6. 2018Efficient Linear Bandits through Matrix Sketchingcited by 12
  7. 2020Spoiled for Choice? Personalized Recommendation for Healthcare Decisions: A Multi-Armed Bandit Approachcited by 10
  8. 2017Contextual Linear Bandits under Noisy Features: Towards Bayesian Oraclescited by 9
  9. 2019Robust Adaptive Model Predictive Control: Performance and Parameter Estimationcited by 7
  10. 2024Contextual Restless Multi-Armed Bandits with Application to Demand Response Decision-Makingcited by 7
  11. 2024Identification of Analytic Nonlinear Dynamical Systems with Non-asymptotic Guaranteescited by 7
  12. 2023Learning the Uncertainty Sets for Control Dynamics via Set Membership: A Non-Asymptotic Analysiscited by 6
  13. 2020Online Residential Demand Response via Contextual Multi-Armed Banditscited by 5
  14. 2022Online Adversarial Stabilization of Unknown Networked Systemscited by 5
  15. 2019AdaLinUCB: Opportunistic Learning for Contextual Banditscited by 4
  16. 2024On the Sample Complexity of Set Membership Estimation for Linear Systems with Disturbances Bounded by Convex Setscited by 3
  17. 2025System Identification Under Bounded Noise: Optimal Rates Beyond Least Squarescited by 2
  18. 2026Active Learning for Stochastic Contextual Linear Banditscited by 1

Built on by

Not cited yet.