Context Attentive Bandits: Contextual Bandit with Restricted Context
Not on the map. Why?
Abstract (arXiv)
We consider a novel formulation of the multi-armed bandit model, which we call the contextual bandit with restricted context, where only a limited number of features can be accessed by the learner at every iteration. This novel formulation is motivated by different online problems arising in clinical trials, recommender systems and attention modeling. Herein, we adapt the standard multi-armed bandit algorithm known as Thompson Sampling to take advantage of our restricted context setting, and propose two novel algorithms, called the Thompson Sampling with Restricted Context(TSRC) and the Windows Thompson Sampling with Restricted Context(WTSRC), for handling stationary and nonstationary environments, respectively. Our empirical results demonstrate advantages of the proposed approaches on several real-life datasets
Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 May 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 3; 2023: 3; 2024: 1; 2025: 2; 2026: 2.
14 papers.
Sort:
- 2021Analysis of Thompson Sampling for Partially Observable Contextual Multi-Armed Banditscited by 10
- 2025Survey: Multi-Armed Bandits Meet Large Language Modelscited by 6
- 2021Optimal Epidemic Control as a Contextual Combinatorial Bandit with Budgetcited by 5
- 2023Linear Bandits with Memory: from Rotting to Risingcited by 5
- 2022Efficient Algorithms for Learning to Control Bandits with Unobserved Contextscited by 3
- 2025Multiplayer Information Asymmetric Contextual Banditscited by 3
- 2022Worst-case Performance of Greedy Policies in Bandits with Imperfect Context Observationscited by 2
- 2023Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed Bandit Approachcited by 1
- 2021Etat de l'art sur l'application des bandits multi-brascited by 0
- 2022Bayesian Non-stationary Linear Bandits for Large-Scale Recommender Systemscited by 0
- 2023Online Learning with Costly Features in Non-stationary Environmentscited by 0
- 2024Multi-armed Bandits with Missing Outcomecited by 0
- 2026Online Learning with Recency: Algorithms for Sliding-window Streaming Multi-armed Bandits8 Jun 2026
- 2026NH-CROP: Robust Pricing for Governed Language Data Assets under Cost Uncertainty3 May 2026
- 2025Survey: Multi-Armed Bandits Meet Large Language Models19 May 2025
- 2025Multiplayer Information Asymmetric Contextual Bandits11 Mar 2025
- 2024Multi-armed Bandits with Missing Outcome8 Nov 2024
- 2023Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed Bandit Approach21 Aug 2023
- 2023Online Learning with Costly Features in Non-stationary Environments18 Jul 2023
- 2023Linear Bandits with Memory: from Rotting to Rising16 Feb 2023
- 2022Worst-case Performance of Greedy Policies in Bandits with Imperfect Context Observations10 Apr 2022
- 2022Bayesian Non-stationary Linear Bandits for Large-Scale Recommender Systems7 Feb 2022
- 2022Efficient Algorithms for Learning to Control Bandits with Unobserved Contexts2 Feb 2022
- 2021Analysis of Thompson Sampling for Partially Observable Contextual Multi-Armed Bandits23 Oct 2021
2 more
- 2021Analysis of Thompson Sampling for Partially Observable Contextual Multi-Armed Banditscited by 10
- 2025Survey: Multi-Armed Bandits Meet Large Language Modelscited by 6
- 2021Optimal Epidemic Control as a Contextual Combinatorial Bandit with Budgetcited by 5
- 2023Linear Bandits with Memory: from Rotting to Risingcited by 5
- 2022Efficient Algorithms for Learning to Control Bandits with Unobserved Contextscited by 3
- 2025Multiplayer Information Asymmetric Contextual Banditscited by 3
- 2022Worst-case Performance of Greedy Policies in Bandits with Imperfect Context Observationscited by 2
- 2023Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed Bandit Approachcited by 1
- 2021Etat de l'art sur l'application des bandits multi-brascited by 0
- 2022Bayesian Non-stationary Linear Bandits for Large-Scale Recommender Systemscited by 0
- 2023Online Learning with Costly Features in Non-stationary Environmentscited by 0
- 2024Multi-armed Bandits with Missing Outcomecited by 0
12 most cited of 14 All 14 (JSON)
- 2026Online Learning with Recency: Algorithms for Sliding-window Streaming Multi-armed Bandits8 Jun 2026
- 2026NH-CROP: Robust Pricing for Governed Language Data Assets under Cost Uncertainty3 May 2026
- 2025Survey: Multi-Armed Bandits Meet Large Language Models19 May 2025
- 2025Multiplayer Information Asymmetric Contextual Bandits11 Mar 2025
- 2024Multi-armed Bandits with Missing Outcome8 Nov 2024
- 2023Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed Bandit Approach21 Aug 2023
- 2023Online Learning with Costly Features in Non-stationary Environments18 Jul 2023
- 2023Linear Bandits with Memory: from Rotting to Rising16 Feb 2023
- 2022Worst-case Performance of Greedy Policies in Bandits with Imperfect Context Observations10 Apr 2022
- 2022Bayesian Non-stationary Linear Bandits for Large-Scale Recommender Systems7 Feb 2022
- 2022Efficient Algorithms for Learning to Control Bandits with Unobserved Contexts2 Feb 2022
- 2021Analysis of Thompson Sampling for Partially Observable Contextual Multi-Armed Bandits23 Oct 2021
12 newest of 14 All 14 (JSON)