Transfer Learning for Evolving Domains

• URL: http://arxiv.org/abs/2609.13039v1
• Date: Fri, 11 Sep 2026 16:37:37 GMT
• Title: Transfer Learning for Evolving Domains
• Abstract summary: We formalise Transfer Learning for Evolving Domains (TrED) as a transfer learning problem in its own right.<n>TrED is specified by a data availability process fixed by the environment, a learning protocol that the method is free to choose, and an evaluation criterion.<n>We find that most methods are tailored to a single regime and that even the strongest existing candidates do not yet optimise the whole trajectory.
• Score: 10.286288574811591
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Transfer learning explores how to leverage knowledge from various tasks or domains (sources) to enhance predictive performance in related tasks or domains (targets). Typically, transfer learning research is segmented into several isolated sub-areas (such as domain generalisation, domain adaptation, or multi-domain learning), each making distinct assumptions about target data availability, namely how much data and how many labels are available at training time. However, in many real-world applications, data availability is not fixed but evolves over time, as instances and labels are progressively collected from a new domain. Each of the classical settings then describes only a snapshot of a trajectory that a deployed system must traverse in full. We formalise this trajectory as a transfer learning problem in its own right, Transfer Learning for Evolving Domains (TrED), specified by a data availability process fixed by the environment, a learning protocol that the method is free to choose, and an evaluation criterion that scores the whole trajectory of models rather than a single one. Within this formalism, the classical settings are recovered as regimes that a learner may pass through, rather than as separate problems that TrED concatenates. We then examine the transfer learning literature to identify mechanisms that are promising building blocks for a solution, and find that most methods are tailored to a single regime and that even the strongest existing candidates do not yet optimise the whole trajectory. We argue that TrED is a well-posed and unsolved problem, and an important direction for future research.

Related papers

• Domain-Division based Progressive Learning for Source-Free Domain Adaptation [73.44692421206774]
  Source-free domain adaptation requires only a source pre-trained model and an unlabeled target domain.<n>We propose a domain-division based progressive learning method named DPL.<n>Our approach consists of two alternating stages, each beginning with the division of the target domain into easy-to-adapt and hard-to-adapt.
  arXiv  Detail & Related papers  (2026-07-31T09:21:56Z)
• Transfer Learning through Enhanced Sufficient Representation: Enriching Source Domain Knowledge with Target Data [2.308168896770315]
  We introduce a novel method for transfer learning called Transfer learning through Enhanced Sufficient Representation (TESR)<n>Our approach begins by estimating a sufficient and invariant representation from the source domains.<n>This representation is then enhanced with an independent component derived from the target data, ensuring that it is sufficient for the target domain and adaptable to its specific characteristics.
  arXiv  Detail & Related papers  (2025-02-22T13:18:28Z)
• Domain Generalizable Knowledge Tracing via Concept Aggregation and Relation-Based Attention [10.95112067894146]
  We propose a domain generalization approach for knowledge tracing, where existing education systems are considered source domains.<n>We also present a concept aggregation approach designed to reduce conceptual disparities within sequences of student interactions from diverse domains.<n>To fully leverage exercise information, we propose a new knowledge tracing model tailored for the domain generalization KT task, named Domain-General Relation-based Knowledge Tracing (DGRKT)
  arXiv  Detail & Related papers  (2024-07-02T13:13:44Z)
• A Recent Survey of Heterogeneous Transfer Learning [15.830786437956144]
  heterogeneous transfer learning has become a vital strategy in various tasks. We offer an extensive review of over 60 HTL methods, covering both data-based and model-based approaches. We explore applications in natural language processing, computer vision, multimodal learning, and biomedicine.
  arXiv  Detail & Related papers  (2023-10-12T16:19:58Z)
• CDFSL-V: Cross-Domain Few-Shot Learning for Videos [58.37446811360741]
  Few-shot video action recognition is an effective approach to recognizing new categories with only a few labeled examples. Existing methods in video action recognition rely on large labeled datasets from the same domain. We propose a novel cross-domain few-shot video action recognition method that leverages self-supervised learning and curriculum learning.
  arXiv  Detail & Related papers  (2023-09-07T19:44:27Z)
• LLEDA -- Lifelong Self-Supervised Domain Adaptation [9.71137838903781]
  Humans and animals have the ability to continuously learn new information over their lifetime without losing previously acquired knowledge. New information conflicting with old knowledge, resulting in catastrophic forgetting. The proposed Lifelong Self-Supervised Domain Adaptation (LLEDA) framework draws inspiration from the CLS theory and mimics the interaction between two networks. LLEDA's latent replay technique facilitates communication between these two networks by reactivating and replaying the past memory latent representations to stabilise long-term generalisation and retention without interfering with the previously learned information.
  arXiv  Detail & Related papers  (2022-11-12T10:12:17Z)
• Prior Knowledge Guided Unsupervised Domain Adaptation [82.9977759320565]
  We propose a Knowledge-guided Unsupervised Domain Adaptation (KUDA) setting where prior knowledge about the target class distribution is available. In particular, we consider two specific types of prior knowledge about the class distribution in the target domain: Unary Bound and Binary Relationship. We propose a rectification module that uses such prior knowledge to refine model generated pseudo labels.
  arXiv  Detail & Related papers  (2022-07-18T18:41:36Z)
• Unified Instance and Knowledge Alignment Pretraining for Aspect-based Sentiment Analysis [96.53859361560505]
  Aspect-based Sentiment Analysis (ABSA) aims to determine the sentiment polarity towards an aspect. There always exists severe domain shift between the pretraining and downstream ABSA datasets. We introduce a unified alignment pretraining framework into the vanilla pretrain-finetune pipeline.
  arXiv  Detail & Related papers  (2021-10-26T04:03:45Z)
• Flexible deep transfer learning by separate feature embeddings and manifold alignment [0.0]
  Object recognition is a key enabler across industry and defense. Unfortunately, algorithms trained on existing labeled datasets do not directly generalize to new data because the data distributions do not match. We propose a novel deep learning framework that overcomes this limitation by learning separate feature extractions for each domain.
  arXiv  Detail & Related papers  (2020-12-22T19:24:44Z)
• Multi-Domain Adversarial Feature Generalization for Person Re-Identification [52.835955258959785]
  We propose a multi-dataset feature generalization network (MMFA-AAE) It is capable of learning a universal domain-invariant feature representation from multiple labeled datasets and generalizing it to unseen' camera systems. It also surpasses many state-of-the-art supervised methods and unsupervised domain adaptation methods by a large margin.
  arXiv  Detail & Related papers  (2020-11-25T08:03:15Z)
• A Review of Single-Source Deep Unsupervised Visual Domain Adaptation [81.07994783143533]
  Large-scale labeled training datasets have enabled deep neural networks to excel across a wide range of benchmark vision tasks. In many applications, it is prohibitively expensive and time-consuming to obtain large quantities of labeled data. To cope with limited labeled training data, many have attempted to directly apply models trained on a large-scale labeled source domain to another sparsely labeled or unlabeled target domain.
  arXiv  Detail & Related papers  (2020-09-01T00:06:50Z)
• Data Techniques For Online End-to-end Speech Recognition [17.621967685914587]
  Practitioners often need to build ASR systems for new use cases in a short amount of time, given limited in-domain data. While recently developed end-to-end methods largely simplify the modeling pipelines, they still suffer from the data sparsity issue. We explore a few simple-to-implement techniques for building online ASR systems in an end-to-end fashion, with a small amount of transcribed data in the target domain.
  arXiv  Detail & Related papers  (2020-01-24T22:59:46Z)

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.