Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Computational Statistics & Data Analysis
Computational Methods for Inverse Problems
Computational Methods for Inverse Problems
Analysis and design of recurrent neural networks and their applications to control and robotic systems
A recurrent neural network for solving Sylvester equation with time-varying coefficients
IEEE Transactions on Neural Networks
Hi-index | 7.29 |
Maximum likelihood estimation (MLE) of hyperparameters in Gaussian process regression as well as other computational models usually and frequently requires the evaluation of the logarithm of the determinant of a positive-definite matrix (denoted by C hereafter). In general, the exact computation of logdetC is of O(N^3) operations where N is the matrix dimension. The approximation of logdetC could be developed with O(N^2) operations based on power-series expansion and randomized trace estimator. In this paper, the accuracy and effectiveness of using uniformly distributed seeds for logdetC approximation are investigated. The research shows that uniform-seed based approximation is an equally good alternative to Gaussian-seed based approximation, having slightly better approximation accuracy and smaller variance. Gaussian process regression examples also substantiate the effectiveness of such a uniform-seed based log-det approximation scheme.