Scalable Bayesian Inference for Time Series via Divide and Conquer
4 affiliations
- 1Department of Statistical Science, Duke University
- 2Duke University#TAB#
- 3School of Mathematics and Statistics, University of New South Wales
- 4School of Physics, Mathematics and Computation, The University of Western Australia
Abstract
Bayesian computation often scales poorly with increasing data size, motivating developments such as divide-and-conquer approaches for scalable inference. These methods partition the data into subsets, perform parallel inference on each subset, and aggregate the results into a single posterior. Appealing theoretical properties and practical performance have been demonstrated for independent data; however, methods for dependent data remain challenging. Existing methods rely on ad hoc approximations with limited theoretical guarantees that lead to potentially poor accuracy in practice. Here, we focus on time-series data and propose a simple, scalable divide-and-conquer method for dependent time series, with theoretically rigorous accuracy guarantees. Simulation studies and real-data examples are used to empirically verify the effectiveness of our approach.
Related
- Spectral divide-and-conquer MCMC for long stationary time series
- Two moments suffice for Bessel approximation: conditioned differences, contingency tables, and probabilistic divide-and-conquer
- Divide-and-Conquer Neural Bayes Estimation for Spatial and Spatiotemporal Point Process Models
- Scaling Spatially Varying Distributed Lag Nonlinear Models for Nationwide Small-Area Data: A Divide-and-Conquer Approach
- Compressed Active Subspaces for Scalable Bayesian Inference
BibTeX
@article{ou2026scalable,
title = {{Scalable Bayesian Inference for Time Series via Divide and Conquer}},
author = {Rihui Ou and Lachlan Astfalck and Deborshee Sen and David B. Dunson},
journal = {Journal of the American Statistical Association},
year = {2026},
month = jul,
doi = {10.1080/01621459.2026.2688950},
url = {https://doi.org/10.1080/01621459.2026.2688950},
note = {CC BY},
}
RIS
TY - JOUR
TI - Scalable Bayesian Inference for Time Series via Divide and Conquer
AU - Rihui Ou
AU - Lachlan Astfalck
AU - Deborshee Sen
AU - David B. Dunson
PY - 2026
DA - 2026/07/21
JO - Journal of the American Statistical Association
DO - 10.1080/01621459.2026.2688950
UR - https://doi.org/10.1080/01621459.2026.2688950
AB - Bayesian computation often scales poorly with increasing data size, motivating developments such as divide-and-conquer approaches for scalable inference. These methods partition the data into subsets, perform parallel inference on each subset, and aggregate the results into a single posterior. Appealing theoretical properties and practical performance have been demonstrated for independent data; however, methods for dependent data remain challenging. Existing methods rely on ad hoc approximations with limited theoretical guarantees that lead to potentially poor accuracy in practice. Here, we focus on time-series data and propose a simple, scalable divide-and-conquer method for dependent time series, with theoretically rigorous accuracy guarantees. Simulation studies and real-data examples are used to empirically verify the effectiveness of our approach.
SN - 0162-1459
SN - 1537-274X
ER -