Fast Approximate Determinants Using Rational Functions
Abstract: We show how rational function approximations to the logarithm, such as $\log z \approx (z2 - 1)/(z2 + 6z + 1)$, can be turned into fast algorithms for approximating the determinant of a very large matrix. We empirically demonstrate that when combined with a good preconditioner, the third order rational function approximation offers a very good trade-off between speed and accuracy when measured on matrices coming from Mat\'ern-$5/2$ and radial basis function Gaussian process kernels. In particular, it is significantly more accurate on those matrices than the state-of-the-art stochastic Lanczos quadrature method for approximating determinants while running at about the same speed.
- A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix. Linear Algebra and its Applications, 533:95–117, 2017.
- JAX: composable transformations of Python+NumPy programs, 2018.
- Nvidia a100 tensor core gpu: Performance and innovation. IEEE Micro, 41(2):29–35, 2021.
- Tensorflow distributions. arXiv preprint arXiv:1711.10604, 2017.
- Mark Ebden. Gaussian processes: A quick introduction. arXiv preprint arXiv:1505.02965, 2015.
- Ethan N. Epperly. Stochastic trace estimation. https://www.ethanepperly.com/index.php/2023/01/26/stochastic-trace-estimation/, 2023. Accessed 2024-04-17.
- Joan Gimeno Alquézar. On computation of matrix logarithm times a vector. Master’s thesis, Universitat Politècnica de Catalunya, 2017.
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM review, 53(2):217–288, 2011.
- Large-scale log-determinant computation through stochastic chebyshev expansions. In International Conference on Machine Learning, pages 908–917. PMLR, 2015.
- M.F. Hutchinson. A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines. Communications in Statistics - Simulation and Computation, 19(2):433–450, 1990.
- Beat Jegerlehner. Krylov space solvers for shifted linear systems. arXiv preprint hep-lat/9612014, 1996.
- RP Kelisky and TJ Rivlin. A rational approximation to the logarithm. Mathematics of Computation, 22(101):128–136, 1968.
- Andrew V Knyazev. Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method. SIAM journal on scientific computing, 23(2):517–541, 2001.
- Cornelius Lanczos. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. 1950.
- Zone determinant expansions for nuclear lattice simulations. Physical review C, 68(6):064003, 2003.
- Randomized numerical linear algebra: Foundations and algorithms. Acta Numerica, 29:403–572, 2020.
- Chebyshev approximation of log-determinants of spatial weight matrices. Computational Statistics & Data Analysis, 45(2):179–196, 2004.
- Volker Strassen. Vermeidung von divisionen. Journal für die reine und angewandte Mathematik, 264:184–202, 1973.
- Volker Strassen et al. Gaussian elimination is not optimal. Numerische mathematik, 13(4):354–356, 1969.
- Llewellyn Hilleth Thomas. Elliptic problems in linear difference equations over a network. Watson Sci. Comput. Lab. Rept., Columbia University, New York, 1:71, 1949.
- Fast estimation of tr(f(a)) via stochastic lanczos quadrature. SIAM Journal on Matrix Analysis and Applications, 38(4):1075–1099, 2017.
- Exact gaussian processes on a million data points. Advances in neural information processing systems, 32, 2019.
- Preconditioning for scalable gaussian process hyperparameter optimization. In International Conference on Machine Learning, pages 23751–23780. PMLR, 2022.
- Gaussian processes for machine learning, volume 2. MIT press Cambridge, MA, 2006.
- Orthogonal random features. Advances in neural information processing systems, 29, 2016.
- Approximate implementation of the logarithm of the matrix determinant in gaussian process regression. Journal of Statistical Computation and Simulation, 77(4):329–348, 2007.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.