Progressive Bayesian Particle Flows based on Optimal Transport Map Sequences

• URL: http://arxiv.org/abs/2303.02412v1
• Date: Sat, 4 Mar 2023 13:12:43 GMT
• Title: Progressive Bayesian Particle Flows based on Optimal Transport Map Sequences
• Authors: Uwe D. Hanebeck
• Abstract summary: 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.
• Score: 4.56877715768796
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a method for optimal Bayesian filtering with deterministic particles. In order to avoid particle degeneration, the filter step is not performed at once. Instead, the particles progressively flow from prior to posterior. This is achieved by splitting the filter step into a series of sub-steps. In each sub-step, optimal resampling is done by a map that replaces non-equally weighted particles with equally weighted ones. Inversions of the maps or monotonicity constraints are not required, greatly simplifying the procedure. The parameters of the mapping network are optimized w.r.t.\ to a particle set distance. This distance is differentiable, and compares non-equally and equally weighted particles. Composition of the map sequence provides a final mapping from prior to posterior particles. Radial basis function neural networks are used as maps. It is important that no intermediate continuous density representation is required. The entire flow works directly with particle representations. This avoids costly density estimation.

Related papers

• Newton-Flow Particle Filters based on Generalized Cramér Distance [0.7614628596146598]
  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.
  arXiv  Detail & Related papers  (2025-08-29T18:30:54Z)
• Ensemble Transport Filter via Optimized Maximum Mean Discrepancy [0.0]
  We present a new ensemble-based filter method by reconstructing the analysis step of the particle filter through a transport map. The transport map is constructed through an optimization problem described by the Maximum Mean Discrepancy loss function. A few numerical examples are presented to illustrate the advantage of the proposed method over the ensemble Kalman filter.
  arXiv  Detail & Related papers  (2024-07-16T08:54:12Z)
• 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)
• Sobolev Space Regularised Pre Density Models [51.558848491038916]
  We propose a new approach to non-parametric density estimation that is based on regularizing a Sobolev norm of the density. This method is statistically consistent, and makes the inductive validation model clear and consistent.
  arXiv  Detail & Related papers  (2023-07-25T18:47:53Z)
• 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)
• Near-optimal estimation of smooth transport maps with kernel sums-of-squares [81.02564078640275]
  Under smoothness conditions, the squared Wasserstein distance between two distributions could be efficiently computed with appealing statistical error upper bounds. The object of interest for applications such as generative modeling is the underlying optimal transport map. We propose the first tractable algorithm for which the statistical $L2$ error on the maps nearly matches the existing minimax lower-bounds for smooth map estimation.
  arXiv  Detail & Related papers  (2021-12-03T13:45:36Z)
• Deep Convolutional Correlation Iterative Particle Filter for Visual Tracking [1.1531505895603305]
  This work proposes a novel framework for visual tracking based on the integration of an iterative particle filter, a deep convolutional neural network, and a correlation filter. We employ a novel strategy to assess the likelihood of the particles after the iterations by applying K-means clustering. Experimental results on two different benchmark datasets show that our tracker performs favorably against state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-07-07T02:44:43Z)
• 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.