mlsanityData to 14 Oct 2026

Kernel spectral joint embeddings for high-dimensional noisy datasets using duo-landmark integral operators

arXiv 2405.12317 ↗First posted 20 May 2024stat.ML cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Integrative analysis of multiple heterogeneous datasets has become standard practice in many research fields, especially in single-cell genomics and medical informatics. Existing approaches oftentimes suffer from limited power in capturing nonlinear structures, insufficient account of noisiness and effects of high-dimensionality, lack of adaptivity to signals and sample sizes imbalance, and their results are sometimes difficult to interpret. To address these limitations, we propose a novel kernel spectral method that achieves joint embeddings of two independently observed high-dimensional noisy datasets. The proposed method automatically captures and leverages possibly shared low-dimensional structures across datasets to enhance embedding quality. The obtained low-dimensional embeddings can be utilized for many downstream tasks such as simultaneous clustering, data visualization, and denoising. The proposed method is justified by rigorous theoretical analysis. Specifically, we show the consistency of our method in recovering the low-dimensional noiseless signals, and characterize the effects of the signal-to-noise ratios on the rates of convergence. Under a joint manifolds model framework, we establish the convergence of ultimate embeddings to the eigenfunctions of some newly introduced integral operators. These operators, referred to as duo-landmark integral operators, are defined by the convolutional kernel maps of some reproducing kernel Hilbert spaces (RKHSs). These RKHSs capture the either partially or entirely shared underlying low-dimensional nonlinear signal structures of the two datasets. Our numerical experiments and analyses of two single-cell omics datasets demonstrate the empirical advantages of the proposed method over existing methods in both embeddings and several downstream tasks.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 13 of its 79 references that are in the map. First posted on arXiv 20 May 2024.

Builds on

13 of 79 references.

References · 13

  1. 2022DataPerf: Benchmarks for Data-Centric AI Developmentcited by 90
  2. 2015Nonparametric Canonical Correlation Analysiscited by 22
  3. 2016Latent common manifold learning with alternating diffusion: analysis and applicationscited by 16
  4. 2020Impact of signal-to-noise ratio and bandwidth on graph Laplacian spectrum from high-dimensional noisy point cloudcited by 14
  5. 2015Optimal Learning Rates for Localized SVMscited by 13
  6. 2022Learning Low-Dimensional Nonlinear Structures from High-Dimensional Noisy Data: An Integral Operator Approachcited by 8
  7. 2022A Spectral Method for Assessing and Combining Multiple Data Visualizationscited by 6
  8. 2023Is your data alignable? Principled and interpretable alignability testing and integration of single-cell datacited by 6
  9. 2021How do kernel-based sensor fusion algorithms behave under high dimensional noise?cited by 5
  10. 2018Optimal Estimation of Simultaneous Signals Using Absolute Inner Product with Applications to Integrative Genomicscited by 2
  11. 2024Landmark Alternating Diffusioncited by 2
  12. 2022Using Interpretable Machine Learning to Massively Increase the Number of Antibody-Virus Interactions Across Studiescited by 1
1 more
  1. 2024Design a Metric Robust to Complicated High Dimensional Noise for Efficient Manifold Denoisingcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 3; 2026: 1.

5 papers.