Nonlinear Filtering in High Dimension

نویسنده

  • Patrick Rebeschini
چکیده

The goal of filtering theory is to compute the filter distribution, that is, the conditional distribution of a stochastic model given observed data. While exact computations are rarely possible, sequential Monte Carlo algorithms known as particle filters have been successfully applied to approximate the filter distribution, providing estimates whose error is uniform in time. However, the number of Monte Carlo samples needed to approximate the filter distribution is typically exponential in the number of degrees of freedom of the model. This issue, known as curse of dimensionality, has rendered sequential Monte Carlo algorithms largely useless in high-dimensional applications such as multi-target tracking, weather prediction, and oceanography. While over the past twenty years many heuristics have been suggested to run particle filters in high dimension, no principled approach has ever been proposed to address the core of the problem. In this thesis we develop a novel framework to investigate high-dimensional filtering models and to design algorithms that can avoid the curse of dimensionality. Using concepts and tools from statistical mechanics, we show that the decay of correlations property of high-dimensional models can be exploited by implementing localization procedures on ordinary particle filters that can lead to estimates whose approximation error is uniform both in time and in the model dimension. Ergodic and spatial mixing properties of conditional distributions play a crucial role in the design of filtering algorithms, and they are of independent interest in probability theory. To better capture ergodicity quantitatively, we develop new comparison theorems to establish dimension-free bounds on high-dimensional probability measures in terms of their local conditional distributions. At a qualitative level, we investigate previously unknown phenomena that can only arise from conditioning in infinite dimension. In particular, we exhibit the first known example of a model where ergodicity of the filter undergoes a phase transition in the signal-to-noise ratio.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On-Line Nonlinear Dynamic Data Reconciliation Using Extended Kalman Filtering: Application to a Distillation Column and a CSTR

Extended Kalman Filtering (EKF) is a nonlinear dynamic data reconciliation (NDDR) method. One of its main advantages is its suitability for on-line applications. This paper presents an on-line NDDR method using EKF. It is implemented for two case studies, temperature measurements of a distillation column and concentration measurements of a CSTR. In each time step, random numbers with zero m...

متن کامل

Can Local Particle Filters Beat the Curse of Dimensionality?∗ by Patrick Rebeschini

The discovery of particle filtering methods has enabled the use of nonlinear filtering in a wide array of applications. Unfortunately, the approximation error of particle filters typically grows exponentially in the dimension of the underlying model. This phenomenon has rendered particle filters of limited use in complex data assimilation problems. In this paper, we argue that it is often possi...

متن کامل

Can Local Particle Filters Beat the Curse of Dimensionality ?

The discovery of particle filtering methods has enabled the use of nonlinear filtering in a wide array of applications. Unfortunately, the approximation error of particle filters typically grows exponentially in the dimension of the underlying model. This phenomenon has rendered particle filters of limited use in complex data assimilation problems. In this paper, we argue that it is often possi...

متن کامل

Effect of Rating Time for Cold Start Problem in Collaborative Filtering

Cold start is one of the main challenges in recommender systems. Solving sparsechallenge of cold start users is hard. More cold start users and items are new. Sine many general methods for recommender systems has over fittingon cold start users and items, so recommendation to new users and items is important and hard duty. In this work to overcome sparse problem, we present a new method for rec...

متن کامل

Markov Chain Monte Carlo Particle Algorithms for Discrete-Time Nonlinear Filtering

This work shows how a carefully designed instrumental distribution can improve the performance of a Markov chain Monte Carlo (MCMC) particle filter for systems with a high state dimension (up to 100). We devise a special subgradient-based kernel from which candidate moves are drawn. This facilitates the implementation of the filtering algorithm in high dimensional settings using a remarkably sm...

متن کامل

An assessment of a semi analytical AG method for solving two-dimension nonlinear viscous flow

In this investigation, attempts have been made to solve two-dimension nonlinear viscous flow between slowly expanding or contracting walls with weak permeability by utilizing a semi analytical Akbari Ganji's Method (AGM). As regard to previous papers, solving of nonlinear equations is difficult and the results are not accurate. This new approach is emerged after comparing the achieved solutions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014