4.3 Article

FAST ESTIMATION OF tr(f(A)) VIA STOCHASTIC LANCZOS QUADRATURE

期刊

出版社

SIAM PUBLICATIONS
DOI: 10.1137/16M1104974

关键词

trace estimation; Lanczos algorithm; log-determinants; fast approximate algorithms; Schatten norms; Gaussian processes

资金

  1. NSF [NSF/CCF-1318597]
  2. XDATA program of the Defense Advanced Research Projects Agency (DARPA) [FA8750-12-C-0323]

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据