Adaptive Cholesky Gaussian Processes
Publikation: Bidrag til tidsskrift › Konferenceartikel › Forskning › fagfællebedømt
Dokumenter
- Fulltext
Forlagets udgivne version, 3,82 MB, PDF-dokument
We present a method to approximate Gaussian process regression models to large datasets by considering only a subset of the data. Our approach is novel in that the size of the subset is selected on the fly during exact inference with little computational overhead. From an empirical observation that the log-marginal likelihood often exhibits a linear trend once a sufficient subset of a dataset has been observed, we conclude that many large datasets contain redundant information that only slightly affects the posterior. Based on this, we provide probabilistic bounds on the full model evidence that can identify such subsets. Remarkably, these bounds are largely composed of terms that appear in intermediate steps of the standard Cholesky decomposition, allowing us to modify the algorithm to adaptively stop the decomposition once enough data have been observed.
Originalsprog | Engelsk |
---|---|
Tidsskrift | Proceedings of Machine Learning Research |
Vol/bind | 206 |
Sider (fra-til) | 408--452 |
Antal sider | 44 |
ISSN | 2640-3498 |
Status | Udgivet - 2023 |
Begivenhed | 26th International Conference on Artificial Intelligence and Statistics, AISTATS 2023 - Valencia, Spanien Varighed: 25 apr. 2023 → 27 apr. 2023 |
Konference
Konference | 26th International Conference on Artificial Intelligence and Statistics, AISTATS 2023 |
---|---|
Land | Spanien |
By | Valencia |
Periode | 25/04/2023 → 27/04/2023 |
Links
- https://proceedings.mlr.press/v206/bartels23a.html
Forlagets udgivne version
Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk
Ingen data tilgængelig
ID: 344671585