Dataset Dictionary Learning in a Wasserstein Space for Federated Domain Adaptation

• URL: http://arxiv.org/abs/2407.11647v1
• Date: Tue, 16 Jul 2024 12:13:54 GMT
• Title: Dataset Dictionary Learning in a Wasserstein Space for Federated Domain Adaptation
• Abstract summary: 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.
• Score: 5.024690447177142
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Multi-Source Domain Adaptation (MSDA) is a challenging scenario where multiple related and heterogeneous source datasets must be adapted to an unlabeled target dataset. Conventional MSDA methods often overlook that data holders may have privacy concerns, hindering direct data sharing. In response, decentralized MSDA has emerged as a promising strategy to achieve adaptation without centralizing clients' data. Our work proposes a novel approach, Decentralized Dataset Dictionary Learning, to address this challenge. Our method leverages Wasserstein barycenters to model the distributional shift across multiple clients, enabling effective adaptation while preserving data privacy. Specifically, our algorithm expresses each client's underlying distribution as a Wasserstein barycenter of public atoms, weighted by private barycentric coordinates. Our approach ensures that the barycentric coordinates remain undisclosed throughout the adaptation process. Extensive experimentation across five visual domain adaptation benchmarks demonstrates the superiority of our strategy over existing decentralized MSDA techniques. Moreover, our method exhibits enhanced robustness to client parallelism while maintaining relative resilience compared to conventional decentralized MSDA methodologies.

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)
• Unlocking the Value of Decentralized Data: A Federated Dual Learning Approach for Model Aggregation [20.023295646723312]
  Federated Learning (FL) offers a promising alternative by enabling AI models to be trained on decentralized data. Existing FL approaches struggle to match the performance of centralized training due to challenges such as heterogeneous data distribution and communication delays. We propose a dual learning approach that leverages centralized data at the server to guide the merging of model updates from clients.
  arXiv  Detail & Related papers  (2025-03-26T01:00:35Z)
• Decentralized Federated Dataset Dictionary Learning for Multi-Source Domain Adaptation [5.042313273982193]
  Decentralized Multi-Source Domain Adaptation (DMSDA) is a challenging task. Our work tackles DMSDA through a fully decentralized federated approach.
  arXiv  Detail & Related papers  (2025-03-22T07:48:48Z)
• What Has Been Overlooked in Contrastive Source-Free Domain Adaptation: Leveraging Source-Informed Latent Augmentation within Neighborhood Context [28.634315143647385]
  Source-free domain adaptation (SFDA) involves adapting a model originally trained using a labeled dataset to perform effectively on an unlabeled dataset. This adaptation is especially crucial when significant disparities in data distributions exist between the two domains. We introduce a straightforward yet highly effective latent augmentation method tailored for contrastive SFDA.
  arXiv  Detail & Related papers  (2024-12-18T20:09:46Z)
• Privacy Preserving Federated Unsupervised Domain Adaptation with Application to Age Prediction from DNA Methylation Data [2.699900017799093]
  We introduce a privacy-preserving framework for unsupervised domain adaptation in high-dimensional settings. Our framework is the first privacy-preserving solution for high-dimensional domain adaptation in federated environments.
  arXiv  Detail & Related papers  (2024-11-26T10:19:16Z)
• Personalized Federated Learning for Cross-view Geo-localization [49.40531019551957]
  We propose a methodology combining Federated Learning (FL) with Cross-view Image Geo-localization (CVGL) techniques. Our method implements a coarse-to-fine approach, where clients share only the coarse feature extractors while keeping fine-grained features specific to local environments. Results demonstrate that our federated CVGL method achieves performance close to centralized training while maintaining data privacy.
  arXiv  Detail & Related papers  (2024-11-07T13:25:52Z)
• Subject-Based Domain Adaptation for Facial Expression Recognition [51.10374151948157]
  Adapting a deep learning model to a specific target individual is a challenging facial expression recognition task. This paper introduces a new MSDA method for subject-based domain adaptation in FER. It efficiently leverages information from multiple source subjects to adapt a deep FER model to a single target individual.
  arXiv  Detail & Related papers  (2023-12-09T18:40:37Z)
• Memory Consistent Unsupervised Off-the-Shelf Model Adaptation for Source-Relaxed Medical Image Segmentation [13.260109561599904]
  Unsupervised domain adaptation (UDA) has been a vital protocol for migrating information learned from a labeled source domain to an unlabeled heterogeneous target domain. We propose "off-the-shelf (OS)" UDA (OSUDA), aimed at image segmentation, by adapting an OS segmentor trained in a source domain to a target domain, in the absence of source domain data in adaptation.
  arXiv  Detail & Related papers  (2022-09-16T13:13:50Z)
• Mitigating Data Heterogeneity in Federated Learning with Data Augmentation [26.226057709504733]
  Federated Learning (FL) is a framework that enables training a centralized model while securing user privacy by fusing local, decentralized models. One major obstacle is data heterogeneity, i.e., each client having non-identically and independently distributed (non-IID) data. Recent evidence suggests that data augmentation can induce equal or greater performance.
  arXiv  Detail & Related papers  (2022-06-20T19:47:43Z)
• 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)
• Federated Multi-Target Domain Adaptation [99.93375364579484]
  Federated learning methods enable us to train machine learning models on distributed user data while preserving its privacy. We consider a more practical scenario where the distributed client data is unlabeled, and a centralized labeled dataset is available on the server. We propose an effective DualAdapt method to address the new challenges.
  arXiv  Detail & Related papers  (2021-08-17T17:53:05Z)
• Adapting Off-the-Shelf Source Segmenter for Target Medical Image Segmentation [12.703234995718372]
  Unsupervised domain adaptation (UDA) aims to transfer knowledge learned from a labeled source domain to an unlabeled and unseen target domain. Access to the source domain data at the adaptation stage is often limited, due to data storage or privacy issues. We propose to adapt an off-the-shelf" segmentation model pre-trained in the source domain to the target domain.
  arXiv  Detail & Related papers  (2021-06-23T16:16:55Z)
• 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)
• Quasi-Global Momentum: Accelerating Decentralized Deep Learning on Heterogeneous Data [77.88594632644347]
  Decentralized training of deep learning models is a key element for enabling data privacy and on-device learning over networks. In realistic learning scenarios, the presence of heterogeneity across different clients' local datasets poses an optimization challenge. We propose a novel momentum-based method to mitigate this decentralized training difficulty.
  arXiv  Detail & Related papers  (2021-02-09T11:27:14Z)

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.