Exploiting Correlated Auxiliary Feedback in Parameterized Bandits
Not on the map. Why?
Abstract (arXiv)
We study a novel variant of the parameterized bandits problem in which the learner can observe additional auxiliary feedback that is correlated with the observed reward. The auxiliary feedback is readily available in many real-life applications, e.g., an online platform that wants to recommend the best-rated services to its users can observe the user's rating of service (rewards) and collect additional information like service delivery time (auxiliary feedback). In this paper, we first develop a method that exploits auxiliary feedback to build a reward estimator with tight confidence bounds, leading to a smaller regret. We then characterize the regret reduction in terms of the correlation coefficient between reward and its auxiliary feedback. Experimental results in different settings also verify the performance gain achieved by our proposed method.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 15 of its 38 references that are in the map. First posted on arXiv 5 Nov 2023.
Builds on
15 of 38 references.
References · 15
- 2019Introduction to Multi-Armed Banditscited by 481
- 2017On Kernelized Multi-armed Banditscited by 352
- 2013Finite-Time Analysis of Kernelised Contextual Banditscited by 177
- 2015Online Learning with Feedback Graphs: Beyond Banditscited by 80
- 2017Scalable Generalized Linear Bandits: Online Computation and Hashingcited by 64
- 2014Nonstochastic Multi-Armed Bandits with Graph-Structured Feedbackcited by 61
- 2017Bandit Structured Prediction for Neural Sequence-to-Sequence Learningcited by 31
- 2015Online Learning with Gaussian Payoffs and Side Observationscited by 15
- 2021Control Variates for Slate Off-Policy Evaluationcited by 13
- 2019Online Algorithm for Unsupervised Sensor Selectioncited by 7
- 2020Online Algorithm for Unsupervised Sequential Selection with Contextual Informationcited by 7
- 2021Stochastic Multi-Armed Bandits with Control Variatescited by 7
Built on by
Citing papers per year: 2024: 2; 2025: 1; 2026: 4.
7 papers.
- 2024Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copiescited by 4
- 2026Correlation-Aware Contextual Bandits with Surrogate Rewards for LLM Routingcited by 3
- 2025COBRA: Contextual Bandit Algorithm for Ensuring Truthful Strategic Agentscited by 1
- 2026Best-Arm Identification with Generative Proxycited by 1
- 2024Multi-armed Bandits with Missing Outcomecited by 0
- 2026Stochastic Multi-Armed Bandits with Limited Control Variatescited by 0
- 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
- 2026Correlation-Aware Contextual Bandits with Surrogate Rewards for LLM Routing10 Jul 2026
- 2026Best-Arm Identification with Generative Proxy8 Jul 2026
- 2026Stochastic Multi-Armed Bandits with Limited Control Variates2 Mar 2026
- 2025COBRA: Contextual Bandit Algorithm for Ensuring Truthful Strategic Agents29 May 2025
- 2024Multi-armed Bandits with Missing Outcome8 Nov 2024
- 2024Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies23 Aug 2024