aiqbench analysis
This paper introduces Differentiable Systematic Resampling (DSR), a novel method that enables gradient-based learning within particle filters by relaxing the discrete resampling step while preserving its structural properties. By avoiding iterative solvers typically required in optimal-transport approaches, DSR offers lower computational overhead for variational sequential Monte Carlo tasks involving stochastic dynamical systems and handwriting data. The work represents a significant advancement in making nonlinear state estimation compatible with end-to-end deep learning frameworks.
Differentiable Systematic Resampling for Variational Sequential Monte Carlo
arXiv:2610.12094v1 Announce Type: cross Abstract: Particle filters are a standard tool for nonlinear state estimation, but their resampling step is discrete, preventing gradient-based learning in variational sequential Monte Carlo. We introduce Differentiable Systematic Resampling (DSR), a temperature-controlled relaxation of systematic resampling, that preserves the CDF-ordered, banded structure of systematic resampling while enabling full gradient flow. DSR converges to exact systematic resampling as the temperature vanishes, and we prove a pointwise exponential convergence rate for the induced bias. Compared to optimal-transport-based differentiable resampling, DSR avoids iterative solvers and has substantially lower computational overhead. Experiments on stochastic dynamical systems and real-world handwriting data show that DSR achieves comparable or superior filtering and dynamics learning performance.
Abstract:Particle filters are a standard tool for nonlinear state estimation, but their resampling step is discrete, preventing gradient-based learning in variational sequential Monte Carlo. We introduce Differentiable Systematic Resampling (DSR), a temperature-controlled relaxation of systematic resampling, that preserves the CDF-ordered, banded structure of systematic resampling while enabling full gradient flow. DSR converges to exact systematic resampling as the temperature vanishes, and we prove a pointwise exponential convergence rate for the induced bias. Compared to optimal-transport-based differentiable resampling, DSR avoids iterative solvers and has substantially lower computational overhead. Experiments on stochastic dynamical systems and real-world handwriting data show that DSR achieves comparable or superior filtering and dynamics learning performance.
Machine Learning (stat.ML); Machine Learning (cs.LG); Signal Processing (eess.SP)
arXiv:2610.12094 [stat.ML]
(or arXiv:2610.12094v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2610.12094 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 208 words
Related coverage
Numerical simulation of D-Wave's quantum advantage experiment with time-dependent variational Monte Carlo
arXiv · Sep 3, 2026

Universal Dilation of Linear Itô SDEs: Quantum Trajectories and Lindblad Simulation of Second Moments
Quantum Journal · Oct 1, 2026

Purdue Researchers Build Quantum Circuits for Numerical Integration
Quantum Zeitgeist · Jul 23, 2026

Quantum algorithms cut Monte Carlo sampling in simulations
Quantum Zeitgeist · Oct 1, 2026