Provably Efficient Interactive-Grounded Learning with Personalized Reward
Not on the map. Why?
Abstract (arXiv)
Interactive-Grounded Learning (IGL) [Xie et al., 2021] is a powerful framework in which a learner aims at maximizing unobservable rewards through interacting with an environment and observing reward-dependent feedback on the taken actions. To deal with personalized rewards that are ubiquitous in applications such as recommendation systems, Maghakian et al. [2022] study a version of IGL with context-dependent feedback, but their algorithm does not come with theoretical guarantees. In this work, we consider the same problem and provide the first provably efficient algorithms with sublinear regret under realizability. Our analysis reveals that the step-function estimator of prior work can deviate uncontrollably due to finite-sample effects. Our solution is a novel Lipschitz reward estimator which underestimates the true reward and enjoys favorable generalization performances. Building on this estimator, we propose two algorithms, one based on explore-then-exploit and the other based on inverse-gap weighting. We apply IGL to learning from image feedback and learning from text feedback, which are reward-free settings that arise in practice. Experimental results showcase the importance of using our Lipschitz reward estimator and the overall effectiveness of our algorithms.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 19 of its 35 references that are in the map. First posted on arXiv 31 May 2024.
Builds on
19 of 35 references.
References · 19
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
- 2023Qwen Technical Reportcited by 3,344
- 2024Chatbot Arena: An Open Platform for Evaluating LLMs by Human Preferencecited by 1,184
- 2014Taming the Monster: A Fast and Simple Algorithm for Contextual Banditscited by 201
- 2020Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oraclescited by 197
- 2020Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizabilitycited by 115
- 2018Practical Contextual Bandits with Regression Oraclescited by 93
- 2021Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discriminationcited by 53
- 2015Fast rates in statistical and online learningcited by 47
- 2020Information Directed Sampling for Linear Partial Monitoringcited by 40
7 more
- 2023Practical Contextual Bandits with Feedback Graphscited by 11
- 2018Contextual bandits with surrogate losses: Margin bounds and efficient algorithmscited by 10
- 2021Interaction-Grounded Learningcited by 9
- 2022Personalized Reward Learning with Interaction-Grounded Learning (IGL)cited by 9
- 2022Interaction-Grounded Learning with Action-inclusive Feedbackcited by 7
- 2024Efficient Contextual Bandits with Uninformed Feedback Graphscited by 6
- 2024An Information Theoretic Approach to Interaction-Grounded Learningcited by 2
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.
- 2025SynthesizeMe! Inducing Persona-Guided Prompts for Personalized Reward Models in LLMscited by 29
- 2026P-GenRM: Personalized Generative Reward Model with Test-time User-based Scalingcited by 4
- 2026Interaction-Grounded Learning for Contextual Markov Decision Processes with Personalized Feedbackcited by 0
- 2026P-GenRM: Personalized Generative Reward Model with Test-time User-based Scaling12 Feb 2026
- 2026Interaction-Grounded Learning for Contextual Markov Decision Processes with Personalized Feedback9 Feb 2026
- 2025SynthesizeMe! Inducing Persona-Guided Prompts for Personalized Reward Models in LLMs5 Jun 2025