How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Fixed-horizon particle backward smoothing is consistent under stated conditions
Statement
Assume AC and a finite-horizon state-space model with compact metric state spaces , dominated observation kernels, and an observation history in the full-measure finite-positive set where Bayes factorization of the smoothing backward kernel applies. Let be the specified product-measurable observation density relative to its sigma-finite observation measure, as in Exact state-space filtering recursion under dominated observations, and set for and . Suppose each is continuous and there are constants such that for every state and time. For each , let be the state transition from time to time and suppose it has a jointly continuous density relative to a Borel probability measure , meaning for measurable , with uniform bounds for all . Write for the exact filtering-kernel value at and for the exact smoothing-kernel value at . Use the model initial law as the initial proposal, these same as transition proposals, and these as potentials in the multinomial bootstrap particle filter. With particles, independently draw backward paths conditional on the resulting clouds, where as . Let be the conditional law of one backward-simulated path given the clouds. For every continuous , For a fixed number of simulated paths, their conditional path law is consistent but the empirical path average retains its Monte Carlo error. No time-uniform-in- convergence claim is made.
Facts & Assumptions
Given: The assumptions above, fixed observations with finite positive evidence, and a bounded continuous test function on the compact path space.
AC is used through the finite-horizon Feynman–Kac and conditional smoothing-law constructions. The Axiom of Choice
The filtering empirical measures converge weakly in probability under the bounded positive-potential, Feller, multinomial bootstrap assumptions. Finite-horizon bootstrap particle filters are weakly consistent
The exact smoother factors into its terminal filtering law and the exact backward conditional kernels. Bayes factorization of the smoothing backward kernel
Given filtering particles, the particle backward kernel weights each candidate state by its filter weight times the transition density and normalizes by the predictive density. Particle backward simulator
Weak convergence tests against bounded continuous functions. Weak convergence of borel probability measures
The nonnegative integral inequality bounds probabilities of squared deviations. Chebyshev-Markov inequality for the integral
The observation-density recursion identifies each filtering kernel with the normalized Feynman–Kac update using on finite-positive evidence histories. Exact state-space filtering recursion under dominated observations
Proof
Given: The hypotheses in the Statement.
For each , let be bounded continuous and let . Uniform continuity of on the compact product gives . Since is a probability measure, Thus each transition is Feller.
By [F1] and [F6], for every the random filtering measure converges weakly in probability to the exact filtering law at the fixed observation history. For each , put and . The density bounds imply for every , so every backward denominator used by the algorithm is finite positive.
Fix and a continuous on . The families and indexed by are uniformly bounded and equicontinuous: joint continuity on the compact product is uniformly continuous. For any , a finite -net of the compact parameter space gives a finite sup-norm net for each family. Weak convergence in probability from step 2.1 gives convergence of the integrals for every function in each finite net; since all measures have mass one, replacing a family member by a net function changes either integral by at most . Letting proves uniform-in- convergence of both numerators and denominators. Division is stable because all denominators are at least , so in probability for the empirical and exact backward kernels. The exact function is continuous by dominated convergence.
For each , set , which tends to zero by uniform continuity. The exact and empirical backward kernels have densities relative to and relative to , respectively. Using [F2]–[F3], from step 2.1, and that both filtering measures have mass one, their total-variation distance at is at most . Indeed, if is a continuous integrand indexed by remaining coordinates , and denotes the next-state coordinate in , then the difference of its integrals at is bounded by ; uniform continuity of and the displayed kernel bound make this tend uniformly to zero as . Thus each backward integration preserves a common bound and modulus of equicontinuity over the remaining compact coordinates, uniformly over all particle clouds. Since is finite, iterating this estimate yields one such class for every section in the finite telescoping sum.
Telescope the finite backward product by replacing one empirical kernel at a time with its exact counterpart. The uniform moduli from step 3.2 put every possible section, over all clouds and remaining coordinates, in a uniformly bounded equicontinuous class on a compact metric space. Such a class has a finite sup-norm net: choose a finite -net of the domain at a scale given by equicontinuity, quantize the bounded function values on those finitely many points, and retain one representative for each nonempty quantized pattern. Step 3.1 gives convergence for each fixed test in this finite net; since kernels are probabilities, the sup-norm approximation changes an integral difference by at most twice the net radius. The same finite-net argument and [F1] give convergence of the terminal empirical integrals uniformly over the resulting class. Thus every term in the finite telescoping sum tends to zero in probability, and the conditional path law converges weakly in the sense of [F4] to the exact product law in [F2].
Conditional on the particle clouds, the backward paths are IID with law . Their conditional sample mean has variance at most . Applying [F5] to its squared centered deviation shows that its difference from converges to zero in probability because . Combining this with step 4.1 proves the second limit. If is fixed, this variance bound need not vanish, so no convergence of the path average is asserted.
Depends on
- The Axiom of Choice
- Bayes factorization of the smoothing backward kernel
- Particle backward simulator
- Finite-horizon bootstrap particle filters are weakly consistent
- Exact state-space filtering recursion under dominated observations
- Weak convergence of borel probability measures
- Chebyshev-Markov inequality for the integral
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
36 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Simo Särkkä, Bayesian Filtering and Smoothing, Chapter 11, §11.2 (standard reference, not scraped)
- Arnaud Doucet and Adam M. Johansen, A Tutorial on Particle Filtering and Smoothing: Fifteen Years Later, §5.2 (standard reference, not scraped)
- Fredrik Lindsten, Pete Bunch, Simo Särkkä, Thomas B. Schön, and Simon J. Godsill, Rao-Blackwellized particle smoothers for conditionally linear Gaussian models, §3.1 (standard reference, not scraped)