Inferensys

Glossary

Particle Filter

A Sequential Monte Carlo method that approximates the posterior distribution of latent states using a set of weighted random samples, enabling inference in nonlinear, non-Gaussian regime-switching models.
ML engineer running AI model benchmarks, performance charts on multiple screens, late night home office setup.
SEQUENTIAL MONTE CARLO ESTIMATION

What is a Particle Filter?

A Particle Filter is a Sequential Monte Carlo method that approximates the posterior distribution of latent states using a set of weighted random samples (particles), enabling robust inference in nonlinear, non-Gaussian regime-switching models.

A Particle Filter is a non-parametric Bayesian estimator that recursively approximates the posterior probability density of a system's hidden state using a discrete set of weighted random samples called particles. Unlike the Kalman Filter, which requires linear dynamics and Gaussian noise, the Particle Filter propagates these samples through the true nonlinear state-space model and reweights them based on the likelihood of observing the actual data, making it ideal for complex financial time series where market regimes exhibit non-normal distributions.

The algorithm operates through sequential importance sampling with resampling, where particles with negligible weights are discarded and high-weight particles are replicated to prevent degeneracy. In quantitative finance, this mechanism allows the filter to track sudden shifts in volatility or correlation structures without parametric assumptions, dynamically updating the probability of being in a bull or bear regime as new tick data arrives.

Sequential Monte Carlo Inference

Key Features of Particle Filters

Particle filters provide a flexible, simulation-based framework for estimating latent states in nonlinear, non-Gaussian regime-switching models where traditional Kalman filters fail.

01

Importance Sampling & Weighting

Each particle represents a hypothesis about the hidden market state. Particles are drawn from a proposal distribution and assigned importance weights proportional to how well they explain the observed data. Weights are normalized to sum to one, creating a discrete approximation of the posterior distribution. This mechanism allows the filter to handle non-Gaussian noise and multimodal state densities that are common during market regime transitions.

02

Sequential Importance Resampling (SIR)

To combat particle degeneracy—where most particles carry negligible weight—the SIR algorithm periodically resamples the particle set. Particles with high weights are replicated, while low-weight particles are discarded. This focuses computational resources on the most probable regions of the state space. Common resampling schemes include multinomial, systematic, and residual resampling, each offering different trade-offs between variance and computational cost.

03

Nonlinear & Non-Gaussian State Estimation

Unlike the Kalman filter, which assumes linear dynamics and Gaussian noise, particle filters make no parametric assumptions. They can estimate latent states in models with:

  • Stochastic volatility with fat-tailed distributions
  • Regime-switching jump diffusions
  • Threshold autoregression with abrupt structural breaks This makes them ideal for inferring hidden market regimes from observed returns that exhibit skewness and excess kurtosis.
04

Auxiliary Particle Filters (APF)

The Auxiliary Particle Filter improves sampling efficiency by incorporating the latest observation before propagating particles. It computes first-stage weights based on a point estimate of each particle's predictive likelihood, then resamples before the propagation step. This produces a more evenly weighted particle set and reduces the variance of estimates, particularly valuable when observations are highly informative about the latent state, such as during volatility clustering events.

05

Likelihood Approximation & Model Selection

Particle filters provide an unbiased estimate of the marginal likelihood of the observed data, which is critical for Bayesian model comparison. The log-likelihood can be computed recursively as the sum of log predictive densities, enabling formal comparison between competing regime-switching specifications—such as a two-state versus three-state Markov switching model—using Bayes factors or information criteria.

06

Rao-Blackwellized Particle Filters

When the state-space model contains a conditionally linear Gaussian substructure, the Rao-Blackwellized particle filter marginalizes out the linear components analytically using a Kalman filter and only applies particle methods to the nonlinear components. This variance reduction technique dramatically improves estimation accuracy for models like regime-switching stochastic volatility, where volatility is nonlinear but the mean equation is linear conditional on the regime.

PARTICLE FILTERS EXPLAINED

Frequently Asked Questions

Clear, technically precise answers to the most common questions about Sequential Monte Carlo methods and their application in nonlinear, non-Gaussian regime-switching models.

A particle filter is a Sequential Monte Carlo (SMC) method that approximates the posterior distribution of a latent state using a set of weighted random samples called particles. Unlike the Kalman filter, which assumes linear Gaussian dynamics, particle filters represent the probability distribution non-parametrically through a cloud of discrete points. The algorithm operates recursively through three core steps: prediction, where each particle is propagated forward using the state transition model; update, where particle weights are adjusted based on the likelihood of observing the actual measurement; and resampling, where particles with negligible weights are discarded and replaced by copies of high-weight particles to prevent weight degeneracy. This mechanism enables robust inference in highly nonlinear, non-Gaussian regime-switching models where analytical solutions are intractable.

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.