Variational Marginal Particle Filters

• URL: http://arxiv.org/abs/2109.15134v1
• Date: Thu, 30 Sep 2021 13:55:16 GMT
• Title: Variational Marginal Particle Filters
• Authors: Jinlin Lai, Daniel Sheldon, Justin Domke
• Abstract summary: Variational inference for state space models (SSMs) is known to be hard in general. Recent works focus on deriving variational objectives for SSMs from unbiased sequential Monte Carlo estimators. We propose the variational marginal particle filter (VMPF)
• Score: 38.94802937100392
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Variational inference for state space models (SSMs) is known to be hard in general. Recent works focus on deriving variational objectives for SSMs from unbiased sequential Monte Carlo estimators. We reveal that the marginal particle filter is obtained from sequential Monte Carlo by applying Rao-Blackwellization operations, which sacrifices the trajectory information for reduced variance and differentiability. We propose the variational marginal particle filter (VMPF), which is a differentiable and reparameterizable variational filtering objective for SSMs based on an unbiased estimator. We find that VMPF with biased gradients gives tighter bounds than previous objectives, and the unbiased reparameterization gradients are sometimes beneficial.

Related papers

• Sequential Monte Carlo for Inclusive KL Minimization in Amortized Variational Inference [3.126959812401426]
  We propose SMC-Wake, a procedure for fitting an amortized variational approximation that uses sequential Monte Carlo samplers to estimate the gradient of the inclusive KL divergence. In experiments with both simulated and real datasets, SMC-Wake fits variational distributions that approximate the posterior more accurately than existing methods.
  arXiv  Detail & Related papers  (2024-03-15T18:13:48Z)
• Closed-form Filtering for Non-linear Systems [83.91296397912218]
  We propose a new class of filters based on Gaussian PSD Models, which offer several advantages in terms of density approximation and computational efficiency. We show that filtering can be efficiently performed in closed form when transitions and observations are Gaussian PSD Models. Our proposed estimator enjoys strong theoretical guarantees, with estimation error that depends on the quality of the approximation and is adaptive to the regularity of the transition probabilities.
  arXiv  Detail & Related papers  (2024-02-15T08:51:49Z)
• Model-Based Reparameterization Policy Gradient Methods: Theory and Practical Algorithms [88.74308282658133]
  Reization (RP) Policy Gradient Methods (PGMs) have been widely adopted for continuous control tasks in robotics and computer graphics. Recent studies have revealed that, when applied to long-term reinforcement learning problems, model-based RP PGMs may experience chaotic and non-smooth optimization landscapes. We propose a spectral normalization method to mitigate the exploding variance issue caused by long model unrolls.
  arXiv  Detail & Related papers  (2023-10-30T18:43:21Z)
• Nonlinear Filtering with Brenier Optimal Transport Maps [4.745059103971596]
  This paper is concerned with the problem of nonlinear filtering, i.e., computing the conditional distribution of the state of a dynamical system. Conventional sequential importance resampling (SIR) particle filters suffer from fundamental limitations, in scenarios involving degenerate likelihoods or high-dimensional states. In this paper, we explore an alternative method, which is based on estimating the Brenier optimal transport (OT) map from the current prior distribution of the state to the posterior distribution at the next time step.
  arXiv  Detail & Related papers  (2023-10-21T01:34:30Z)
• 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)
• Efficient CDF Approximations for Normalizing Flows [64.60846767084877]
  We build upon the diffeomorphic properties of normalizing flows to estimate the cumulative distribution function (CDF) over a closed region. Our experiments on popular flow architectures and UCI datasets show a marked improvement in sample efficiency as compared to traditional estimators.
  arXiv  Detail & Related papers  (2022-02-23T06:11:49Z)
• Efficient Learning of the Parameters of Non-Linear Models using Differentiable Resampling in Particle Filters [1.9499120576896227]
  It has been widely documented that the sampling and resampling steps in particle filters be differentiated. We consider two state-space models and show that NUTS improves the mixing of the Markov chain and can produce more accurate results in less computational time.
  arXiv  Detail & Related papers  (2021-11-02T08:03:09Z)
• 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 Rejection Particle Filtering [28.03831528555717]
  Variational Rejection Particle Filtering (VRPF) leads to novel variational bounds on the marginal likelihood. We present theoretical properties of the variational bound and demonstrate experiments on various models of sequential data.
  arXiv  Detail & Related papers  (2021-03-29T05:29:58Z)
• 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)

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.