XTrace: Making the most of every sample in stochastic trace estimation (2301.07825v2)
Abstract: The implicit trace estimation problem asks for an approximation of the trace of a square matrix, accessed via matrix-vector products (matvecs). This paper designs new randomized algorithms, XTrace and XNysTrace, for the trace estimation problem by exploiting both variance reduction and the exchangeability principle. For a fixed budget of matvecs, numerical experiments show that the new methods can achieve errors that are orders of magnitude smaller than existing algorithms, such as the Girard-Hutchinson estimator or the Hutch++ estimator. A theoretical analysis confirms the benefits by offering a precise description of the performance of these algorithms as a function of the spectrum of the input matrix. The paper also develops an exchangeable estimator, XDiag, for approximating the diagonal of a square matrix using matvecs.
- A. Girard, A fast“Monte-Carlo cross-validation” procedure for large least squares problems with noisy data, Numerische Mathematik, 56 (1989), pp. 1–23, https://doi.org/10.1007/BF01395775.
- Available at https://www.mathworks.com/matlabcentral/fileexchange/29576-matrix-exponential-times-a-vector (accessed 10/25/2022).
- Available at http://staff.fysik.su.se/~ardonne/files/theses/bachelor-thesis_christopher-litens.pdf.