Bayesian PLSs are special cases of non-stationary affine PIMs which are proven calibrated, and affine tracing automates construction of probabilistic iterative methods from classical code.
Cambridge University Press, Cambridge
4 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
years
2026 4verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
Introduces a scalable Bayesian inference framework for nonlinear conservation laws using Gaussian process priors and sparse approximations, enabling accurate forward simulations with UQ and fast posterior recovery on inverse problems.
autonugget uses Richardson extrapolation across multiple regularized linear solves to produce stable, autodiff-compatible solutions for ill-conditioned systems without selecting a single nugget.
Bayesian optimization with Gaussian processes unifies minimization, single-point saddle searches, and double-ended path searches on potential energy surfaces through a shared six-step surrogate loop using derivative observations and inverse-distance kernels.
citing papers explorer
-
Affine Tracing: A New Paradigm for Probabilistic Linear Solvers
Bayesian PLSs are special cases of non-stationary affine PIMs which are proven calibrated, and affine tracing automates construction of probabilistic iterative methods from classical code.
-
Scalable Bayesian Inference for Nonlinear Conservation Laws
Introduces a scalable Bayesian inference framework for nonlinear conservation laws using Gaussian process priors and sparse approximations, enabling accurate forward simulations with UQ and fast posterior recovery on inverse problems.
-
Extrapolating from Regularised Solutions for Solving Ill-Conditioned Linear Systems in Machine Learning
autonugget uses Richardson extrapolation across multiple regularized linear solves to produce stable, autodiff-compatible solutions for ill-conditioned systems without selecting a single nugget.
-
A Tutorial Review of Bayesian Optimization with Gaussian Processes to Accelerate Stationary Point Searches
Bayesian optimization with Gaussian processes unifies minimization, single-point saddle searches, and double-ended path searches on potential energy surfaces through a shared six-step surrogate loop using derivative observations and inverse-distance kernels.