Pure Exploration Beyond Reward Feedback: The Role of Post-Action Context
Not on the map. Why?
Abstract (arXiv)
We introduce the problem of best arm identification (BAI) with post-action context, a new BAI problem in a stochastic multi-armed bandit environment and the fixed-confidence setting. The problem addresses the scenarios in which the learner receives a post-action context in addition to the reward after playing each action. This post-action context provides additional information that can significantly facilitate the decision process. We analyze two different types of the post-action context: (i) separator, where the reward depends solely on the context, and (ii) non-separator, where the reward depends on both the action and the context. For both cases, we derive instance-dependent lower bounds on the sample complexity and propose algorithms that asymptotically achieve the optimal sample complexity. For the separator setting, we propose a novel sampling rule called G-tracking, which uses the geometry of the context space to directly track the contexts rather than the actions. For the non-separator setting, we do so by demonstrating that the Track-and-Stop algorithm can be extended to this setting. Moreover, in both settings, we theoretically and empirically show that algorithms that ignore the post-action context are sub-optimal. Finally, our empirical results showcase the advantage of our approaches compared to the state of the art.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 5 Feb 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2025: 3; 2026: 2.
5 papers.
- 2025Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interferencecited by 5
- 2025Best Group Identification in Multi-Objective Banditscited by 2
- 2025Graph Learning Is Suboptimal in Causal Banditscited by 2
- 2026The Surrogate Is Not the Reward: Post-Surrogate Primary-Outcome Acquisition in Contextual Banditscited by 1
- 2026Gaussian Process Bandits for AI System Optimization with Selectively Verified Feedbackcited by 0
- 2026Gaussian Process Bandits for AI System Optimization with Selectively Verified Feedback13 Oct 2026
- 2026The Surrogate Is Not the Reward: Post-Surrogate Primary-Outcome Acquisition in Contextual Bandits5 Oct 2026
- 2025Graph Learning Is Suboptimal in Causal Bandits19 Oct 2025
- 2025Best Group Identification in Multi-Objective Bandits23 May 2025
- 2025Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference10 Mar 2025