Guided Adversarial Robust Transfer Learning with Source Mixing
Not on the map. Why?
Abstract (arXiv)
Transfer learning is a critical technique that enables the application of knowledge gained from existing tasks or domains to improve performance on a new one, reducing the need for extensive data and training in each new context. Many existing transfer learning methods rely on leveraging information from source populations closely resembling the target population. However, this approach often overlooks valuable knowledge that may be present in different yet potentially related auxiliary samples. When dealing with a limited amount of target data and multiple source data, we introduce a novel approach, Guided Adversarial Robust Transfer (GART) learning, that breaks free from strict similarity constraints. GART is designed to optimize the most adversarial loss with respect to a collection of source mixture distributions that guarantee excellent prediction performances for the target data. We establish the closed form of the population GART and show that the GART estimator achieves a faster convergence rate than the model fitted with the target data. Our simulation studies suggest that GART outperforms existing transfer learning methods, attaining higher robustness and accuracy. We highlight GART's predictiveness and robustness by applying it to form genetic prediction models of high-density lipoprotein cholesterol using multi-institutional biobank-linked electronic health records data.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 15 of its 33 references that are in the map. First posted on arXiv 12 Sep 2023.
Builds on
15 of 33 references.
References · 15
- 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 291
- 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 185
- 2016Variance-based regularization with convex objectivescited by 155
- 2015Distributionally Robust Logistic Regressioncited by 126
- 2021Distributionally Robust Federated Averagingcited by 104
- 2020Transfer Learning for High-dimensional Linear Regression: Prediction, Estimation, and Minimax Optimalitycited by 90
- 2017Regularization via Mass Transportationcited by 81
- 2021Transfer Learning under High-dimensional Generalized Linear Modelscited by 70
- 2020Transfer Learning in Large-scale Gaussian Graphical Models with False Discovery Rate Controlcited by 38
- 2018Predicting with Proxies: Transfer Learning in High Dimensioncited by 24
- 2020Statistical Inference for Maximin Effects: Identifying Stable Associations across Multiple Studiescited by 14
- 2021Multitask Learning and Bandits via Robust Statisticscited by 11
3 more
- 2019Named Entity Recognition in Electronic Health Records Using Transfer Learning Bootstrapped Neural Networkscited by 10
- 2023Optimal Multitask Linear Regression and Contextual Bandits under Sparse Heterogeneitycited by 7
- 2021Transfer Learning in High-dimensional Semi-parametric Graphical Models with Application to Brain Connectivity Analysiscited by 5
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 2; 2026: 1.
4 papers.
- 2023Optimal Multi-Distribution Learningcited by 13
- 2026Adversarial Drift-Aware Predictive Transfer: Toward Durable Clinical AIcited by 1
- 2025Latent Factor Point Processes for Patient Representation in Electronic Health Recordscited by 0
- 2025Representation-Aware Distributionally Robust Optimization: A Knowledge Transfer Frameworkcited by 0
- 2026Adversarial Drift-Aware Predictive Transfer: Toward Durable Clinical AI17 Jan 2026
- 2025Representation-Aware Distributionally Robust Optimization: A Knowledge Transfer Framework11 Sep 2025
- 2025Latent Factor Point Processes for Patient Representation in Electronic Health Records28 Aug 2025
- 2023Optimal Multi-Distribution Learning8 Dec 2023