Adaptive Variational Particle Filtering in Non-stationary Environments

07/19/2018
by   Mahdi Azarafrooz, et al.
0

Online convex optimization is a sequential prediction framework with the goal to track and adapt to the environment through evaluating proper convex loss functions. We study efficient particle filtering methods from the perspective of such a framework. We formulate an efficient particle filtering methods for the non-stationary environment by making connections with the online mirror descent algorithm which is known to be a universal online convex optimization algorithm. As a result of this connection, our proposed particle filtering algorithm proves to achieve optimal particle efficiency.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/29/2019

Bandit Convex Optimization in Non-stationary Environments

Bandit Convex Optimization (BCO) is a fundamental framework for modeling...
research
05/15/2019

Adaptivity and Optimality: A Universal Algorithm for Online Convex Optimization

In this paper, we study adaptive online convex optimization, and aim to ...
research
02/01/2021

Stochastic Online Convex Optimization; Application to probabilistic time series forecasting

Stochastic regret bounds for online algorithms are usually derived from ...
research
05/03/2021

Homotopy Sampling, with an Application to Particle Filters

We propose a homotopy sampling procedure, loosely based on importance sa...
research
07/20/2013

Non-stationary Stochastic Optimization

We consider a non-stationary variant of a sequential stochastic optimiza...
research
05/15/2019

Predictive Online Convex Optimization

We incorporate future information in the form of the estimated value of ...
research
06/10/2020

When is Particle Filtering Efficient for POMDP Sequential Planning?

Particle filtering is a popular method for inferring latent states in st...

Please sign up or login with your details

Forgot password? Click here to reset