Monte Carlo estimators for the Schatten p-norm of symmetric positive semidefinite matrices
From MaRDI portal
Publication:2672173
Abstract: We present numerical methods for computing the Schatten -norm of positive semi-definite matrices. Our motivation stems from uncertainty quantification and optimal experimental design for inverse problems, where the Schatten -norm defines a design criterion known as the P-optimal criterion. Computing the Schatten -norm of high-dimensional matrices is computationally expensive. We propose a matrix-free method to estimate the Schatten -norm using a Monte Carlo estimator and derive convergence results and error estimates for the estimator. To efficiently compute the Schatten -norm for non-integer and large values of , we use an estimator using a Chebyshev polynomial approximation and extend our convergence and error analysis to this setting as well. We demonstrate the performance of our proposed estimators on several test matrices and through an application to optimal experimental design of a model inverse problem.
Recommendations
- Randomized matrix-free trace and log-determinant estimators
- Fast estimation of \(\mathrm{tr}(f(A))\) via stochastic Lanczos quadrature
- Small-Sample Statistical Estimates for Matrix Norms
- Randomized block Krylov subspace methods for trace and log-determinant estimators
- Randomized Low-Rank Approximation of Monotone Matrix Functions
Cites work
- A computational framework for infinite-dimensional Bayesian inverse problems. I: The linearized case, with application to global seismic inversion
- A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines
- Approximating spectral sums of large-scale matrices using stochastic Chebyshev approximations
- Approximation of monomials by lower degree polynomials
- Chebyshev and Fourier spectral methods.
- Efficient D-optimal design of experiments for infinite-dimensional Bayesian linear inverse problems
- Fast algorithms for Bayesian uncertainty quantification in large-scale linear inverse problems based on low-rank partial Hessian approximations
- Fast estimation of \(\mathrm{tr}(f(A))\) via stochastic Lanczos quadrature
- Functions of Matrices
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- Improved bounds on sample size for implicit matrix trace estimators
- Inequalities for variances of some functions of random variables
- Inverse Problem Theory and Methods for Model Parameter Estimation
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- Numerical mathematics.
- Numerical methods for large eigenvalue problems
- On approximating matrix norms in data streams
- On sketching matrix norms and the top singular vector
- Probability essentials.
- Randomization and reweighted _1-minimization for A-optimal design of linear inverse problems
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
- Rational approximation of 𝐱ⁿ
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
- Spectrum estimation from samples
Cited in
(9)- Direction-Preserving and Schur-Monotonic Semiseparable Approximations of Symmetric Positive Definite Matrices
- Probabilistic analysis of an estimator for the Frobenius norm of a matrix product
- Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix
- Randomized Low-Rank Approximation of Monotone Matrix Functions
- On the variance of Schatten p-norm estimation with Gaussian sketching matrices
- Improved bounds for randomized Schatten norm estimation of numerically low-rank matrices
- Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints
- Computing adjoint mismatch of linear maps
- Matrix-free stochastic calculation of operator norms without using adjoints
This page was built for publication: Monte Carlo estimators for the Schatten \(p\)-norm of symmetric positive semidefinite matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2672173)
