Backend
Kronecker Approximations of Covariance Matrices for Solving Inverse Problems
arXiv cs.NA0 views
arXiv:2611.18309v1 Announce Type: new Abstract: Inverse problems arise in many applications where the task is to recover unknown parameters from indirect or noisy observations. In contrast to forward problems, where outputs are directly computed from known inputs, inverse problems are designed to infer the underlying variables from the observed effect. Inverse problems are often ill-posed, so regularization is needed to compute reasonable solutions. One form of regularization incorporates prior knowledge about the unknown parameters in the form of prior distributions. However, in many settings, large prior covariance matrices pose computational bottlenecks for solving inverse problems. To address this, we study approximations of large covariance matrices via structured Kronecker-Toeplitz products and demonstrate how these approximations can be used to solve inverse problems. We exploit the Block-Toeplitz-Toeplitz-Block structure induced by the covariance kernel to construct compact approximations that are orders of magnitude cheaper to store and invert. These approximations are deployed as prior covariance surrogates in Bayesian inverse problems solved via generalized hybrid iterative methods. We demonstrate that the Kronecker-Toeplitz approximation attains lower relative approximation error than existing matrix approximations, exhibits rapid error decay with rank, and enables efficient matrix-vector products. Applications to 2D seismic tomography reconstruction problems illustrate the practical utility of these methods.
Source:https://arxiv.org/abs/2611.18309PreviousAn entropy-stable splitting strategy for a hyperbolic dispersive shallow-water model on unstructured meshesNextScore-based neural ordinary differential equations for reaction-diffusions
Related posts
The $\alpha$-Limit Problem: Convergence of a Linear Degenerate Interface Transmission Problem
0arXiv cs.NA
A Spectral Proximal DC Algorithm with Nonmonotone Line Search and Extrapolation
0arXiv cs.NA
Watch Your Step: Adam's Margin Maximization Bias Depends on the Learning Rate Schedule
0arXiv stat.ML
Minimizing classical resources in variational measurement-based quantum computation for generative modeling
0arXiv stat.ML
Deep Multivariate Models with Parametric Conditionals
0arXiv stat.ML
CoordX Types: A Trustless, Swappable Type System for Shared Records
0arXiv cs.CR