Universal MMSE Filtering With Logarithmic Adaptive Regret

Details Universal MMSE Filtering With Logarithmic Adaptive Regret Universal MMSE Filtering With Logarithmic Adaptive Regret

2011-11-04

arxiv.org/abs/1111.1136v2

Computer Science

Learning

14 pages

Scientific paper

We consider the problem of online estimation of a real-valued signal corrupted by oblivious zero-mean noise using linear estimators. The estimator is required to iteratively predict the underlying signal based on the current and several last noisy observations, and its performance is measured by the mean-square-error. We describe and analyze an algorithm for this task which: 1. Achieves logarithmic adaptive regret against the best linear filter in hindsight. This bound is assyptotically tight, and resolves the question of Moon and Weissman [1]. 2. Runs in linear time in terms of the number of filter coefficients. Previous constructions required at least quadratic time.

Affiliated with

Also associated with

No associations

Rating

Universal MMSE Filtering With Logarithmic Adaptive Regret does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Universal MMSE Filtering With Logarithmic Adaptive Regret, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal MMSE Filtering With Logarithmic Adaptive Regret will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-101097