Newton-Flow Particle Filters based on Generalized Cramér Distance

• URL: http://arxiv.org/abs/2509.00182v1
• Date: Fri, 29 Aug 2025 18:30:54 GMT
• Title: Newton-Flow Particle Filters based on Generalized Cramér Distance
• Authors: Uwe D. Hanebeck,
• Abstract summary: Filter is surprisingly simple to implement and very efficient.<n>It just requires a prior particle set and a likelihood function, never estimates densities from samples, and can be used as a plugin replacement for classic approaches.
• Score: 0.7614628596146598
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a recursive particle filter for high-dimensional problems that inherently never degenerates. The state estimate is represented by deterministic low-discrepancy particle sets. We focus on the measurement update step, where a likelihood function is used for representing the measurement and its uncertainty. This likelihood is progressively introduced into the filtering procedure by homotopy continuation over an artificial time. A generalized Cram\'er distance between particle sets is derived in closed form that is differentiable and invariant to particle order. A Newton flow then continually minimizes this distance over artificial time and thus smoothly moves particles from prior to posterior density. The new filter is surprisingly simple to implement and very efficient. It just requires a prior particle set and a likelihood function, never estimates densities from samples, and can be used as a plugin replacement for classic approaches.

Related papers

• Beyond Propagation of Chaos: A Stochastic Algorithm for Mean Field Optimization [5.656933370626669]
  Gradient flow in the 2-Wasserstein space is widely used to optimize functionals over probability distributions.<n>We show that our algorithm's output converges to the optimal distribution under conditions similar to those for the infinite particle limit.
  arXiv  Detail & Related papers  (2025-03-17T12:37:53Z)
• StraightPCF: Straight Point Cloud Filtering [50.66412286723848]
  Point cloud filtering is a fundamental 3D vision task, which aims to remove noise while recovering the underlying clean surfaces. We introduce StraightPCF, a new deep learning based method for point cloud filtering. It works by moving noisy points along straight paths, thus reducing discretization errors while ensuring faster convergence to the clean surfaces.
  arXiv  Detail & Related papers  (2024-05-14T05:41:59Z)
• Progressive Bayesian Particle Flows based on Optimal Transport Map Sequences [4.56877715768796]
  We propose a method for optimal Bayesian filtering with deterministic particles. The filter step is not performed at once. Instead, the particles progressively flow from prior to posterior. In each sub-step, optimal resampling is done by a map that replaces non-equally weighted particles with equally weighted ones.
  arXiv  Detail & Related papers  (2023-03-04T13:12:43Z)
• PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium [58.26573117273626]
  We consider the non-AL equilibrium nonconptotic objective function in two-player zero-sum continuous games. Our novel insights into the particle-based algorithms for continuous distribution strategies are presented.
  arXiv  Detail & Related papers  (2023-03-02T05:08:15Z)
• Particle-Based Score Estimation for State Space Model Learning in Autonomous Driving [62.053071723903834]
  Multi-object state estimation is a fundamental problem for robotic applications. We consider learning maximum-likelihood parameters using particle methods. We apply our method to real data collected from autonomous vehicles.
  arXiv  Detail & Related papers  (2022-12-14T01:21:05Z)
• Sampling with Mollified Interaction Energy Descent [57.00583139477843]
  We present a new optimization-based method for sampling called mollified interaction energy descent (MIED) MIED minimizes a new class of energies on probability measures called mollified interaction energies (MIEs) We show experimentally that for unconstrained sampling problems our algorithm performs on par with existing particle-based algorithms like SVGD.
  arXiv  Detail & Related papers  (2022-10-24T16:54:18Z)
• Continuous-time Particle Filtering for Latent Stochastic Differential Equations [37.51802583388233]
  We propose continuous latent particle filters, an approach that extends particle filtering to the continuous-time domain. We demonstrate how continuous latent particle filters can be used as a generic plug-in replacement for inference techniques relying on a learned variational posterior.
  arXiv  Detail & Related papers  (2022-09-01T01:05:31Z)
• Computational Doob's h-transforms for Online Filtering of Discretely Observed Diffusions [65.74069050283998]
  We propose a computational framework to approximate Doob's $h$-transforms. The proposed approach can be orders of magnitude more efficient than state-of-the-art particle filters.
  arXiv  Detail & Related papers  (2022-06-07T15:03:05Z)
• Differentiable Particle Filtering without Modifying the Forward Pass [21.430102374292666]
  We show how to obtain unbiased estimators of the gradient of the marginal likelihood by only modifying messages used in backpropagation. We call it stop-gradient resampling, since it can easily be implemented with automatic differentiation libraries.
  arXiv  Detail & Related papers  (2021-06-18T18:58:52Z)
• Variational Transport: A Convergent Particle-BasedAlgorithm for Distributional Optimization [106.70006655990176]
  A distributional optimization problem arises widely in machine learning and statistics. We propose a novel particle-based algorithm, dubbed as variational transport, which approximately performs Wasserstein gradient descent. We prove that when the objective function satisfies a functional version of the Polyak-Lojasiewicz (PL) (Polyak, 1963) and smoothness conditions, variational transport converges linearly.
  arXiv  Detail & Related papers  (2020-12-21T18:33:13Z)
• When is Particle Filtering Efficient for Planning in Partially Observed Linear Dynamical Systems? [60.703816720093016]
  This paper initiates a study on the efficiency of particle filtering for sequential planning. We are able to bound the number of particles needed so that the long-run reward of the policy based on particle filtering is close to that based on exact inference. We believe this technique can be useful in other sequential decision-making problems.
  arXiv  Detail & Related papers  (2020-06-10T17:43:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.