Data sparse multilevel covariance estimation in optimal complexity
J\"urgen D\"olz

TL;DR
This paper introduces a data sparse multilevel covariance estimator using $ ext{H}^2$-approximation for efficient covariance estimation in high-dimensional problems, achieving optimal complexity and handling large datasets.
Contribution
It generalizes asymptotically smooth kernels to Gevrey classes, develops variable-order $ ext{H}^2$-approximations, and designs a linear complexity multilevel estimator for large covariance matrices.
Findings
Achieves quadratic complexity for multilevel covariance estimation.
Handles covariance matrices with tens of billions of entries.
Demonstrates efficiency through numerical examples.
Abstract
We consider the -formatted compression and computational estimation of covariance functions on a compact set in . The classical sample covariance or Monte Carlo estimator is prohibitively expensive for many practically relevant problems, where often approximation spaces with many degrees of freedom and many samples for the estimator are needed. In this article, we propose and analyze a data sparse multilevel sample covariance estimator, i.e., a multilevel Monte Carlo estimator. For this purpose, we generalize the notion of asymptotically smooth kernel functions to a Gevrey type class of kernels for which we derive new variable-order -approximation rates. These variable-order -approximations can be considered as a variant of -approximations. Our multilevel sample covariance estimator then uses an approximate multilevel…
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.
Taxonomy
TopicsMathematical Approximation and Integration · Statistical Methods and Inference · Markov Chains and Monte Carlo Methods
