A unified framework for scalable estimation of tensor covariances based on a Kronecker-structured sparse inverse Cholesky (KSIC) projection, proving that the KSIC estimator gainfully exploits cross-mode information and is robust to data scarcity.
Abstract
High-dimensional multi-way (tensor) data pose significant challenges for covariance estimation due to the curse of dimensionality. We introduce a unified framework for scalable estimation of tensor covariances based on a Kronecker-structured sparse inverse Cholesky (KSIC) projection. Our approach is grounded in the geometry of information projection, defining the estimator as the moment-matching projection of a target distribution onto a manifold characterized by sparse, Kronecker-factored inverse Cholesky factors. By leveraging physical or data-driven nearest-neighbor sparsity, KSIC provides a geometry-aware representation that is both statistically interpretable and computationally efficient. Our framework integrates two estimation regimes: a nonparametric estimator that projects the empirical covariance directly onto the manifold, utilizing the KSIC structure to implicitly regularize rank-deficient data; and a parametric estimator that fits generative covariance models (e.g., Mat\'ern) by maximizing the likelihood of their KSIC projections, formulated as a nested double forward Kullback-Leibler minimization. Theoretically, we establish the conditions for the existence of the KSIC projection and finite-sample concentration rates for the nonparametric regime, proving that the KSIC estimator gainfully exploits cross-mode information and is robust to data scarcity. Numerical experiments demonstrate that the proposed KSIC estimators achieve state-of-the-art accuracy and scalability, particularly in settings with high dimensionality and limited sample sizes. We apply KSIC to spatiotemporal temperature anomalies and functional MRI data, demonstrating its broad applicability across diverse multi-way data domains.
Simulations and an empirical application show that SMPCA is more accurate and stable than competitors under heavy-tailed distributions and outlier contamination, while retaining competitive performance under light-tailed settings.
Dong-Xu Yang, Wanfeng Liang, Le Zhou et al.· 0 citations
The resulting mirror-descent method preserves exact feasibility at every accepted step, and matched clustering experiments show competitive accuracy, feasibility residuals near numerical precision, and favorable anytime behavior without a dense learned graph.
Theoretical analysis and numerical experiments demonstrate that the model achieves exact inference with $\mathcal{O}(n \log^2 n)$ training cost and $\mathcal{O}(\log^d n)$ prediction cost, establishing a principled framework for scalable and high-fidelity Gaussian process regression.
Yan-Chuang Cao, Jun Liu, Teng-Chao Yu et al.· 0 citations
We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational...
Robin Armstrong, Anil Damle, Samuel E. Otto· 0 citations
This paper derives non-asymptotic quasi-optimality bounds governed by a regularized inverse Christoffel function associated with the gradient field and shows that additional smoothness of the gradient map yields sharper coherence estimates and motivates tractable importance sampling from kernel diagonal measures.
Fabio Nobile, Matteo Raviola, R. Tempone· 0 citations
This paper investigates the numerical resolution of the Beurling-LASSO (BLASSO), a convex optimization framework that promotes sparsity in the space of measures. We consider its application to the estimation of Gaussian mixture models (GMMs) with an unknown number of components and unknown diagonal covariance matrices....
Romane Giard, Y. de Castro, R. Denis et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.