no code implementations • 16 Nov 2022 • Simon Hubbert, Emilio Porcu, Chris. J. Oates, Mark Girolami
This work provides theoretical foundations for kernel methods in the hyperspherical context.
1 code implementation • 16 Jun 2022 • Takuo Matsubara, Jeremias Knoblauch, François-Xavier Briol, Chris. J. Oates
Discrete state spaces represent a major computational challenge to statistical inference, since the computation of normalisation constants requires summation over large or possibly infinite sets, which can be impractical.
1 code implementation • NeurIPS 2021 • Onur Teymur, Christopher N. Foley, Philip G. Breen, Toni Karvonen, Chris. J. Oates
One approach is to model the unknown quantity of interest as a random variable, and to constrain this variable using data generated during the course of a traditional numerical method.
no code implementations • 22 Apr 2021 • Junyang Wang, Jon Cockayne, Oksana Chkrebtii, T. J. Sullivan, Chris. J. Oates
The numerical solution of differential equations can be formulated as an inference problem to which formal statistical approaches can be applied.
1 code implementation • 15 Apr 2021 • Takuo Matsubara, Jeremias Knoblauch, François-Xavier Briol, Chris. J. Oates
Generalised Bayesian inference updates prior beliefs using a loss function, rather than a likelihood, and can therefore be used to confer robustness against possible mis-specification of the likelihood.
no code implementations • 14 Oct 2020 • Onur Teymur, Jackson Gorham, Marina Riabiz, Chris. J. Oates
Several researchers have proposed minimisation of maximum mean discrepancy (MMD) as a method to quantise probability measures, i. e., to approximate a target distribution by a representative point set.
no code implementations • 12 Jun 2020 • Shijing Si, Chris. J. Oates, Andrew B. Duncan, Lawrence Carin, François-Xavier Briol
Control variates are a well-established tool to reduce the variance of Monte Carlo estimators.
3 code implementations • pproximateinference AABI Symposium 2021 • Marina Riabiz, Wilson Chen, Jon Cockayne, Pawel Swietach, Steven A. Niederer, Lester Mackey, Chris. J. Oates
The use of heuristics to assess the convergence and compress the output of Markov chain Monte Carlo can be sub-optimal in terms of the empirical approximations that are produced.
1 code implementation • 31 Jan 2020 • Leah F. South, Toni Karvonen, Chris Nemeth, Mark Girolami, Chris. J. Oates
The numerical approximation of posterior expected quantities of interest is considered.
Computation Methodology
no code implementations • 29 Jan 2020 • Toni Karvonen, George Wynne, Filip Tronarp, Chris. J. Oates, Simo Särkkä
We show that the maximum likelihood estimation of the scale parameter alone provides significant adaptation against misspecification of the Gaussian process model in the sense that the model can become "slowly" overconfident at worst, regardless of the difference between the smoothness of the data-generating function and that expected by the model.
1 code implementation • 9 May 2019 • Wilson Ye Chen, Alessandro Barp, François-Xavier Briol, Jackson Gorham, Mark Girolami, Lester Mackey, Chris. J. Oates
Stein Points are a class of algorithms for this task, which proceed by sequentially minimising a Stein discrepancy between the empirical measure and the target and, hence, require the solution of a non-convex optimisation problem to obtain each new point.
no code implementations • 28 Nov 2018 • Jakub Prüher, Toni Karvonen, Chris. J. Oates, Ondřej Straka, Simo Särkkä
The sigma-point filters, such as the UKF, which exploit numerical quadrature to obtain an additional order of accuracy in the moment transformation step, are popular alternatives to the ubiquitous EKF.
no code implementations • 26 Nov 2018 • Francois-Xavier Briol, Chris. J. Oates, Mark Girolami, Michael A. Osborne, Dino Sejdinovic
This article is the rejoinder for the paper "Probabilistic Integration: A Role in Statistical Computation?"
1 code implementation • 26 Sep 2018 • Toni Karvonen, Simo Särkkä, Chris. J. Oates
Bayesian cubature provides a flexible framework for numerical integration, in which a priori knowledge on the integrand can be encoded and exploited.
Methodology Numerical Analysis Computation
1 code implementation • ICML 2018 • Wilson Ye Chen, Lester Mackey, Jackson Gorham, François-Xavier Briol, Chris. J. Oates
An important task in computational statistics and machine learning is to approximate a posterior distribution $p(x)$ with an empirical measure supported on a set of representative points $\{x_i\}_{i=1}^n$.
1 code implementation • 19 Jul 2017 • Chris. J. Oates, Jon Cockayne, Robert G. Aykroyd, Mark Girolami
The use of high-power industrial equipment, such as large-scale mixing equipment or a hydrocyclone for separation of particles in liquid suspension, demands careful monitoring to ensure correct operation.
Applications
no code implementations • ICML 2017 • Francois-Xavier Briol, Chris. J. Oates, Jon Cockayne, Wilson Ye Chen, Mark Girolami
The standard Kernel Quadrature method for numerical integration with random point sets (also called Bayesian Monte Carlo) is known to converge in root mean square error at a rate determined by the ratio $s/d$, where $s$ and $d$ encode the smoothness and dimension of the integrand.
1 code implementation • 16 Dec 2016 • Steven M. Hill, Chris. J. Oates, Duncan A. Blythe, Sach Mukherjee
This paper frames causal structure estimation as a machine learning task.
no code implementations • 3 Dec 2015 • François-Xavier Briol, Chris. J. Oates, Mark Girolami, Michael A. Osborne, Dino Sejdinovic
A research frontier has emerged in scientific computation, wherein numerical error is regarded as a source of epistemic uncertainty that can be modelled.
no code implementations • NeurIPS 2015 • François-Xavier Briol, Chris. J. Oates, Mark Girolami, Michael A. Osborne
There is renewed interest in formulating integration as an inference problem, motivated by obtaining a full distribution over numerical error that can be propagated through subsequent computation.
no code implementations • 4 Apr 2014 • Chris. J. Oates, Jim Q. Smith, Sach Mukherjee, James Cussens
This paper considers the problem of estimating the structure of multiple related directed acyclic graph (DAG) models.