The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Fast Direct Methods for Gaussian Processes
Open accessAbstract
A number of problems in probability and statistics can be addressed using the multivariate normal (Gaussian) distribution. In the one-dimensional case, computing the probability for a given mean and variance simply requires the evaluation of the corresponding Gaussian density. In the n-dimensional setting, however, it requires the inversion of an n ×n covariance matrix, C, as well as the evaluation of its determinant, det(C). In many cases, such as regression using Gaussian processes, the covariance matrix is of the form C = σ(2) I + K, where K is computed using a specified covariance kernel which depends on the data and additional parameters (hyperparameters). The matrix C is typically dense, causing standard direct methods for inversion and determinant evaluation to require O(n(3)) work. This cost is prohibitive for large-scale modeling. Here, we show that for the most commonly used covariance functions, the matrix C can be hierarchically factored into a product of block low-rank updates of the identity matrix, yielding an O (n log(2) n) algorithm for inversion. More importantly, we show that this factorization enables the evaluation of the determinant det(C), permitting the direct calculation of probabilities in high dimensions under fairly broad assumptions on the kernel defining K. Our fast algorithm brings many problems in marginalization and the adaptation of hyperparameters within practical reach using a single CPU core. The combination of nearly optimal scaling in terms of problem size with high-performance computing resources will permit the modeling of previously intractable problems. We illustrate the performance of the scheme on standard covariance kernels.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
A Treatise on the Theory of Bessel Functions.
Porter, M. B., & Watson, G. N. (1923) · The American Mathematical Monthly · doi:10.2307/2300274 · Cited by 9,380
A fast algorithm for particle simulations
Greengard, L., & Rokhlin, V (1987) · Journal of Computational Physics · doi:10.1016/0021-9991(87)90140-9 · Cited by 4,868
Self-citationThe Analysis of Time Series: An Introduction
Dickey, D. A., & Chatfield, C. (1991) · Technometrics · doi:10.2307/1268794 · Cited by 3,525
The Analysis of Time Series: An Introduction with R
Chatfield, C., & Xing, H. (2019) · Chapman & Hall/CRC eBooks · doi:10.1201/9781351259446 · Cited by 1,803
A Unifying View of Sparse Approximate Gaussian Process Regression
Quiñonero-Candela, J., & Rasmussen, C. E. (2005) · doi:10.5555/1046920.1194909 · Cited by 1,671
Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
Sherman, J., & Morrison, W. J. (1950) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729893 · Cited by 1,402
Inference in Hidden Markov Models
Cappé, O., Moulines, E., & Rydén, T. (2005) · Springer Series in Statistics · doi:10.1007/0-387-28982-8 · Cited by 1,398
A Sparse Matrix Arithmetic Based on $\Cal H$ -Matrices. Part I: Introduction to ${\Cal H}$ -Matrices
Hackbusch, W. (1999) · Computing · doi:10.1007/s006070050015 · Cited by 1,179
Cited by
Fast and Scalable Gaussian Process Modeling with Applications to Astronomical Time Series
Foreman-Mackey, D., Agol, E., Ambikasaran, S., & Angus, R. (2017) · The Astronomical Journal · doi:10.3847/1538-3881/aa9332 · Cited by 1,000
Self-citationWhen Gaussian Process Meets Big Data: A Review of Scalable GPs
Liu, H., Ong, Y.-S., Shen, X., & Cai, J. (2020) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2019.2957109 · Cited by 878
Agazie, G., Anumarlapudi, A., Archibald, A. M., Baker, P. T., Bécsy, B., Blecha, L., Bonilla, A., Brazier, A., Brook, P. R., Burke-Spolaor, S., et al. (2023) · The Astrophysical Journal Letters · doi:10.3847/2041-8213/ace18b · Cited by 385
A seven-planet resonant chain in TRAPPIST-1
Luger, R., Sestovic, M., Kruse, E., Grimm, S. L., Demory, B.-O., Agol, E., Bolmont, E., Fabrycky, D., Fernandes, C. S., Van Grootel, V., et al. (2017) · Nature Astronomy · doi:10.1038/s41550-017-0129 · Cited by 365
Self-citationjuliet: a versatile modelling tool for transiting and non-transiting exoplanetary systems
Espinoza, N., Kossakowski, D., & Brahm, R. (2019) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stz2688 · Cited by 348
Metadata
- Authors
- Ambikasaran, S., Foreman-Mackey, D., Greengard, L., Hogg, D. W., & O'Neil, M.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2016-02-01
- Volume
- 38
- Issue
- 2
- Pages
- 252-265
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W96525208
- Cited by
- 669
- References
- 46
- FWCI
- 28.15
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fast Direct Methods for Gaussian Processes. https://app.cochat.ai/papers/10.1109/tpami.2015.2448083
- The paper
- Ambikasaran, S., Foreman-Mackey, D., Greengard, L., Hogg, D. W., & O'Neil, M. (2016). Fast Direct Methods for Gaussian Processes. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2015.2448083
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.