paper-with-me

Papers

Randomised Postiterations for Calibrated BayesCG

2025-04-05 · Niall Vyas, Disha Hegde, Jon Cockayne

The Bayesian conjugate gradient method offers probabilistic solutions to linear systems but suffers from poor calibration, limiting its utility in uncertainty quantification tasks. Recent approaches leveraging postiterations to construct priors have improved computational properties but failed to correct calibration issues. In this work, we propose a novel randomised postiteration strategy that enhances the calibration of the BayesCG posterior while preserving its favourable convergence characteristics. We present theoretical guarantees for the improved calibration, supported by results on the distribution of posterior errors. Numerical experiments demonstrate the efficacy of the method in both synthetic and inverse problem settings, showing enhanced uncertainty quantification and better propagation of uncertainties through computational pipelines.

📄 PDF Abstract BibTeX arXiv:2504.04247

Code (0)

등록된 구현이 없습니다.

Tasks

Uncertainty Quantification

Similar Papers 제목 키워드 기반

Contributed Discussion of "A Bayesian Conjugate Gradient Method"

2019-08-08 · Francois-Xavier Briol, Francisco A. Diaz De la O, Peter O. Hristov

We would like to congratulate the authors of "A Bayesian Conjugate Gradient Method" on their insightful paper, and welcome this publication which we firmly believe will become a fundamental contribution to the growing fi…

Universal randomised signatures for generative time series modelling

2024-06-14 · Francesca Biagini, Lukas Gonon, Niklas Walter

Randomised signature has been proposed as a flexible and easily implementable alternative to the well-established path signature. In this article, we employ randomised signature to introduce a generative model for financ…

Time Series

Small-time moderate deviations for the randomised Heston model

2018-08-10

We extend previous large deviations results for the randomised Heston model to the case of moderate deviations. The proofs involve the G\"artner-Ellis theorem and sharp large deviations tools.

When and why randomised exploration works (in linear bandits)

2025-02-13 · Marc Abeille, David Janz, Ciara Pike-Burke

We provide an approach for the analysis of randomised exploration algorithms like Thompson sampling that does not rely on forced optimism or posterior inflation. With this, we demonstrate that in the $d$-dimensional line…

Thompson Sampling

Strategic Classification with Randomised Classifiers

2025-02-03 · Jack Geary, Henry Gouk

We consider the problem of strategic classification, where a learner must build a model to classify agents based on features that have been strategically modified. Previous work in this area has concentrated on the case …

Classification