Transfer Learning with Distance Covariance for Random Forest: Error Bounds and an EHR Application
Not on the map. Why?
Abstract (arXiv)
We propose a method for transfer learning in nonparametric regression using a random forest (RF) with distance covariance-based feature weights, assuming the unknown source and target regression functions are sparsely different. Our method obtains residuals from a source domain-trained Centered RF (CRF) in the target domain, then fits another CRF to these residuals with feature splitting probabilities proportional to feature-residual sample distance covariance. We derive an upper bound on the mean square error rate of the procedure as a function of sample sizes and difference dimension, theoretically demonstrating transfer learning benefits in random forests. A major difficulty for transfer learning in random forests is the lack of explicit regularization in the method. Our results explain why shallower trees with preferential selection of features lead to both lower bias and lower variance for fitting a low-dimensional function. We show that in the residual random forest, this implicit regularization is enabled by sample distance covariance. In simulations, we show that the results obtained for the CRFs also hold numerically for the standard RF (SRF) method with data-driven feature split selection. Beyond transfer learning, our results also show the benefit of distance-covariance-based weights on the performance of RF when some features dominate. Our method shows significant gains in predicting the mortality of ICU patients in smaller-bed target hospitals using a large multi-hospital dataset of electronic health records for 200,000 ICU patients.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 43 references that are in the map. First posted on arXiv 13 Oct 2025.
Builds on
19 of 43 references.
References · 19
- 2019A Comprehensive Survey on Transfer Learningcited by 1,160
- 2015Estimation and Inference of Heterogeneous Treatment Effects using Random Forestscited by 600
- 2023When Do Neural Nets Outperform Boosted Trees on Tabular Data?cited by 223
- 2020On the Theory of Transfer Learning: The Importance of Task Diversitycited by 186
- 2015A Random Forest Guided Tourcited by 168
- 2021Self-Attention Between Datapoints: Going Beyond Individual Input-Output Pairs in Deep Learningcited by 113
- 2020Transfer Learning for High-dimensional Linear Regression: Prediction, Estimation, and Minimax Optimalitycited by 90
- 2014Consistency of random forestscited by 85
- 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
- 2019Benchmarking machine learning models on multi-centre eICU critical care datasetcited by 35
- 2021Large Scale Prediction with Decision Treescited by 28
7 more
- 2024Transfer Learning for Nonparametric Regression: Non-asymptotic Minimax Analysis and Adaptive Procedurecited by 22
- 2014Fast Computing for Distance Covariancecited by 14
- 2024TransFusion: Covariate-Shift Robust Transfer Learning for High-Dimensional Regressioncited by 11
- 2015Learn on Source, Refine on Target:A Model Transfer Learning Framework with Random Forestscited by 6
- 2024Heterogeneous transfer learning for high-dimensional regression with feature mismatchcited by 5
- 2020Nonparametric Variable Screening with Optimal Decision Stumpscited by 4
- 2023Transfer Learning for Kernel-based Regressioncited by 3
Built on by
Not cited yet.