How do kernel-based sensor fusion algorithms behave under high-dimensional noise?
Authors:
- 1 January 2024
- journal article
- research article
- Published by Oxford University Press (OUP) in Information and Inference: A Journal of the IMA
- Vol. 13 (1)
Abstract
We study the behavior of two kernel based sensor fusion algorithms, nonparametric canonical correlation analysis (NCCA) and alternating diffusion (AD), under the nonnull setting that the clean datasets collected from two sensors are modeled by a common low-dimensional manifold embedded in a high-dimensional Euclidean space and the datasets are corrupted by high-dimensional noise. We establish the asymptotic limits and convergence rates for the eigenvalues of the associated kernel matrices assuming that the sample dimension and sample size are comparably large, where NCCA and AD are conducted using the Gaussian kernel. It turns out that both the asymptotic limits and convergence rates depend on the signal-to-noise ratio (SNR) of each sensor and selected bandwidths. On one hand, we show that if NCCA and AD are directly applied to the noisy point clouds without any sanity check, it may generate artificial information that misleads scientists’ interpretation. On the other hand, we prove that if the bandwidths are selected adequately, both NCCA and AD can be made robust to high-dimensional noise when the SNRs are relatively large.Keywords
All Related Versions
This publication has 46 references indexed in Scilit:
- On information plus noise kernel random matricesThe Annals of Statistics, 2010
- The spectrum of kernel random matricesThe Annals of Statistics, 2010
- Towards a theoretical foundation for Laplacian-based manifold methodsJournal of Computer and System Sciences, 2008
- The Brain–Heart ConnectionCirculation, 2007
- From graph to manifold Laplacian: The convergence rateApplied and Computational Harmonic Analysis, 2006
- Canonical Correlation Analysis: An Overview with Application to Learning MethodsNeural Computation, 2004
- On the distribution of the largest eigenvalue in principal components analysisThe Annals of Statistics, 2001
- DISTRIBUTION OF EIGENVALUES FOR SOME SETS OF RANDOM MATRICESMathematics of the USSR-Sbornik, 1967
- Relations among m Sets of MeasuresPsychometrika, 1961
- RELATIONS BETWEEN TWO SETS OF VARIATESBiometrika, 1936