Decentralized Federated Dataset Dictionary Learning for Multi-Source Domain Adaptation

• URL: http://arxiv.org/abs/2503.17683v1
• Date: Sat, 22 Mar 2025 07:48:48 GMT
• Title: Decentralized Federated Dataset Dictionary Learning for Multi-Source Domain Adaptation
• Abstract summary: Decentralized Multi-Source Domain Adaptation (DMSDA) is a challenging task.<n>Our work tackles DMSDA through a fully decentralized federated approach.
• Score: 5.042313273982193
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Decentralized Multi-Source Domain Adaptation (DMSDA) is a challenging task that aims to transfer knowledge from multiple related and heterogeneous source domains to an unlabeled target domain within a decentralized framework. Our work tackles DMSDA through a fully decentralized federated approach. In particular, we extend the Federated Dataset Dictionary Learning (FedDaDiL) framework by eliminating the necessity for a central server. FedDaDiL leverages Wasserstein barycenters to model the distributional shift across multiple clients, enabling effective adaptation while preserving data privacy. By decentralizing this framework, we enhance its robustness, scalability, and privacy, removing the risk of a single point of failure. We compare our method to its federated counterpart and other benchmark algorithms, showing that our approach effectively adapts source domains to an unlabeled target domain in a fully decentralized manner.

Related papers

• DeFed-GMM-DaDiL: A Decentralized Federated Framework for Domain Adaptation [7.916373508978821]
  DeFed-GMM-DaDiL is an extension of the GMM-Dataset Dictionary Learning (DaDiL) framework.<n>Each client models its dataset as a Gaussian Mixture Model (GMM)<n>We empirically study the stability of the learned representations in scenarios where the target domain has missing classes.
  arXiv  Detail & Related papers  (2026-05-05T22:00:35Z)
• Distributionally Robust Classification for Multi-source Unsupervised Domain Adaptation [7.009073774602386]
  Unsupervised domain adaptation (UDA) is a statistical learning problem when the distribution of training (source) data is different from that of test (target) data.<n>We develop an efficient learning algorithm that can be seamlessly integrated with existing UDA methods.
  arXiv  Detail & Related papers  (2026-01-29T06:23:14Z)
• Progressive Multi-Source Domain Adaptation for Personalized Facial Expression Recognition [51.61979855488214]
  Personalized facial expression recognition (FER) involves adapting a machine learning model using samples from labeled sources and unlabeled target domains. We propose a progressive MSDA approach that gradually introduces information from subjects based on their similarity to the target subject. Our experiments show the effectiveness of our proposed method on pain datasets: Biovid and UNBC-McMaster.
  arXiv  Detail & Related papers  (2025-04-05T19:14:51Z)
• Tackling Dimensional Collapse toward Comprehensive Universal Domain Adaptation [11.875619863954238]
  Universal Domain Adaptation (UniDA) addresses unsupervised domain adaptation where target classes may differ arbitrarily from source ones, except for a shared subset.<n>An important approach, partial domain matching (PDM), aligns only shared classes but struggles in extreme cases where many source classes are absent in the target domain, underperforming the most naive baseline that trains on only source data.<n>We propose to jointly leverage the alignment and uniformity techniques in modern self-supervised learning (SSL) on the unlabeled target data to preserve the intrinsic structure of the learned representations.
  arXiv  Detail & Related papers  (2024-10-15T04:51:37Z)
• Dataset Dictionary Learning in a Wasserstein Space for Federated Domain Adaptation [5.024690447177142]
  Multi-Source Domain Adaptation (MSDA) is a challenging scenario where multiple related and heterogeneous source datasets must be adapted to an unlabeled target dataset. Our work proposes a novel approach, Decentralized dataset Dictionary Learning, to address this challenge. Our algorithm expresses each client's underlying distribution as a Wasserstein barycenter of public atoms, weighted by private barycentric coordinates.
  arXiv  Detail & Related papers  (2024-07-16T12:13:54Z)
• RAIN: RegulArization on Input and Network for Black-Box Domain Adaptation [80.03883315743715]
  Source-free domain adaptation transits the source-trained model towards target domain without exposing the source data. This paradigm is still at risk of data leakage due to adversarial attacks on the source model. We propose a novel approach named RAIN (RegulArization on Input and Network) for Black-Box domain adaptation from both input-level and network-level regularization.
  arXiv  Detail & Related papers  (2022-08-22T18:18:47Z)
• Unsupervised Domain Adaptation for Segmentation with Black-box Source Model [37.02365343894657]
  We propose a practical solution to UDA for segmentation with a black-box segmentation model trained in the source domain only. Specifically, we resort to a knowledge distillation scheme with exponential mixup decay (EMD) to gradually learn target-specific representations. We evaluate our framework on the BraTS 2018 database, achieving performance on par with white-box source model adaptation approaches.
  arXiv  Detail & Related papers  (2022-08-16T14:29:15Z)
• Source-Free Domain Adaptation via Distribution Estimation [106.48277721860036]
  Domain Adaptation aims to transfer the knowledge learned from a labeled source domain to an unlabeled target domain whose data distributions are different. Recently, Source-Free Domain Adaptation (SFDA) has drawn much attention, which tries to tackle domain adaptation problem without using source data. In this work, we propose a novel framework called SFDA-DE to address SFDA task via source Distribution Estimation.
  arXiv  Detail & Related papers  (2022-04-24T12:22:19Z)
• Secure Domain Adaptation with Multiple Sources [13.693640425403636]
  Multi-source unsupervised domain adaptation (MUDA) is a recently explored learning framework. The goal is to address the challenge of labeled data scarcity in a target domain via transferring knowledge from multiple source domains with annotated data. Since the source data is distributed, the privacy of source domains' data can be a natural concern. We benefit from the idea of domain alignment in an embedding space to address the privacy concern for MUDA.
  arXiv  Detail & Related papers  (2021-06-23T02:26:36Z)
• Instance Level Affinity-Based Transfer for Unsupervised Domain Adaptation [74.71931918541748]
  We propose an instance affinity based criterion for source to target transfer during adaptation, called ILA-DA. We first propose a reliable and efficient method to extract similar and dissimilar samples across source and target, and utilize a multi-sample contrastive loss to drive the domain alignment process. We verify the effectiveness of ILA-DA by observing consistent improvements in accuracy over popular domain adaptation approaches on a variety of benchmark datasets.
  arXiv  Detail & Related papers  (2021-04-03T01:33:14Z)
• Discriminative Cross-Domain Feature Learning for Partial Domain Adaptation [70.45936509510528]
  Partial domain adaptation aims to adapt knowledge from a larger and more diverse source domain to a smaller target domain with less number of classes. Recent practice on domain adaptation manages to extract effective features by incorporating the pseudo labels for the target domain. It is essential to align target data with only a small set of source data.
  arXiv  Detail & Related papers  (2020-08-26T03:18:53Z)
• Mutual Learning Network for Multi-Source Domain Adaptation [73.25974539191553]
  We propose a novel multi-source domain adaptation method, Mutual Learning Network for Multiple Source Domain Adaptation (ML-MSDA) Under the framework of mutual learning, the proposed method pairs the target domain with each single source domain to train a conditional adversarial domain adaptation network as a branch network. The proposed method outperforms the comparison methods and achieves the state-of-the-art performance.
  arXiv  Detail & Related papers  (2020-03-29T04:31:43Z)

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.