Stochastic Gradient Descent for Gaussian Processes Done Right
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913699191586816 |
|---|---|
| author | Lin, Jihao Andreas Padhy, Shreyas Antorán, Javier Tripp, Austin Terenin, Alexander Szepesvári, Csaba Hernández-Lobato, José Miguel Janz, David |
| author_facet | Lin, Jihao Andreas Padhy, Shreyas Antorán, Javier Tripp, Austin Terenin, Alexander Szepesvári, Csaba Hernández-Lobato, José Miguel Janz, David |
| contents | As is well known, both sampling from the posterior and computing the mean of the posterior in Gaussian process regression reduces to solving a large linear system of equations. We study the use of stochastic gradient descent for solving this linear system, and show that when \emph{done right} -- by which we mean using specific insights from the optimisation and kernel communities -- stochastic gradient descent is highly effective. To that end, we introduce a particularly simple \emph{stochastic dual descent} algorithm, explain its design in an intuitive manner and illustrate the design choices through a series of ablation studies. Further experiments demonstrate that our new method is highly competitive. In particular, our evaluations on the UCI regression tasks and on Bayesian optimisation set our approach apart from preconditioned conjugate gradients and variational Gaussian process approximations. Moreover, our method places Gaussian process regression on par with state-of-the-art graph neural networks for molecular binding affinity prediction. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_20581 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Stochastic Gradient Descent for Gaussian Processes Done Right Lin, Jihao Andreas Padhy, Shreyas Antorán, Javier Tripp, Austin Terenin, Alexander Szepesvári, Csaba Hernández-Lobato, José Miguel Janz, David Machine Learning As is well known, both sampling from the posterior and computing the mean of the posterior in Gaussian process regression reduces to solving a large linear system of equations. We study the use of stochastic gradient descent for solving this linear system, and show that when \emph{done right} -- by which we mean using specific insights from the optimisation and kernel communities -- stochastic gradient descent is highly effective. To that end, we introduce a particularly simple \emph{stochastic dual descent} algorithm, explain its design in an intuitive manner and illustrate the design choices through a series of ablation studies. Further experiments demonstrate that our new method is highly competitive. In particular, our evaluations on the UCI regression tasks and on Bayesian optimisation set our approach apart from preconditioned conjugate gradients and variational Gaussian process approximations. Moreover, our method places Gaussian process regression on par with state-of-the-art graph neural networks for molecular binding affinity prediction. |
| title | Stochastic Gradient Descent for Gaussian Processes Done Right |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2310.20581 |