Fast Covariance Estimation for High-dimensional Functional Data
Luo Xiao, David Ruppert, Vadim Zipunnikov, and Ciprian Crainiceanu

TL;DR
This paper introduces two scalable algorithms, FACE and SVDS, for fast covariance estimation in high-dimensional functional data, enabling practical analysis of large covariance matrices in medical imaging and sensor data.
Contribution
The paper presents two novel algorithms, FACE and SVDS, that significantly improve the speed and memory efficiency of covariance smoothing for very large matrices.
Findings
FACE is an order of magnitude faster than existing methods.
Both algorithms handle matrices up to 100,000 dimensions.
FACE enhances functional regression speed in R.
Abstract
For smoothing covariance functions, we propose two fast algorithms that scale linearly with the number of observations per function. Most available methods and software cannot smooth covariance matrices of dimension with ; the recently introduced sandwich smoother is an exception, but it is not adapted to smooth covariance matrices of large dimensions such as . Covariance matrices of order , and even , are becoming increasingly common, e.g., in 2- and 3-dimensional medical imaging and high-density wearable sensor data. We introduce two new algorithms that can handle very large covariance matrices: 1) FACE: a fast implementation of the sandwich smoother and 2) SVDS: a two-step procedure that first applies singular value decomposition to the data matrix and then smoothes the eigenvectors. Compared to existing techniques, these new…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
