atlas

Research map / Optimization / Optimizers

Improving Linear System Solvers for Hyperparameter Optimisation in Iterative Gaussian Processes

NeurIPS 2024 · Optimization › Optimizers · approach: Differentiating through embedded optimization · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Consolidates three amortisation techniques for iterative Gaussian process hyperparameter optimisation (pathwise gradient estimator, warm-started linear solvers, and early stopping under compute budgets) and shows speed-ups up to 72x across CG, AP and SGD on UCI regression.

Problem

Hyperparameter optimisation of Gaussian processes on large datasets is expensive because the marginal likelihood gradient requires many iterative linear system solves, which converge slowly when the kernel matrix is poorly conditioned.

Approach

Introduces a pathwise gradient estimator whose probe vectors absorb H^{-1} so that solver initial distance is constant (n) rather than tr(H^{-1}); warm-starts solvers from the previous marginal likelihood step; and combines these with early stopping under a fixed compute budget so solver progress accumulates across outer steps. The pathwise solutions also yield posterior samples without extra solv

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use the pathwise estimator instead of the standard estimator (ablation)CG · UCI datasets (average)speed-up: 2.1 ×Helped
add warm starting to the standard estimator (ablation)CG · UCI datasets (average)speed-up: 1.2 ×Helped
use the pathwise estimator and warm starting instead of the standard estimator without warm starting (ablation)CG · UCI datasets (average)speed-up: 1.9 ×Helped
use the pathwise estimator instead of the standard estimator (ablation)AP · UCI datasets (average)speed-up: > 18.9 ×Helped
add warm starting to the standard estimator (ablation)AP · UCI datasets (average)speed-up: > 5.4 ×Helped
use the pathwise estimator and warm starting instead of the standard estimator without warm starting (ablation)AP · UCI datasets (average)speed-up: > 72.1 ×Helped
use the pathwise estimator instead of the standard estimator (ablation)SGD · UCI datasets (average)speed-up: 5.1 ×Helped
add warm starting to the standard estimator (ablation)SGD · UCI datasets (average)speed-up: 2.1 ×Helped
use the pathwise estimator and warm starting instead of the standard estimator without warm starting (ablation)SGD · UCI datasets (average)speed-up: 7.2 ×Helped
combine early stopping with warm startingiterative GP solvers · large UCI datasetsrelative residual norm: up to 7×Helped
stop after a limited compute budget instead of solving to toleranceiterative GP solvers · large UCI datasetsrelative residual normHurt
use warm starting with early stoppingCG · Buzz and Houseelectrictest log-likelihoodHurt

Surprising findings

Limitations

Experimental setup

Datasets: UCI pol UCI elevators UCI bike UCI protein UCI keggdirected UCI buzz UCI houseelectric

Benchmarks: UCI pol UCI elevators UCI bike UCI protein UCI keggdirected UCI buzz UCI houseelectric

Metrics: test log-likelihood total training time relative residual norm solver iterations to tolerance speed-up

Baselines: standard estimator with zero initialisation Cholesky-based exact marginal likelihood CG AP SGD

Builds on: pathwise conditioning (Wilson et al.) Hutchinson trace estimator Lin et al. SGD for GPs Maddox et al. iterative GP methods

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy