Time Series Approximate Bayesian Computation
Also known as: TS-ABC, time series ABC, likelihood-free inference for time series, ABC for dynamical systems
Time series ABC is a likelihood-free Bayesian inference method that estimates the posterior distribution of model parameters for dynamical or time-indexed systems by comparing summary statistics of simulated trajectories to those of the observed series, bypassing the need to evaluate an analytic likelihood. It is particularly valuable for complex mechanistic or stochastic models whose likelihoods are intractable.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use time series ABC when your mechanistic or stochastic model for a time series has an intractable or computationally prohibitive likelihood — common in epidemiology, ecology, systems biology, and finance — but can be simulated efficiently. It is the appropriate tool when you need full Bayesian uncertainty quantification for complex dynamical models and your data are short enough that simulating many replicates is feasible. Avoid it when the likelihood is tractable (use MCMC or HMC instead, which are more efficient), when the time series is very long and simulation is expensive, or when no informative sufficient statistics can be designed, as the posterior approximation will be poor regardless of sample size.
Strengths & limitations
- Operates without evaluating the likelihood, enabling inference for mechanistic models in biology, ecology, epidemiology, and finance.
- Naturally incorporates prior knowledge and returns a full approximate posterior distribution.
- Easily parallelisable: each simulation is independent, so compute clusters can be used effectively.
- Compatible with arbitrarily complex stochastic or agent-based time series models.
- SMC-ABC extensions provide adaptive tolerance schedules that substantially improve efficiency over naive rejection.
- Accuracy depends critically on the choice and sufficiency of summary statistics; poorly chosen summaries lead to biased posteriors.
- Computationally intensive: many simulations are required, especially in high-parameter spaces.
- The tolerance epsilon introduces an approximation error that diminishes but never fully vanishes in practice.
- Scales poorly to long time series where each simulation is expensive.
- Curse of dimensionality in parameter space makes acceptance rates very low for models with many parameters.
Frequently asked
How do I choose summary statistics for a time series?
Start with well-established temporal features: sample mean, variance, autocorrelation at relevant lags, power spectrum peaks, or extremes. Ideally the statistics should be jointly sufficient for your parameters. Semi-automatic ABC methods (Fearnhead & Prangle, 2012) and neural density estimators can help identify informative summaries from training simulations when manual choice is difficult.
What is the difference between rejection ABC and SMC-ABC for time series?
Rejection ABC draws parameters from the prior and accepts or rejects each independently; it is simple but very inefficient for tight tolerances. SMC-ABC maintains a population of particles that is iteratively refined through a sequence of decreasing tolerances, resampling and perturbing accepted particles. For time series models SMC-ABC is almost always preferred because it dramatically increases the effective acceptance rate.
How does time series ABC relate to the particle filter?
The particle filter (sequential Monte Carlo) tracks a latent state online given fixed parameters, producing an estimate of the likelihood. Time series ABC bypasses the likelihood entirely by simulation and comparison. The two can be combined: a particle filter inside an ABC loop can handle state-space models whose observation likelihoods are tractable but whose marginal likelihood over parameters is not.
When should I prefer MCMC over ABC for a time series model?
If your model has an evaluable likelihood — even an expensive one — MCMC with HMC (e.g. Stan) is almost always more efficient and produces exact (up to convergence) posterior samples. Switch to ABC only when the likelihood is genuinely unavailable or when simulating the data-generating process is cheaper than evaluating its probability.
Can ABC handle long time series?
With difficulty. Each simulation must reproduce a trajectory of the same length as the observed series. For long series, simulation cost grows linearly or worse, and many replicate simulations are needed. Techniques such as segmenting the series, using approximate local likelihoods, or replacing simulation with neural surrogate models are active areas of research to address this bottleneck.
Sources
- Toni, T., Welch, D., Strelkowa, N., Ipsen, A. & Stumpf, M. P. H. (2009). Approximate Bayesian computation scheme for parameter inference and model selection in dynamical systems. Journal of the Royal Society Interface, 6(31), 187–202. DOI: 10.1098/rsif.2008.0172 ↗
- Sisson, S. A., Fan, Y. & Beaumont, M. A. (Eds.) (2018). Handbook of Approximate Bayesian Computation. CRC Press. ISBN: 978-1439881507
How to cite this page
ScholarGate. (2026, June 3). Time Series Approximate Bayesian Computation. ScholarGate. https://scholargate.app/en/bayesian/time-series-approximate-bayesian-computation
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Approximate Bayesian ComputationSimulation↔ compare
- Dynamic Bayesian InferenceBayesian↔ compare
- Kalman FilterBayesian↔ compare
- Particle FilterBayesian↔ compare
- Sequential Monte CarloBayesian↔ compare
- Time series Bayesian inferenceBayesian↔ compare