• Corpus ID: 246285474

Stochastic diagonal estimation: probabilistic bounds and an improved algorithm

  title={Stochastic diagonal estimation: probabilistic bounds and an improved algorithm},
  author={Robert A. Baston and Yuji Nakatsukasa},
We study the problem of estimating the diagonal of an implicitly given matrix A. For such a matrix we have access to an oracle that allows us to evaluate the matrix vector product Av. For random variable v drawn from an appropriate distribution, this may be used to return an estimate of the diagonal of the matrix A. Whilst results exist for probabilistic guarantees relating to the error of estimates of the trace of A, no such results have yet been derived for the diagonal. We make two… 
Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix
The novel use of matrix concentration inequalities in the authors' proofs represents a systematic model for future analyses and implies that the accuracy of the estimators increases with the diagonal dominance of the matrix.
Efficient algorithms for Bayesian Inverse Problems with Whittle-Matérn Priors
An efficient method for handling all admissible noninteger values of the exponent is derived and it is shown how to incorporate this prior representation into the infinite-dimensional Bayesian formulation, and how to compute the maximum a posteriori estimate, and approximate the posterior variance.
Approximate Euclidean lengths and distances beyond Johnson-Lindenstrauss
An algorithm to estimate the Euclidean lengths of the rows of a matrix and proves element-wise probabilistic bounds that are at least as good as standard JL approximations in the worst-case, but are asymptotically better for matrices with decaying spectrum.
Krylov-aware stochastic trace estimation
An algorithm for estimating the trace of a matrix function f ( A ) using implicit products with a symmetric matrix A , based on a combination of deflation and stochastic trace estimation is introduced.


Hutch++: Optimal Stochastic Trace Estimation
A new randomized algorithm, Hutch++, is introduced, which computes a (1 ± ε) approximation to tr( A ) for any positive semidefinite (PSD) A using just O(1/ε) matrix-vector products, which improves on the ubiquitous Hutchinson's estimator.
An estimator for the diagonal of a matrix
Improved Bounds on Sample Size for Implicit Matrix Trace Estimators
New sufficient bounds are proved for the Hutchinson, Gaussian and unit vector estimators, as well as a necessary bound for the Gaussian estimator, which depend more specifically on properties of matrix “A” whose information is only available through matrix-vector products.
On Randomized Trace Estimates for Indefinite Matrices with an Application to Determinants
New tail bounds for randomized trace estimates applied to indefinite B with Rademacher or Gaussian random vectors are derived, which significantly improve existing results for indefinite B, reducing the number of required samples by a factor n or even more.
A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines
An unbiased stochastic estimator of tr(I-A), where A is the influence matrix associated with the calculation of Laplacian smoothing splines, is described. The estimator is similar to one recently
Deflation as a Method of Variance Reduction for Estimating the Trace of a Matrix Inverse
The remarkable observation that deflation may increase variance for Hermitian matrices but not for non-Hermitian ones is made.
Approximating Spectral Densities of Large Matrices
The problem of estimating the spectral density carefully is defined and how to measure the accuracy of an approximate spectral density is discussed, which is generally costly and wasteful, especially for matrices of large dimension.
Applications of Trace Estimation Techniques
Two computationally inexpensive methods to compute traces of matrix functions, namely, the Chebyshev expansion and the Lanczos Quadrature methods are reviewed.
Estimating the Spectral Density of Large Implicit Matrices
This work combines several different techniques for randomized estimation and shows that it is possible to construct unbiased estimators to answer a broad class of questions about the spectra of such implicit matrices, even in the presence of noise.