LEARNER: A Transfer Learning Method for Low-Rank Matrix Estimation
Not on the map. Why?
Abstract (arXiv)
Low-rank matrix estimation is a fundamental problem in statistics and machine learning with applications across biomedical sciences, including genetics, medical imaging, drug discovery, and electronic health record data analysis. In the context of heterogeneous data generated from diverse sources, a key challenge lies in leveraging data from a source population to enhance the estimation of a low-rank matrix in a target population of interest. We propose an approach that leverages similarity in the latent row and column spaces between the source and target populations to improve estimation in the target population, which we refer to as LatEnt spAce-based tRaNsfer lEaRning (LEARNER). LEARNER is based on performing a low-rank approximation of the target population data which penalizes differences between the latent row and column spaces between the source and target populations. We present a cross-validation approach that allows the method to adapt to the degree of heterogeneity across populations. We conducted extensive simulations which found that LEARNER often outperforms the benchmark approach that only uses the target population data, especially as the signal-to-noise ratio in the source population increases. We also performed an illustrative application and empirical comparison of LEARNER and benchmark approaches in a re-analysis of summary statistics from a genome-wide association study in the BioBank Japan cohort. LEARNER is implemented in the R package learner and the Python package learner-py.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 16 of its 48 references that are in the map. First posted on arXiv 29 Dec 2024.
Builds on
16 of 48 references.
References · 16
- 2017No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysiscited by 129
- 2016Matrix Completion has No Spurious Local Minimumcited by 125
- 2019Inference and Uncertainty Quantification for Noisy Matrix Completioncited by 39
- 2018Heteroskedastic PCA: Algorithm, Optimality, and Applicationscited by 34
- 2013Understanding Alternating Minimization for Matrix Completioncited by 32
- 2023Learning from Similar Linear Representations: Adaptivity, Minimaxity, and Robustnesscited by 28
- 2021Inference for Heteroskedastic PCA with Missing Datacited by 21
- 2021Targeting Underrepresented Populations in Precision Medicine: A Federated Transfer Learning Approachcited by 20
- 2022Personalized PCA: Decoupling Shared and Unique Featurescited by 17
- 2020ScreeNOT: Exact MSE-Optimal Singular Value Thresholding in Correlated Noisecited by 15
- 2016The Non-convex Geometry of Low-rank Matrix Optimizationcited by 6
- 2021Group-Sparse Matrix Factorization for Transfer Learning of Word Embeddingscited by 6
4 more
- 2023Target PCA: Transfer Learning Large Dimensional Panel Datacited by 5
- 2023Inference of Dependency Knowledge Graph for Electronic Health Recordscited by 5
- 2024Knowledge Transfer across Multiple Principal Component Analysis Studiescited by 4
- 2024Representational Transfer Learning for Matrix Completioncited by 4
Built on by
Citing papers per year: 2025: 3.
3 papers.