.png){kind=icon}
.png){kind=icon}
Return
DISTRIBUTIONALLY ROBUST LEARNING FOR MULTISOURCE UNSUPERVISED DOMAIN ADAPTATION
.png){kind=icon}
PRE
AI
W
B
G
DOI：10.1214/25-AOS2578.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Empirical risk minimization often performs poorly when the distribution of the target domain differs from those of the source domains. To address such potential distributional shifts, we develop an unsupervised domain adaptation approach that leverages labeled data from multiple source domains and unlabeled data from the target domain. We introduce a distributionally robust model that optimizes an adversarial reward based on explained variance across a class of target distributions, ensuring generalization to the target domain. We show that the proposed robust model is a weighted average of conditional outcome models from the source domains. This formulation allows us to compute the robust model through the aggregation of source models, which can be estimated using various machine learning algorithms of the user's choice such as random forests, boosting and neural networks. Additionally, we introduce a bias-correction step to obtain a more accurate aggregation weight, which is effective for various machine learning algorithms. Our framework can be interpreted as a distributionally robust federated learning approach that satisfies privacy constraints while providing insights into the importance of each source for prediction on the target domain. The performance of our method is evaluated on both simulated and real data.
Keywords:
Unsupervised domain adaptation
distributionally robust optimization
federated learning
interpretable machine learning
Journal
IF:
3.7
Papers:
2.8K
Citations:
2.9W
Organization
Cited Papers