DAG-GNN: DAG structure learning with graph neural networks
Yue Yu, Jie Chen, et al.
ICML 2019
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.
Yue Yu, Jie Chen, et al.
ICML 2019
Yunsheng Tian, Ane Zuniga, et al.
ICML 2024
Siyu Huo, Tengfei Ma, et al.
TextGraphs/EMNLP-IJCNLP 2019
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics