pith. sign in

arxiv: 1811.05090 · v1 · pith:4FXYGDHCnew · submitted 2018-11-13 · 📊 stat.ML · cs.LG

A General Method for Amortizing Variational Filtering

classification 📊 stat.ML cs.LG
keywords filteringvariationalalgorithminferencemethodamortizeddynamicalgeneral-purpose
0
0 comments X
read the original abstract

We introduce the variational filtering EM algorithm, a simple, general-purpose method for performing variational inference in dynamical latent variable models using information from only past and present variables, i.e. filtering. The algorithm is derived from the variational objective in the filtering setting and consists of an optimization procedure at each time step. By performing each inference optimization procedure with an iterative amortized inference model, we obtain a computationally efficient implementation of the algorithm, which we call amortized variational filtering. We present experiments demonstrating that this general-purpose method improves performance across several deep dynamical latent variable models.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Resampling in conditional SMC algorithms

    stat.CO 2026-06 unverdicted novelty 7.0

    A general framework for valid resampling in SMC and CSMC that handles most known schemes, including exotic ones, under only weak assumptions and without random permutation of ancestor indices.