Dynamic Graph Convolutional Networks Using the Tensor M-Product
Osman Asif Malik, Shashanka Ubaru, et al.
SDM 2021
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) = tp/2), the Estrada index (f(t) = et), 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 di erent problems arising from various applications.
Osman Asif Malik, Shashanka Ubaru, et al.
SDM 2021
Ruslan Shaydulin, Jie Chen, et al.
Multiscale Modeling and Simulation
Tian Gao, Jie Chen, et al.
AAAI 2019
Huy Phan, Yi Xie, et al.
AAAI 2020