Enhancing Spectral Embedding through Robust and Flexible Knowledge Transfer in Electronic Health Records
Not on the map. Why?
Abstract (arXiv)
We propose a spectral-based, unsupervised representation learning framework to derive low-dimensional embeddings for clinical concepts and patients in rare disease cohorts from electronic health records, where data are high-dimensional but sample sizes are limited. To overcome this challenge, we incorporate a knowledge matrix extracted from a broader population that shares a partially overlapping subspace with the rare-disease cohort. Our method departs from existing approaches by relaxing restrictive one-to-one signal-alignment assumptions between the latent data matrix and knowledge matrix, allowing more flexible and realistic forms of structured sharing. We introduce a novel two-step spectral embedding procedure: first, we identify and remove irrelevant components from the knowledge matrix; then, we apply a projection-based method to separately recover shared and heterogeneous components. Simulations and an analysis of a real-world multiple sclerosis cohort show that the proposed method outperforms competing approaches, particularly in challenging scenarios where shared signals are weak and only partially aligned, as is common in rare-disease data.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 44 references that are in the map. First posted on arXiv 10 Jun 2026.
Builds on
23 of 44 references.
References · 23
- 2023GPT-4 Technical Reportcited by 18,132
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,841
- 2017Latent Space Oddity: on the Curvature of Deep Generative Modelscited by 169
- 2020A Survey on Negative Transfercited by 120
- 2021Graph Representation Learning in Biomedicinecited by 79
- 2016Rate-Optimal Perturbation Bounds for Singular Subspaces with Applications to High-Dimensional Statisticscited by 45
- 2020Deep Representation Learning of Electronic Health Records to Unlock Patient Stratification at Scalecited by 39
- 2017Angle-Based Joint and Individual Variation Explainedcited by 29
- 2014Selecting the number of principal components: estimation of the true rank of a noisy matrixcited by 18
- 2022Robust angle-based transfer learning in high dimensionscited by 16
- 2020Estimation of the number of spiked eigenvalues in a covariance matrix by bulk eigenvalue matching analysiscited by 15
11 more
- 2020ScreeNOT: Exact MSE-Optimal Singular Value Thresholding in Correlated Noisecited by 15
- 2018Robust high dimensional factor models with applications to statistical machine learningcited by 13
- 2024Optimal Estimation of Shared Singular Subspaces across Multiple Noisy Matricescited by 6
- 2023Inference of Dependency Knowledge Graph for Electronic Health Recordscited by 5
- 2024Kernel spectral joint embeddings for high-dimensional noisy datasets using duo-landmark integral operatorscited by 5
- 2025Unveiling Discrete Clues: Superior Healthcare Predictions for Rare Diseasescited by 5
- 2024Knowledge Transfer across Multiple Principal Component Analysis Studiescited by 4
- 2024Deep Transfer Learning: Model Framework and Error Analysiscited by 4
- 2024Entropic Optimal Transport Eigenmaps for Nonlinear Alignment and Joint Embedding of High-Dimensional Datasetscited by 3
- 2021Approximate Factor Models with Weaker Loadingscited by 2
- 2024When can weak latent factors be statistically inferred?cited by 2
Built on by
Not cited yet.