Transfer Learning in Latent Contextual Bandits with Covariate Shift Through Causal Transportability

• URL: http://arxiv.org/abs/2502.20153v1
• Date: Thu, 27 Feb 2025 14:52:23 GMT
• Title: Transfer Learning in Latent Contextual Bandits with Covariate Shift Through Causal Transportability
• Authors: Mingwei Deng, Ville Kyrki, Dominik Baumann,
• Abstract summary: Transferring knowledge from one environment to another is an essential ability of intelligent systems.<n>In this paper, we consider transfer learning in latent contextual bandits, where the actual context is hidden.<n>We show that naively transferring all knowledge for classical bandit algorithms in this setting led to negative transfer.
• Score: 8.593124849405498
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Evaluating the structure of cognitive tasks with transfer learning [67.22168759751541]
  This study investigates the transferability of deep learning representations between different EEG decoding tasks. We conduct extensive experiments using state-of-the-art decoding models on two recently released EEG datasets.
  arXiv  Detail & Related papers  (2023-07-28T14:51:09Z)
• Common Knowledge Learning for Generating Transferable Adversarial Examples [60.1287733223249]
  This paper focuses on an important type of black-box attacks, where the adversary generates adversarial examples by a substitute (source) model. Existing methods tend to give unsatisfactory adversarial transferability when the source and target models are from different types of DNN architectures. We propose a common knowledge learning (CKL) framework to learn better network weights to generate adversarial examples.
  arXiv  Detail & Related papers  (2023-07-01T09:07:12Z)
• Transfer RL via the Undo Maps Formalism [29.798971172941627]
  Transferring knowledge across domains is one of the most fundamental problems in machine learning. We propose TvD: transfer via distribution matching, a framework to transfer knowledge across interactive domains. We show this objective leads to a policy update scheme reminiscent of imitation learning, and derive an efficient algorithm to implement it.
  arXiv  Detail & Related papers  (2022-11-26T03:44:28Z)
• Transfer Learning on Heterogeneous Feature Spaces for Treatment Effects Estimation [103.55894890759376]
  This paper introduces several building blocks that use representation learning to handle the heterogeneous feature spaces. We show how these building blocks can be used to recover transfer learning equivalents of the standard CATE learners.
  arXiv  Detail & Related papers  (2022-10-08T16:41:02Z)
• A Data-Based Perspective on Transfer Learning [76.30206800557411]
  We take a closer look at the role of the source dataset's composition in transfer learning. Our framework gives rise to new capabilities such as pinpointing transfer learning brittleness.
  arXiv  Detail & Related papers  (2022-07-12T17:58:28Z)
• Why Do Self-Supervised Models Transfer? Investigating the Impact of Invariance on Downstream Tasks [79.13089902898848]
  Self-supervised learning is a powerful paradigm for representation learning on unlabelled images. We show that different tasks in computer vision require features to encode different (in)variances.
  arXiv  Detail & Related papers  (2021-11-22T18:16:35Z)
• Towards Accurate Knowledge Transfer via Target-awareness Representation Disentanglement [56.40587594647692]
  We propose a novel transfer learning algorithm, introducing the idea of Target-awareness REpresentation Disentanglement (TRED) TRED disentangles the relevant knowledge with respect to the target task from the original source model and used as a regularizer during fine-tuning the target model. Experiments on various real world datasets show that our method stably improves the standard fine-tuning by more than 2% in average.
  arXiv  Detail & Related papers  (2020-10-16T17:45:08Z)
• An Imitation from Observation Approach to Transfer Learning with Dynamics Mismatch [44.898655782896306]
  We show that one existing solution to this transfer problem - grounded action transformation - is closely related to the problem of imitation from observation. We derive a new algorithm - generative adversarial reinforced action transformation (GARAT) - based on adversarial imitation from observation techniques. We find that agents trained with GARAT achieve higher returns in the target environment compared to existing black-box transfer methods.
  arXiv  Detail & Related papers  (2020-08-04T14:36:02Z)
• Uncovering the Connections Between Adversarial Transferability and Knowledge Transferability [27.65302656389911]
  We analyze and demonstrate the connections between knowledge transferability and adversarial transferability. Our theoretical studies show that adversarial transferability indicates knowledge transferability and vice versa. We conduct extensive experiments for different scenarios on diverse datasets, showing a positive correlation between adversarial transferability and knowledge transferability.
  arXiv  Detail & Related papers  (2020-06-25T16:04:47Z)
• Transfer Reinforcement Learning under Unobserved Contextual Information [16.895704973433382]
  We study a transfer reinforcement learning problem where the state transitions and rewards are affected by the environmental context. We develop a method to obtain causal bounds on the transition and reward functions using the demonstrator's data. We propose new Q learning and UCB-Q learning algorithms that converge to the true value function without bias.
  arXiv  Detail & Related papers  (2020-03-09T22:00:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.