Transfer Learning in Latent Contextual Bandits with Covariate Shift Through Causal Transportability
Not on the map. Why?
Abstract (arXiv)
Transferring knowledge from one environment to another is an essential ability of intelligent systems. Nevertheless, when two environments are different, naively transferring all knowledge may deteriorate the performance, a phenomenon known as negative transfer. In this paper, we address this issue within the framework of multi-armed bandits from the perspective of causal inference. Specifically, we consider transfer learning in latent contextual bandits, where the actual context is hidden, but a potentially high-dimensional proxy is observable. We further consider a covariate shift in the context across environments. We show that naively transferring all knowledge for classical bandit algorithms in this setting led to negative transfer. We then leverage transportability theory from causal inference to develop algorithms that explicitly transfer effective knowledge for estimating the causal effects of interest in the target environment. Besides, we utilize variational autoencoders to approximate causal effects under the presence of a high-dimensional proxy. We test our algorithms on synthetic and semi-synthetic datasets, empirically demonstrating consistently improved learning efficiency across different proxies compared to baseline algorithms, showing the effectiveness of our causal framework in transferring knowledge.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 20 of its 45 references that are in the map. First posted on arXiv 27 Feb 2025.
Builds on
20 of 45 references.
References · 20
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2016Variational Inference: A Review for Statisticianscited by 1,466
- 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 929
- 2017Causal Effect Inference with Deep Latent-Variable Modelscited by 408
- 2017Toward Controlled Generation of Textcited by 271
- 2018Characterizing and Avoiding Negative Transfercited by 226
- 2019A Meta-Transfer Objective for Learning to Disentangle Causal Mechanismscited by 158
- 2021Generating Diverse Structure for Image Inpainting With Hierarchical VQ-VAEcited by 106
- 2016Causal Bandits: Learning Good Interventions via Causal Inferencecited by 100
- 2021Perception and Sensing for Autonomous Vehicles Under Adverse Weather Conditions: A Surveycited by 81
- 2022Identifiability of deep generative models without auxiliary informationcited by 70
- 2017Multi-Task Learning for Contextual Banditscited by 47
8 more
- 2020Latent Bandits Revisitedcited by 43
- 2021Causal Bandits with Unknown Graph Structurecited by 37
- 2021A Critical Look at the Consistency of Causal Estimation With Deep Latent Variable Modelscited by 29
- 2016Contextual Bandits with Latent Confounders: An NMF Approachcited by 26
- 2022Transfer Learning for Contextual Multi-armed Banditscited by 24
- 2016Latent Contextual Bandits and their Application to Personalized Recommendations for New Userscited by 18
- 2022Adaptively Exploiting d-Separators with Causal Banditscited by 18
- 2024Causal Bandits with General Causal Models and Interventionscited by 7
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025Transfer Faster, Price Smarter: Minimax Dynamic Pricing under Cross-Market Preference Shiftcited by 2
- 2025On Transportability for Structural Causal Banditscited by 1
- 2025Asymptotically Optimal Problem-Dependent Bandit Policies for Transfer Learningcited by 0
- 2026Jump Start or False Start? A Theoretical and Empirical Evaluation of LLM-initialized Banditscited by 0
- 2026Jump Start or False Start? A Theoretical and Empirical Evaluation of LLM-initialized Bandits2 Apr 2026
- 2025On Transportability for Structural Causal Bandits22 Nov 2025
- 2025Asymptotically Optimal Problem-Dependent Bandit Policies for Transfer Learning23 Sep 2025
- 2025Transfer Faster, Price Smarter: Minimax Dynamic Pricing under Cross-Market Preference Shift22 May 2025