Journal
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
Volume 38, Issue 4, Pages 1075-1099Publisher
SIAM PUBLICATIONS
DOI: 10.1137/16M1104974
Keywords
trace estimation; Lanczos algorithm; log-determinants; fast approximate algorithms; Schatten norms; Gaussian processes
Categories
Funding
- NSF [NSF/CCF-1318597]
- XDATA program of the Defense Advanced Research Projects Agency (DARPA) [FA8750-12-C-0323]
Ask authors/readers for more resources
The problem of estimating the trace of matrix functions appears in applications ranging from machine learning and scientific computing, to computational biology. This paper presents an inexpensive method to estimate the trace of f (A) for cases where f is analytic inside a closed interval and A is a symmetric positive definite matrix. The method combines three key ingredients, namely, the stochastic trace estimator, Gaussian quadrature, and the Lanczos algorithm. As examples, we consider the problems of estimating the log-determinant (f(t) = log(t)), the Schatten p-norms (f(t) = t(p/2)), the Estrada index (f(t) = e(t)), and the trace of the matrix inverse (f(t) = t(-1)). We establish multiplicative and additive error bounds for the approximations obtained by this method. In addition, we present error bounds for other useful tools such as approximating the log-likelihood function in the context of maximum likelihood estimation of Gaussian processes. Numerical experiments illustrate the performance of the proposed method on different problems arising from various applications.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available