ATAretha L. Teckentrup

Aretha L. Teckentrup

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Aretha L. Teckentrup has a total of 34 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Lengthscale-informed sparse grids for kernel methods in high dimensions

    by Elliot J. Addy, Jonas Latz, Aretha L. Teckentrup

    Kernel interpolation, especially in the context of Gaussian process emulation, is a widely used technique in surrogate modelling, where the goal is to cheaply approximate an input–output map using a limited number of function evaluations. However, in high-dimensional settings, such methods typically suffer from the curse of dimensionality ; the number of required evaluations to achieve a fixed approximation error grows exponentially with the input dimension. To overcome this, a common technique used in high-dimensional approximation methods, such as quasi-Monte Carlo and sparse grids, is to exploit functional anisotropy: the idea that some input dimensions are more ‘sensitive’ than others. In doing so, such methods can significantly reduce the dimension dependence in the error. In this work, we propose a generalisation of sparse grid methods that incorporates a form of anisotropy encoded by the lengthscale parameter in Matérn kernels. We derive error bounds and perform numerical experiments that show that our approach enables effective emulation over arbitrarily high dimensions for functions exhibiting sufficient anisotropy.

  • Convergence rates of non-stationary and deep Gaussian process regression

    by Conor Osborne, Aretha L. Teckentrup

    The focus of this work is the convergence of non-stationary and deep Gaussian process regression. More precisely, we follow a Bayesian approach to regression or interpolation, where the prior placed on the unknown function $ f $ is a non-stationary or deep Gaussian process, and we derive convergence rates of the posterior mean to the true function $ f $ in terms of the number of observed training points. In some cases, we also show convergence of the posterior variance to zero. The only assumption imposed on the function $ f $ is that it is an element of a certain reproducing kernel Hilbert space, which we in particular cases show to be norm-equivalent to a Sobolev space. Our analysis includes the case of estimated hyper-parameters in the covariance kernels employed, both in an empirical Bayes setting and the particular hierarchical setting constructed through deep Gaussian processes. We consider the settings of noise-free or noisy observations on deterministic or random training points. We establish general assumptions sufficient for the convergence of deep Gaussian process regression, along with explicit examples demonstrating the fulfilment of these assumptions. Specifically, our examples require that the Hölder or Sobolev norms of the penultimate layer are bounded almost surely.


  • Open Access

    Data Assimilation: From Mathematical and Statistical Foundations to Applications

    by Jana de Wiljes, Youssef Marzouk, Aretha Teckentrup

    Data assimilation, where predictions from a dynamical system are updated sequentially based on new and incomplete observations, is increasingly finding applications in many areas of science and technology. This workshop brought together a collection of scientists from dynamical systems, statistics, machine learning, applied probability, uncertainty quantification, and mathematical modelling, as well as practitioners in the field.

  • Open Access

    Deep Gaussian process priors for Bayesian image reconstruction

    by Jonas Latz, Aretha L Teckentrup, Simon Urbainczyk

    In image reconstruction, an accurate quantification of uncertainty is of great importance for informed decision making. Here, the Bayesian approach to inverse problems can be used: the image is represented through a random function that incorporates prior information which is then updated through Bayes’ formula. However, finding a prior is difficult, as images often exhibit non-stationary effects and multi-scale behavior. Thus, usual Gaussian process priors are not suitable. Deep Gaussian processes, on the other hand, encode non-stationary behavior in a natural way through their hierarchical structure. To apply Bayes’ formula, one commonly employs a Markov chain Monte Carlo (MCMC) method. In the case of deep Gaussian processes, sampling is especially challenging in high dimensions: the associated covariance matrices are large, dense, and changing from sample to sample. A popular strategy towards decreasing computational complexity is to view Gaussian processes as the solutions to a fractional stochastic partial differential equation (SPDE). In this work, we investigate efficient computational strategies to solve the fractional SPDEs occurring in deep Gaussian process sampling, as well as MCMC algorithms to sample from the posterior. Namely, we combine rational approximation and a determinant-free sampling approach to achieve sampling via the fractional SPDE. We test our techniques in standard Bayesian image reconstruction problems: upsampling, edge detection, and computed tomography. In these examples, we show that choosing a non-stationary prior such as the deep GP over a stationary GP can improve the reconstruction. Moreover, our approach enables us to compare results for a range of fractional and non-fractional regularity parameter values.


  • Open Access

    Gaussian processes for Bayesian inverse problems associated with linear partial differential equations

    by Tianming Bai, Aretha L. Teckentrup, Konstantinos C. Zygalakis

    This work is concerned with the use of Gaussian surrogate models for Bayesian inverse problems associated with linear partial differential equations. A particular focus is on the regime where only a small amount of training data is available. In this regime the type of Gaussian prior used is of critical importance with respect to how well the surrogate model will perform in terms of Bayesian inversion. We extend the framework of Raissi et. al. (2017) to construct PDE-informed Gaussian priors that we then use to construct different approximate posteriors. A number of different numerical experiments illustrate the superiority of the PDE-informed Gaussian priors over more traditional priors.


  • Data Assimilation – Mathematical Foundation and Applications

    by Youssef M. Marzouk, Sebastian Reich, Aretha Teckentrup

    The field of “Data Assimilation” has been driven by applications from the geosciences where complex mathematical models are interfaced with observational data in order to improve model forecasts. Mathematically, data assimilation is closely related to filtering and smoothing on the one hand and inverse problems and statistical inference on the other. Key challenges of data assimilation arise from the high-dimensionality of the underlying models, combined with systematic spatio-temporal model errors, pure model uncertainty quantification and relatively sparse observation networks. Advances in the field of data assimilation will require combination of a broad range of mathematical techniques from differential equations, statistics, machine learning, probability, scientific computing and mathematical modeling, together with insights from practitioners in the field. The workshop brought together a collection of scientists representing this broad spectrum of research strands.


  • Open Access

    Introduction To Gaussian Process Regression In Bayesian Inverse Problems, With New ResultsOn Experimental Design For Weighted Error Measures

    by Tapio Helin, Andrew Stuart, Aretha Teckentrup, Konstantinos Zygalakis

    Bayesian posterior distributions arising in modern applications, including inverse problems in partial differential equation models in tomography and subsurface flow, are often computationally intractable due to the large computational cost of evaluating the data likelihood. To alleviate this problem, we consider using Gaussian process regression to build a surrogate model for the likelihood, resulting in an approximate posterior distribution that is amenable to computations in practice. This work serves as an introduction to Gaussian process regression, in particular in the context of building surrogate models for inverse problems, and presents new insights into a suitable choice of training points. We show that the error between the true and approximate posterior distribution can be bounded by the error between the true and approximate likelihood, measured in the $L^2$-norm weighted by the true posterior, and that efficiently bounding the error between the true and approximate likelihood in this norm suggests choosing the training points in the Gaussian process surrogate model based on the true posterior.

  • Adaptive Multilevel Monte Carlo for Probabilities

    by Abdul-Lateef Haji-Ali, Jonathan Spence, Aretha L. Teckentrup

    We consider the numerical approximation of $\mathbb{P}[G\in \Omega]$, where the $d$-dimensional random variable $G$ cannot be sampled directly, but there is a hierarchy of increasingly accurate app...


  • Open Access

    Bayesian comparison of stochastic models of dispersion

    by Martin T. Brolly, James R. Maddison, Aretha L. Teckentrup, Jacques Vanneste

    Stochastic models of varying complexity have been proposed to describe the dispersion of particles in turbulent flows, from simple Brownian motion to complex temporally and spatially correlated models. A method is needed to compare competing models, accounting for the difficulty in estimating the additional parameters that more complex models typically introduce. We employ a data-driven method, Bayesian model comparison, which assigns probabilities to competing models based on their ability to explain observed data. We focus on the comparison between the Brownian and Langevin dynamics for particles in two-dimensional isotropic turbulence, with data that consist of sequences of particle positions obtained from simulated Lagrangian trajectories. We show that, while on sufficiently large time scales the models are indistinguishable, there is a range of time scales on which the Langevin model outperforms the Brownian model. While our set-up is highly idealised, the methodology developed is applicable to more complex flows and models of particle dynamics.