Recursive moment updates for scalable Bayesian nonparametric regression
Abstract
Bayesian nonparametric regression methods have wide applications in statistics and machine learning, but inference can often be expensive or require approximations. This paper introduces a class of recursive moment function updates which are closed form, interpretable, expedient, and fully quantify Bayesian uncertainty through the martingale posterior. The proposed recursive updates can be used off-the-shelf and encompass challenging scenarios such as nonparametric heteroscedasticity, heavy-tailed or skewed noise, and importantly generalize to the multi-output case with missing outcomes without any significant loss in tractability or speed. We show frequentist consistency under weak assumptions in the aforementioned scenarios, and demonstrate empirically that our proposed method is orders of magnitude faster than competing Bayesian nonparametric approaches, with competitive or even superior prediction and estimation accuracy.
Related
- Scalable Nonparametric Change-Plane Regression with Random Features: Estimation and Inference
- GNet: A scalable and flexible Gaussian process network with nonparametric neurons
- Choosing the penalty in nonparametric regression: short and long-range dependence
- Pay Only for Disagreement: Certified No-Regression Verdicts for Model Updates with Matching Label-Complexity Bounds
- Convex order and preservation of convexity for Bayesian posterior updates
BibTeX
@misc{liu2026recursive,
title = {{Recursive moment updates for scalable Bayesian nonparametric regression}},
author = {Peter Liu and Andrew Yiu and Edwin Fong},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.33388},
eprint = {2610.33388},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.33388},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Recursive moment updates for scalable Bayesian nonparametric regression
AU - Peter Liu
AU - Andrew Yiu
AU - Edwin Fong
PY - 2026
DA - 2026/10/24
PB - arXiv
DO - 10.48550/arxiv.2610.33388
UR - https://arxiv.org/abs/2610.33388
AB - Bayesian nonparametric regression methods have wide applications in statistics and machine learning, but inference can often be expensive or require approximations. This paper introduces a class of recursive moment function updates which are closed form, interpretable, expedient, and fully quantify Bayesian uncertainty through the martingale posterior. The proposed recursive updates can be used off-the-shelf and encompass challenging scenarios such as nonparametric heteroscedasticity, heavy-tailed or skewed noise, and importantly generalize to the multi-output case with missing outcomes without any significant loss in tractability or speed. We show frequentist consistency under weak assumptions in the aforementioned scenarios, and demonstrate empirically that our proposed method is orders of magnitude faster than competing Bayesian nonparametric approaches, with competitive or even superior prediction and estimation accuracy.
ER -