REVIEW 2 cited by
Federated Adversarial Domain Adaptation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Federated Adversarial Domain Adaptation
read the original abstract
Federated learning improves data privacy and efficiency in machine learning performed over networks of distributed devices, such as mobile phones, IoT and wearable devices, etc. Yet models trained with federated learning can still fail to generalize to new devices due to the problem of domain shift. Domain shift occurs when the labeled data collected by source nodes statistically differs from the target node's unlabeled data. In this work, we present a principled approach to the problem of federated domain adaptation, which aims to align the representations learned among the different nodes with the data distribution of the target node. Our approach extends adversarial adaptation techniques to the constraints of the federated setting. In addition, we devise a dynamic attention mechanism and leverage feature disentanglement to enhance knowledge transfer. Empirically, we perform extensive experiments on several image and text classification tasks and show promising results under unsupervised federated domain adaptation setting.
Forward citations
Cited by 2 Pith papers
-
Robust Federated Learning Under Real-World Client Churn
FeLiX reduces wall-clock time-to-target accuracy in federated learning by up to 2.37x using lightweight availability tiers, fresh-utility client selection, and informativeness-aware aggregation without requiring oracu...
-
Enhanced localized conformal prediction with imperfect auxiliary information
ELCP integrates auxiliary data with a density-ratio-weighted kernel to enhance localized conformal prediction sets, maintaining marginal coverage and improving asymptotic local coverage.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.