Particle Filter¶

Approximate a recursive hidden-state posterior with a weighted particle population that is propagated through a state model, corrected by observation likelihoods, and selectively resampled to control weight degeneracy.

Version: v2 · 2026-09-06 · History
Domain-specific #: 2455
Origin domain: statistics
Subdomain: sequential bayesian filtering
Aliases: Particle Filtering, Sequential Monte Carlo Filter, Smc Filter

Core Idea¶

A particle filter is an online Monte Carlo method for estimating the changing, partly hidden state of a dynamical system from noisy observations. It represents the filtering distribution

\[ p(x_t\mid y_{1:t}) \]

not by a closed-form density, a fixed grid, or only a mean and covariance, but by a finite weighted empirical distribution

\[ \widehat p_N(dx_t\mid y_{1:t})=\sum_{i=1}^{N}w_t^{(i)}\,\delta_{x_t^{(i)}}(dx_t), \qquad \sum_i w_t^{(i)}=1. \]

Here each particle is a candidate state, and its normalized weight records how much posterior support that candidate receives. When a new time step arrives, the filter performs two logically indispensable operations: it proposes or propagates candidate states using a transition-informed proposal, and it weights them by the observation and by any correction between the proposal and the target. Selective resampling is the characteristic and ordinarily necessary practical control that reassigns computation from negligible-weight particles to supported regions before importance weights become unusably concentrated. Pure sequential-importance-sampling formulations can omit resampling, but repeated updates then incur severe weight degeneracy. This weighted-population recursion is the stable family identity described by standard particle-filter tutorials and general sequential Monte Carlo treatments.^[1]^[2]

The familiar “propagate–weight–resample” phrase names logical roles, not one compulsory line-by-line ordering. A bootstrap filter samples from the state-transition prior, weights by the current likelihood, and commonly resamples at each step; auxiliary filters can choose ancestors before propagation; adaptive filters resample only when a degeneracy diagnostic crosses a threshold. What must survive these variations is the closure: a particle population targets the current sequential distribution, new evidence changes relative particle support, and a population-control operation renews ancestry when weight concentration would otherwise leave almost all computation on effectively dead samples.

The method is especially valuable when the dynamics or observation model are nonlinear, the relevant distributions are non-Gaussian or multimodal, and the exact Bayesian filtering recursion is analytically unavailable. Gordon, Salmond, and Smith’s bootstrap filter made this concrete by representing the state density with random samples and recursively updating and propagating them in nonlinear, non-Gaussian tracking.^[3] The price of that flexibility is explicit Monte Carlo error, weight degeneracy, resampling noise, possible loss of particle diversity, and often severe scaling problems as the informative dimension of the observation grows.

Structural Signature¶

Sig role-phrases:

the latent state — the dynamical state whose present value is not observed directly
the transition model — the state law that carries candidates from the preceding time step
the observation model — the sequential observation stream and its likelihood model
the particle population — the finite weighted sample that empirically represents posterior uncertainty
the proposal and weight correction — the sampling law and importance correction that align particles with the target
the population-control policy — the selective resampling or equivalent decision that renews useful ancestry when degeneracy warrants it
the recursive posterior target — the filtering distribution that closes one cycle and becomes the next cycle's input

The recognition test is stricter than “an algorithm uses many random samples.” Let the hidden state evolve according to a transition density \(f_t(x_t\mid x_{t-1})\), and let the current observation have likelihood \(g_t(y_t\mid x_t)\). A general particle filter draws a descendant \(x_t^{(i)}\) from a proposal \(q_t\), gives it an unnormalized importance weight proportional to the ancestor weight times \(f_tg_t/q_t\), normalizes across the population, and uses the resulting weighted empirical measure to estimate the current posterior. Resampling replaces the weighted population with an approximately equally weighted descendant population by drawing ancestors in proportion to their support; residual, stratified, systematic, and multinomial schemes differ in the sampling noise they introduce.^[2]^[4]

Five invariants hold across ordinary variants:

Sequential target: the represented target changes with the arrival of data, characteristically the filtering distribution conditioned on observations through time \(t\).
Weighted empirical representation: posterior uncertainty is carried by a population of point masses and weights, not just one trajectory or one Gaussian summary.
Prediction and correction: dynamics move support forward; observation information redistributes that support.
Importance consistency: if the proposal differs from the transition prior or target construction, the weight contains the corresponding likelihood-ratio correction.
Degeneracy control: the design declares whether and when to resample or renew the population; resampling is ordinarily necessary in practical long sequences because pure SIS otherwise concentrates effective support in very few particles, but it is not a logical requirement of every finite formulation.

Remove the sequential target and the method reduces toward ordinary importance sampling or generic Monte Carlo. Remove observation-dependent weighting and it becomes forward simulation from a state model. Remove the transition model and it ceases to be a state filter. Remove population renewal from the design and long sequential runs inherit unbounded weight degeneracy even if a short run can temporarily proceed without resampling.

What It Is Not¶

Not generic Monte Carlo simulation. Monte Carlo simulation covers approximation by random sampling. It does not by itself entail a hidden state, arriving observations, recursive posterior targets, importance weights, or the resampling of ancestry. A particle filter is a tightly specified sequential Bayesian specialization of that parent method.
Not every sequential Monte Carlo algorithm. Modern SMC samplers can traverse an artificial sequence of static target distributions, perform normalizing-constant estimation, or support optimization and batch Bayesian computation; their index need not be physical time or a hidden-state filtering index.^[5] “Sequential Monte Carlo” is therefore a broader contemporary family label. “Sequential Monte Carlo filter” is a safe alias for this entry; bare sequential_monte_carlo is not.
Not synonymous with the bootstrap filter. The bootstrap filter is the foundational transition-prior proposal with sampling/importance-resampling construction described by Gordon, Salmond, and Smith.^[3] General particle filters allow other proposals, auxiliary variables, adaptive resampling schedules, regularization, Rao–Blackwellization, and rejuvenation. Bootstrap filter is an important recognized variant, not a lossless alias for the whole family.
Not merely a state-space model. The model specifies latent-state dynamics and how observations arise. A particle filter is an inference algorithm operating on that model. The same model can instead be handled by an exact finite-state recursion, a Kalman-family approximation, a grid filter, or another inference method.
Not an exact posterior representation at finite \(N\). Even when the underlying Bayesian recursion is exact, the empirical measure has Monte Carlo variability. Resampling changes ancestry and variance; it does not create information or guarantee that a lost mode will reappear.
Not an automatically superior nonlinear filter. Flexibility about distributional shape does not remove proposal mismatch, finite-population error, high-dimensional collapse, model misspecification, or compute constraints. The relevant question is whether the available particle budget covers the posterior regions that matter.

Scope of Application¶

Literal transfer is bounded to sequential probabilistic inference in which particles, weights, proposals, and updates approximate a declared evolving distribution. - Nonlinear and non-Gaussian state estimation. This is the central habitat: recursively estimating a hidden Markov state where linear-Gaussian closure is unavailable. The bootstrap filter, Monte Carlo filter, and later generalized importance-sampling formulations all preserve the same weighted-population recursion.^[3]^[6]^[2]

Target tracking and signal processing. Bearings-only tracking, maneuvering-target models, channel tracking, and related signal-estimation tasks reuse the transition, likelihood, weighted-particle, and resampling roles. The 1993 bootstrap-filter paper used nonlinear bearings-only tracking as a principal demonstration.^[3]
Robot localization and navigation. Monte Carlo localization treats robot pose as the latent state, motion commands as transition information, and sensor returns as likelihood evidence. Fox and colleagues reported an online localization algorithm whose sampling representation retained complex distributions while reducing computation and memory relative to the grid-based approaches they compared.^[7]
Computer-vision tracking. CONDENSATION propagated conditional-density samples through stochastic dynamics and observation reinforcement to track contours in clutter, retaining multimodal hypotheses that a single Gaussian track could erase.^[8]
Time-series analysis, econometrics, communications, and engineering. The same recursive importance-and-resampling machinery appears when latent regimes, volatility, channels, or other dynamic quantities must be inferred online. Liu and Chen unified several dynamic-system Monte Carlo methods around importance sampling, resampling, rejection sampling, and Markov-chain moves; Kitagawa developed Monte Carlo filtering and smoothing for nonlinear, non-Gaussian state-space models.^[9]^[6]
Geophysical and environmental data assimilation—with a major qualification. Particle filters can retain nonlinear, non-Gaussian analysis updates, but naive global methods can suffer catastrophic weight collapse when many informative observations act at once. Snyder and colleagues showed that required ensemble size can grow exponentially with the variance of the observation log likelihood in their high-dimensional settings.^[10] Localization, tempering, hybridization, and structured proposals are interventions, not reasons to omit the limitation.

The boundary of scope is probabilistic state inference (and closely allied sequential-distribution inference) with a defensible target and proposal-weight calculation. Calling any agent population that is mutated and selected a “particle filter” is metaphorical unless its particles represent a target distribution and its weights/resampling implement the corresponding inference correction.

Clarity¶

Particle filtering clarifies an otherwise vague claim—“the tracker maintains several guesses”—by forcing each guess into an explicit inferential role. What distribution should the population approximate? What state does a particle encode? Which model predicts descendants? Which likelihood scores the new observation? Which proposal actually generated each descendant, and where is the proposal-to-target correction? When does effective support become too concentrated, and which resampling scheme renews it?

That checklist diagnoses common category errors. A simulator that launches many trajectories but never conditions on data is forward Monte Carlo, not a particle filter. A detector that gives candidates confidence scores but has no recursive target or importance correction is a ranked hypothesis set, not necessarily a particle filter. A Kalman filter that propagates only mean and covariance is a recursive Bayesian filter but not a particle filter. A general SMC sampler that moves through a temperature schedule is an SMC method, but not a hidden-state particle filter unless the targets are filtering distributions.

The concept also makes uncertainty geometry visible. Two particle clouds can have the same mean while encoding radically different beliefs: one narrow and unimodal, another split between two modes. The particles show where support lies; the weights show how evidence redistributes it; ancestry shows which hypotheses survived; effective sample size summarizes weight concentration. Those distinctions let a reviewer ask whether apparent certainty comes from data or from accidental particle impoverishment.

Manages Complexity¶

The exact nonlinear filtering recursion operates on full probability distributions. Grid methods face rapidly increasing storage with state dimension; analytic filters require closure assumptions; carrying every possible state trajectory is impossible. A particle filter compresses that distributional object into \(N\) weighted representatives and reuses the same population from one observation to the next. Computation is concentrated in regions the current model and data regard as plausible rather than allocated uniformly over a state-space grid.^[3]

This compression is adaptive. Propagation explores where the dynamics can move; likelihood weighting concentrates on observation-compatible descendants; resampling reallocates future simulation toward those regions. Proposal design can fold current observations into propagation so fewer samples are wasted. Rao–Blackwellization can integrate analytically tractable state components while particles carry only the rest. These moves turn “solve an evolving nonlinear posterior” into a repeated local workflow over a finite population.^[2]^[9]

But the complexity is managed, not abolished. A poor proposal can put particles where the likelihood is negligible. Repeated resampling can clone a few ancestors until path diversity disappears. A population large enough for one-dimensional tracking may be hopeless for a globally observed, high-dimensional field. The abstraction is most useful when it keeps those liabilities attached to the representation: particle budget, effective sample size, ancestry, proposal mismatch, and state dimension are not implementation trivia but parts of the method's adequacy claim.

Abstract Reasoning¶

The mechanism licenses a compact set of predictive and intervention inferences:

If weights concentrate before resampling, effective sample size falls. Increase particle count, improve the proposal, temper the likelihood, reduce the information entering one update, or resample adaptively; merely normalizing the same weights cannot restore coverage.
If resampling is too frequent, low-weight but legitimate modes may disappear. Raise the resampling threshold, use a lower-variance resampler, add move/rejuvenation steps, or improve proposal diversity. Resampling repairs allocation but can damage diversity.
If all particles receive negligible likelihood, suspect proposal–observation mismatch or model failure. More repetitions of the same proposal may be less useful than redesigning it around the observation or adding an outlier model.
If posterior shape is strongly multimodal, a Gaussian filter can merge or erase modes that particles can retain—provided each mode is seeded and survives selection. The qualification matters: particle representation permits multimodality but does not guarantee coverage.
If informative dimension rises while particle budget is fixed, collapse risk rises sharply. Localization or structural factorization may be necessary; “non-Gaussian capability” alone is not a scalability argument.^[10]
If the task needs entire paths rather than only the current state, ancestry becomes a first-class object. Filtering can look healthy at the present time while repeated resampling leaves few distinct historical trajectories, motivating smoothing-specific methods.

The broader reasoning lesson remains in-domain: inference quality depends on the fit among target, proposal, weight correction, selection schedule, and particle budget. A visual cloud is not evidence of coverage; every apparent hypothesis must be traceable to a sampling mechanism and every selection step to a target-preserving correction.

Knowledge Transfer¶

The method transfers literally across Bayesian filtering practices when the roles remain intact. In radar tracking, a particle is a possible target state; in robot localization, a possible pose; in computer vision, a possible contour or motion state; in econometrics, a possible latent regime or volatility state. Transition models, observations, likelihoods, weights, and resampling all keep the same mathematical meaning. This is exact in-domain transfer even though the physical sensors and state coordinates differ.

Techniques also transfer within the method family. An observation-informed proposal developed for one tracking problem teaches the same intervention elsewhere: move proposal mass toward the new likelihood before calculating the correction. A low-variance resampling scheme changes the population-renewal operator without changing the target. Rao–Blackwellization transfers when part of the state admits conditional analytic treatment. Adaptive particle counts transfer when compute should follow posterior difficulty. These are portable engineering moves because they alter a stable role in the same inferential mechanism.

Outside sequential probabilistic inference, however, “keep many possibilities, score them, copy the winners, repeat” is no longer particle filtering. It is a looser combination of ensemble, selection, iteration, and approximation. Evolutionary algorithms, scenario portfolios, and organizational option sets may share that skeleton, but unless weights implement a target-distribution correction and particles approximate a sequential posterior, the transfer is analogy. The cross-domain cargo belongs to the broader primes; the particle-filter name stays with the statistical mechanism.

Examples¶

Canonical: nonlinear bearings-only tracking¶

Gordon, Salmond, and Smith’s foundational bootstrap-filter study included a bearings-only tracking problem: the hidden state contains target motion, while the sensor supplies an angle rather than direct Cartesian position. The nonlinear observation geometry and uncertainty can produce posterior shapes for which a locally Gaussian extended Kalman approximation is fragile. The bootstrap filter instead carries a sample representation and recursively updates and propagates it.^[3]

A concrete cycle begins with particles representing plausible target positions and velocities. Each is propagated through the target-motion model. The predicted bearing from each descendant is compared with the measured bearing; the observation likelihood becomes its relative weight. Resampling then selects supported descendants as ancestors for the next cycle, while roughening or related diversity devices can mitigate excessive duplication. The output may be summarized by a mean or credible region, but the population—not that summary—is the posterior approximation.

Mapped back: The latent state is target position and velocity; the transition model is the stochastic motion law; the observation stream is the sequence of noisy bearings; the particle population is the discrete set of candidate target states; the proposal/propagation generates descendants; the likelihood correction rewards particles predicting the observed bearing; resampling renews ancestry around supported hypotheses; and the recursive target is the target-state posterior conditioned on bearings through the current time.

Applied/practice: Monte Carlo localization for a mobile robot¶

In Monte Carlo localization, a mobile robot maintains a probability distribution over its pose rather than assuming it knows one exact location. Fox, Burgard, Dellaert, and Thrun presented MCL as a sampling-based Markov-localization algorithm that could represent complex pose distributions and adapt its sample count online.^[7] This matters when a robot begins with uncertain location, moves through ambiguous corridors, or temporarily sustains several plausible poses.

After a motion command, each pose particle is moved through a probabilistic motion model. When range or other sensor data arrive, the system evaluates how probable those observations would be from each proposed pose in the map. Weights then redistribute belief toward poses whose predicted sensor signatures match the real one. Resampling devotes the next cycle to those regions, while retaining enough population or recovery machinery to avoid irreversible commitment after an ambiguous or surprising observation.

Mapped back: The latent state is robot pose; the transition model is uncertain motion under the control command; the observation stream is the robot's sensor scan; the particles are candidate poses; propagation applies the motion model; weighting compares expected and observed sensor data; resampling reallocates computation toward plausible map locations; and the recursive posterior becomes the robot's pose belief before the next command and scan.

Structural Tensions¶

T1: Distributional flexibility vs. finite-sample error. A weighted particle cloud can represent skewness, heavy tails, and multiple modes without forcing a Gaussian form. Yet every extra shape feature must be populated by a finite sample, and an unvisited mode is indistinguishable from an impossible one. The representation's flexibility creates the coverage burden that can defeat it. Diagnostic: Does the particle budget put multiple independent particles in every decision-relevant posterior region, or is claimed flexibility only theoretical?

T2: Likelihood fidelity vs. weight degeneracy. Sharp observations correctly make compatible particles much more important than incompatible ones. The same faithful likelihood update can drive almost all normalized weight onto one particle, leaving the nominal population large but the effective population tiny. Diagnostic: Is weight concentration evidence that the observation truly identifies one region, or evidence that the proposal failed to place enough samples there?

T3: Resampling repair vs. sample impoverishment. Resampling removes computational waste by copying supported particles and discarding negligible ones. But copying reduces distinct ancestry, adds Monte Carlo variance, and can erase weak modes that later evidence would revive. The operation that repairs weights can impoverish state diversity. Diagnostic: Does the effective-sample-size gain after resampling outweigh the loss of unique states and ancestors?

T4: General nonlinear/non-Gaussian applicability vs. dimensional collapse. Particle filters avoid the linear-Gaussian closure required by Kalman-family methods, so their formal scope is broad. In high informative dimension, however, likelihood variation can demand an enormous particle population, making the nominally general method operationally unusable. Diagnostic: Is difficulty governed by manageable local structure, or by a global observation likelihood whose variance forces exponential particle growth?

T5: Proposal quality vs. proposal cost. An observation-informed proposal can place particles where the posterior will be, drastically reducing weight variance. Constructing or sampling from that proposal may require local linearization, optimization, or an embedded filter whose cost and bias rival the original problem. Diagnostic: Does the reduction in weight variance repay the extra per-particle computation and modeling assumptions?

T6: Online current-state accuracy vs. historical ancestry collapse. Filtering only asks for the present state, and resampling can keep that marginal accurate. Smoothing and parameter learning ask about past paths; repeated selection may leave nearly all current particles descended from a few old ancestors. A healthy present cloud can conceal a collapsed history. Diagnostic: Is the downstream query about \(x_t\) alone, or about trajectories and parameters that require diverse ancestry?

T7: Autonomy vs. reduction (named method vs. composition of parent primes). Particle filtering has an autonomous, routable technical identity: a weighted empirical posterior is recursively propagated, corrected, and resampled under a state-space model. At the same time, its cross-domain skeleton is already carried by Monte Carlo approximation, Bayesian updating, state transition, ensemble, and selection. Its independence is earned inside filtering by the exact closure of those roles, not by a new substrate-neutral principle. Diagnostic: Are you diagnosing proposal weights, posterior recursion, resampling, and particle ancestry—in which case the named method is necessary—or only “generate alternatives and retain good ones,” in which case the parent primes do the explanatory work?

Structural–Framed Character¶

Particle filter is mixed-structural, near the structural side. Its mechanism is formal, evaluatively neutral, and executable without a human observer. Across radar, robotics, vision, econometrics, and signal processing, reuse is recognition rather than metaphor: particles, likelihoods, proposals, and resampling have the same mathematical roles. The method does not arise from an institution, social convention, or normative frame.

It stops short of the structural pole on vocabulary and practice dependence. A particle is not any alternative; it is a random representative of a probability target. A weight is not any score; it is an importance or likelihood correction. Resampling is not any selection; it is a target-preserving population renewal with analyzable Monte Carlo consequences. The abstraction is also an algorithm analysts choose and implement, with tuning decisions about proposals, thresholds, and population size. Thus the structure is real and portable across a broad technical domain, but the named identity remains inseparable from computational statistics and sequential inference.

Its character: a mixed-structural specialist method whose formal mechanism travels across sequential-inference applications but whose probability-target vocabulary does not transfer literally beyond that substrate.

Structural Core vs. Domain Accent¶

What is skeletal (could lift toward a cross-domain prime). Strip away the probability theory and a population recursion remains: maintain multiple candidate representations; transform them forward; compare them with new information; give some more continuation capacity than others; and repeat from the renewed population. That skeleton is broad. It appears in evolutionary search, beam-like hypothesis management, scenario portfolios, and other generate–evaluate–select loops. Its pieces are already represented by ensemble, iteration, selection, and approximation.

What is domain-bound. Particle filtering's actual content is the part that cannot be stripped: a latent Markov or state-space process; a filtering distribution conditioned on an observation filtration; proposal and transition densities; Radon–Nikodym/importance-ratio weights; likelihood normalization; effective sample size; resampling variance; genealogical degeneracy; and Monte Carlo convergence as \(N\) grows. These terms determine which interventions are valid. Copying a highly scored business scenario is not “resampling” in the particle-filter sense unless the score is a coherent target/proposal correction and the renewed population still estimates a named distribution.

Why this does not clear the prime bar. The prime test asks whether vocabulary, diagnostics, and interventions travel across distinct substrates without heavy reinterpretation. Particle filters do travel literally across several application fields, but all lie within the same mathematical-statistical substrate of sequential probabilistic inference. Outside that substrate, the target-distribution guarantee disappears and the method becomes analogy. What travels generally is the parent composition—Monte Carlo approximation plus evidence-driven updating over a state-transition model with ensemble selection—not “particle filter” as an independent universal mechanism. The domain-specific node is still useful because that composition closes into a standard algorithm family with distinctive failures (weight collapse, impoverishment, proposal mismatch, ancestry collapse) that none of its parents alone predicts.

monte_carlo_simulation (confirmed; primary parent). A particle filter is a kind of Monte Carlo simulation: it replaces an analytically difficult probability distribution with estimates computed from random samples. It specializes the parent by making the target sequential, preserving weighted particles between updates, and adding importance correction and population renewal. The proposed relation is strict subsumption. The parent exists at prime_abstractions/v2/monte_carlo_simulation.md.
bayesian_updating (confirmed; constitutive relation). The observation-weighting step implements repeated Bayesian correction: the predicted distribution supplies the prior for time \(t\), the observation model supplies the likelihood, and normalized weights approximate the posterior that becomes the next recursion's input. Bayesian updating is an internal constituent rather than a taxonomic supertype, so the proposed relation is composition / part-of. The parent exists at prime_abstractions/v2/bayesian_updating.md.
state_and_state_transition (confirmed; prerequisite relation). Particle filtering presupposes a state representation and a transition rule that propagates it. This parent provides the state-space grammar, while the particle filter adds partial observation and Monte Carlo posterior inference. The proposed relation is composition / presupposes. The parent exists at prime_abstractions/v2/state_and_state_transition.md.

ensemble is a genuine related prime—the posterior is carried by multiple comparable realizations—but is not proposed as a fourth direct parent because the particle population's ensemble role is already explained inside the Monte Carlo parent and a direct edge would add little discriminating structure. approximation is also inherited transitively through monte_carlo_simulation. Neither nonparametric_methods nor its recognized “resampling methods” surface is a suitable parent: particle-filter resampling is a population-renewal operator inside sequential importance sampling, not the bootstrap/permutation/rank-method family that the live entry denotes.

Relationships to Other Abstractions¶

Current abstraction Particle Filter Domain-specific

Parents (3) — more general patterns this builds on

Particle Filter is a kind of Monte Carlo Simulation Prime

monte_carlo_simulation (confirmed; primary parent). A particle filter is a kind of Monte Carlo simulation: it replaces an analytically difficult probability distribution with estimates computed from random samples.
Particle Filter is part of Bayesian Updating Prime

bayesian_updating (confirmed; constitutive relation). The observation-weighting step implements repeated Bayesian correction: the predicted distribution supplies the prior for time \(t\), the observation model supplies the likelihood.
Particle Filter presupposes State and State Transition Prime

state_and_state_transition (confirmed; prerequisite relation). Particle filtering presupposes a state representation and a transition rule that propagates it.

Hierarchy paths (10) — routes to 6 parentless roots

Particle Filter → Monte Carlo Simulation → Approximation → Representation → Abstraction

Show alternative paths (9)

Neighborhood in Abstraction Space¶

Particle Filter sits in a sparse region of the domain-specific corpus (65^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

Sequential Monte Carlo (SMC) broadly. SMC is the wider class of weighted-particle methods for sequences of target distributions, including artificial tempering paths and static Bayesian computation. Particle filtering is the state-estimation/filtering branch. Tell: does the target specifically recurse as a hidden-state distribution conditioned on observations through time, or is “time” merely an index through arbitrary target distributions?
Bootstrap / SIR particle filter. This foundational variant typically proposes from the transition prior and resamples from likelihood-adjusted weights. General particle filters admit other proposals and schedules. Tell: is the transition prior itself the proposal with the bootstrap update, or is another proposal/auxiliary construction carrying the family identity?
Bayesian filtering. Filtering is the inference problem—compute the current hidden-state distribution from observations so far. Particle filtering is one approximate solver. Tell: are you naming the target recursion, or the weighted-sample algorithm used to approximate it?
Kalman, extended Kalman, and unscented Kalman filters. These propagate compact parametric summaries, characteristically a mean and covariance with linear-Gaussian exactness or nonlinear approximations. A particle filter propagates a weighted empirical measure and can retain multimodality. Tell: is posterior shape restricted to a Gaussian-style summary, or represented by discrete weighted support?
Importance sampling. Importance sampling estimates a target using weighted draws from a proposal; it need not be recursive and does not itself renew a particle ancestry across observations. It is a constituent of particle filtering, not the whole loop. Tell: is there one target and one weighting pass, or a sequence whose output population becomes the next input?
Resampling schemes. Multinomial, residual, stratified, and systematic resampling specify how weighted ancestors are copied. They are operators within the filter and can change variance without changing the target identity. Tell: is the object a full posterior recursion, or only the population-renewal rule?
State-space modeling. A state-space model says how hidden state evolves and observations arise. It does not choose a particle representation or inference algorithm. Tell: are particles, weights, proposals, and a renewal policy specified, or only transition and observation equations?
Markov chain Monte Carlo. MCMC constructs a correlated chain with a stationary target, usually for batch inference; a particle filter maintains an interacting population against a changing target. Hybrid particle MCMC methods deliberately combine the two. Tell: is correctness tied to stationarity of one Markov chain, or to sequential importance weights and resampling over a population?
Ensemble Kalman filtering. Both maintain ensembles, but the ensemble Kalman update uses covariance-based, effectively Gaussian linear correction rather than likelihood-weighted selection/resampling. Tell: does the analysis step linearly transform an ensemble using estimated covariance, or reweight and renew particles against the observation likelihood?

References¶

[1] Arulampalam, M. Sanjeev, Simon Maskell, Neil Gordon, and Tim Clapp. "A Tutorial on Particle Filters for Online Nonlinear/Non-Gaussian Bayesian Tracking". IEEE Transactions on Signal Processing 50, no. 2 (2002): 174–188. Defines particle filters as sequential Monte Carlo point-mass representations, develops SIS/SIR and variants, and analyzes degeneracy and resampling. registry ↩

[2] Doucet, Arnaud, Simon Godsill, and Christophe Andrieu. "On Sequential Monte Carlo Sampling Methods for Bayesian Filtering". Statistics and Computing 10 (2000): 197–208. Gives a general importance-sampling framework for sequential posterior simulation and relates proposals, filtering, smoothing, and Rao–Blackwellization. registry ↩a ↩b ↩c ↩d

[3] Gordon, Neil J., David J. Salmond, and Adrian F. M. Smith. "Novel Approach to Nonlinear/Non-Gaussian Bayesian State Estimation". IEE Proceedings F—Radar and Signal Processing 140, no. 2 (1993): 107–113. Introduces the bootstrap filter as a random-sample implementation of recursive Bayesian filtering and demonstrates nonlinear bearings-only tracking. registry ↩a ↩b ↩c ↩d ↩e ↩f

[4] Douc, Randal, Olivier Cappé, and Éric Moulines. "Comparison of Resampling Schemes for Particle Filtering". In Proceedings of the 4^th International Symposium on Image and Signal Processing and Analysis (2005): 64–69. Compares multinomial, residual, stratified, and systematic resampling and their variance properties. registry ↩

[5] Del Moral, Pierre, Arnaud Doucet, and Ajay Jasra. "Sequential Monte Carlo Samplers". Journal of the Royal Statistical Society: Series B 68, no. 3 (2006): 411–436. Extends SMC to general sequences of probability distributions, establishing why bare SMC is broader than hidden-state particle filtering. registry ↩

[6] Kitagawa, Genshiro. "Monte Carlo Filter and Smoother for Non-Gaussian Nonlinear State Space Models". Journal of Computational and Graphical Statistics 5, no. 1 (1996): 1–25. Develops sample-based prediction, filtering, and smoothing for nonlinear, non-Gaussian state-space models. registry ↩a ↩b

[7] Fox, Dieter, Wolfram Burgard, Frank Dellaert, and Sebastian Thrun. "Monte Carlo Localization: Efficient Position Estimation for Mobile Robots". Proceedings of the AAAI Conference on Artificial Intelligence 16 (1999): 343–349. Applies a particle representation to online robot-pose estimation and reports adaptive sampling and empirical efficiency. registry ↩a ↩b

[8] Isard, Michael, and Andrew Blake. "CONDENSATION—Conditional Density Propagation for Visual Tracking". International Journal of Computer Vision 29 (1998): 5–28. Applies sequential sample propagation and observation reinforcement to multimodal visual tracking in clutter. registry ↩

[9] Liu, Jun S., and Rong Chen. "Sequential Monte Carlo Methods for Dynamic Systems". Journal of the American Statistical Association 93, no. 443 (1998): 1032–1044. Unifies dynamic-system Monte Carlo procedures through importance sampling, resampling, rejection sampling, and Markov-chain moves, with engineering and econometric examples. registry ↩a ↩b

[10] Snyder, Chris, Thomas Bengtsson, Peter Bickel, and Jeff Anderson. "Obstacles to High-Dimensional Particle Filtering". Monthly Weather Review 136, no. 12 (2008): 4629–4640. Analyzes weight collapse and the rapid growth of ensemble-size requirements in high-dimensional data-assimilation settings. registry ↩a ↩b