← Search

David R. Burt

7 accepted papers

2025

Smooth Sailing: Lipschitz-Driven Uncertainty Quantification for Spatial Associations

NeurIPS 2025poster

Estimating associations between spatial covariates and responses — rather than merely predicting responses — is central to environmental science, epidemiology, and economics. For instance, public health officials might be interested in whether air pollution has a strictly positive association with a…

Cited by 0SourceScholar
2023

Gaussian processes at the Helm(holtz): A more fluid model for ocean currents

ICML 2023poster

Oceanographers are interested in predicting ocean currents and identifying divergences in a current vector field based on sparse observations of buoy velocities. Since we expect current dynamics to be smooth but highly non-linear, Gaussian processes (GPs) offer an attractive model. But we show that…

2022

Sparse Gaussian Process Hyperparameters: Optimize or Integrate?

NeurIPS 2022accept

The kernel function and its hyperparameters are the central model selection choice in a Gaussian process (Rasmussen and Williams, 2006). Typically, the hyperparameters of the kernel are chosen by maximising the marginal likelihood, an approach known as Type-II maximum likelihood (ML-II). However, ML…

Cited by 9SourcePDFScholar
2022

Wide Mean-Field Bayesian Neural Networks Ignore the Data

AISTATS 2022poster

Bayesian neural networks (BNNs) combine the expressive power of deep learning with the advantages of Bayesian formalism. In recent years, the analysis of wide, deep BNNs has provided theoretical insight into their priors and posteriors. However, we have no analogous insight into their posteriors und…

2021

How Tight Can PAC-Bayes be in the Small Data Regime?

NeurIPS 2021poster

In this paper, we investigate the question: _Given a small number of datapoints, for example $N = 30$, how tight can PAC-Bayes and test set bounds be made?_ For such small datasets, test set bounds adversely affect generalisation performance by withholding data from the training procedure. In this s…

2021

Tighter Bounds on the Log Marginal Likelihood of Gaussian Process Regression Using Conjugate Gradients

ICML 2021oral

We propose a lower bound on the log marginal likelihood of Gaussian process regression models that can be computed without matrix factorisation of the full kernel matrix. We show that approximate maximum likelihood learning of model parameters by maximising our lower bound retains many benefits of t…