Improved bounds on sample size for implicit matrix trace estimators
Farbod Roosta-Khorasani, Uri Ascher

TL;DR
This paper improves theoretical bounds on the number of samples needed for Monte Carlo trace estimators of implicit matrices, considering various distributions and matrix properties, with experiments validating the bounds.
Contribution
It provides new, tighter bounds on sample size for trace estimation methods, extending and refining previous theoretical results for different random vector distributions.
Findings
Improved bound on sample size for Hutchinson method, removing rank dependence.
New bounds for Gaussian and unit vector estimators based on matrix properties.
Necessary bounds for Gaussian estimator highlighting conditions for effectiveness.
Abstract
This article is concerned with Monte-Carlo methods for the estimation of the trace of an implicitly given matrix whose information is only available through matrix-vector products. Such a method approximates the trace by an average of expressions of the form , with random vectors drawn from an appropriate distribution. We prove, discuss and experiment with bounds on the number of realizations required in order to guarantee a probabilistic bound on the relative error of the trace estimation upon employing Rademacher (Hutchinson), Gaussian and uniform unit vector (with and without replacement) probability distributions. In total, one necessary bound and six sufficient bounds are proved, improving upon and extending similar estimates obtained in the seminal work of Avron and Toledo (2011) in several dimensions. We first improve their bound on for the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
