← Search

Liam Hodgkinson

21 accepted papers

2026

Is the Last Layer Sufficient for Uncertainty Quantification?

ICML 2026poster

Epistemic uncertainty quantification (UQ) for deep neural networks (DNNs) is a requirement for safe adoption of AI in mission-critical settings. Several leading methods for UQ linearize DNNs to form Bayesian Generalized Linear Models (GLMs), where epistemic uncertainty is modeled via the predictive …

Cited by 0SourceScholar
2025

Determinant Estimation under Memory Constraints and Neural Scaling Laws

ICML 2025poster

Calculating or accurately estimating log-determinants of large positive semi-definite matrices is of fundamental importance in many machine learning tasks. While its cubic computational complexity can already be prohibitive, in modern applications even storing the matrices themselves can pose a memo…

2025

Spectral Estimation with Free Decompression

NeurIPS 2025spotlight

Computing eigenvalues of very large matrices is a critical task in many machine learning applications, including the evaluation of log-determinants, the trace of matrix functions, and other important metrics. As datasets continue to grow in scale, the corresponding covariance and kernel matrices bec…

Cited by 0SourcecodeScholar
2025

Uncertainty Quantification with the Empirical Neural Tangent Kernel

NeurIPS 2025poster

While neural networks have demonstrated impressive performance across various tasks, accurately quantifying uncertainty in their predictions is essential to ensure their trustworthiness and enable widespread adoption in critical systems. Several Bayesian uncertainty quantification (UQ) methods exist…

Cited by 0SourceScholar
2023

Monotonicity and Double Descent in Uncertainty Estimation with Gaussian Processes

ICML 2023poster

Despite their importance for assessing reliability of predictions, uncertainty quantification (UQ) measures in machine learning models have only recently begun to be rigorously characterized. One prominent issue is the *curse of dimensionality*: it is commonly believed that the marginal likelihood s…

Cited by 7SourcePDFScholar
2023

When are ensembles really effective?

NeurIPS 2023poster

Ensembling has a long history in statistical data analysis, with many impactful applications. However, in many modern machine learning settings, the benefits of ensembling are less ubiquitous and less obvious. We study, both theoretically and empirically, the fundamental question of when ensemblin…

Cited by 21SourcePDFScholar
2022

Fat–Tailed Variational Inference with Anisotropic Tail Adaptive Flows

ICML 2022spotlight

While fat-tailed densities commonly arise as posterior and marginal distributions in robust models and scale mixtures, they present a problematic scenario when Gaussian-based variational inference fails to accurately capture tail decay. We first improve previous theory on tails of Lipschitz flows by…

Cited by 15SourcePDFScholar
2022

Generalization Bounds using Lower Tail Exponents in Stochastic Optimizers

ICML 2022spotlight

Despite the ubiquitous use of stochastic optimization algorithms in machine learning, the precise impact of these algorithms and their dynamics on generalization performance in realistic non-convex settings is still poorly understood. While recent work has revealed connections between generalization…

Cited by 24SourcePDFScholar
2021

Geometric rates of convergence for kernel-based sampling algorithms

UAI 2021poster

The rate of convergence of weighted kernel herding (WKH) and sequential Bayesian quadrature (SBQ), two kernel-based sampling algorithms for estimating integrals with respect to some target probability measure, is investigated. Under verifiable conditions on the chosen kernel and target measure, we e…

Cited by 0SourcePDFScholar
2021

Lipschitz Recurrent Neural Networks

ICLR 2021poster

Viewing recurrent neural networks (RNNs) as continuous-time dynamical systems, we propose a recurrent unit that describes the hidden state's evolution with two parts: a well-understood linear component plus a Lipschitz nonlinearity. This particular functional form facilitates stability analysis of t…

2021

Noisy Recurrent Neural Networks

NeurIPS 2021poster

We provide a general framework for studying recurrent neural networks (RNNs) trained by injecting noise into hidden states. Specifically, we consider RNNs that can be viewed as discretizations of stochastic differential equations driven by input data. This framework allows us to study the implicit r…

2021

Shadow Manifold Hamiltonian Monte Carlo

AISTATS 2021poster

Hamiltonian Monte Carlo and its descendants have found success in machine learning and computational statistics due to their ability to draw samples in high dimensions with greater efficiency than classical MCMC. One of these derivatives, Riemannian manifold Hamiltonian Monte Carlo (RMHMC), better a…

2021

Stateful ODE-Nets using Basis Function Expansions

NeurIPS 2021poster

The recently-introduced class of ordinary differential equation networks (ODE-Nets) establishes a fruitful connection between deep learning and dynamical systems. In this work, we reconsider formulations of the weights as continuous-in-depth functions using linear combinations of basis functions whi…

2021

Stochastic continuous normalizing flows: training SDEs as ODEs

UAI 2021poster

We provide a general theoretical framework for stochastic continuous normalizing flows, an extension of continuous normalizing flows for density estimation of stochastic differential equations (SDEs). Using the theory of rough paths, the underlying Brownian motion is treated as a latent variable and…

Cited by 13SourcePDFScholar
2021

Taxonomizing local versus global structure in neural network loss landscapes

NeurIPS 2021poster

Viewing neural network models in terms of their loss landscapes has a long history in the statistical mechanics approach to learning, and in recent years it has received attention within machine learning proper. Among other things, local metrics (such as the smoothness of the loss landscape) have be…