Detecting When One Probe Vector is Enough for Preconditioned Log‐Determinant Approximation

We present randomized algorithms for estimating the log‐determinant of regularized symmetric positive semi‐definite matrices. The algorithms access the matrix only through matrix vector products, and are based on the introduction of a preconditioner and stochastic trace estimator. We claim that preconditioning as much as we can and making a rough estimate of the residual part with a small budget achieves a small error in most of the cases. We choose a Nyström preconditioner and estimate the residual using only one sample of stochastic Lanczos quadrature (SLQ). We analyze the performance of this strategy from a theoretical and practical viewpoint. We also present an algorithm that, at almost no additional cost, detects whether more samples for the SLQ part are needed to make the proposed strategy more effective. Numerical examples on several test matrices show that our proposed methods are competitive with existing algorithms.