<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">

Publication:
Competitive randomized nonlinear prediction under additive noise

Loading...
Thumbnail Image

School / College / Institute

Item type:Organizational Unit,
Item type:Organizational Unit,

Program

Organization Authors

Co-Authors

Date

Language

Embargo Status

N/A

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

We consider sequential nonlinear prediction of a bounded, real-valued and deterministic signal from its noise-corrupted past samples in a competitive algorithm framework. We introduce a randomized algorithm based on context-trees [1]. The introduced algorithm asymptotically achieves the performance of the best piecewise affine model that can both select the best partition of the past observations space (from a doubly exponential number of possible partitions) and the affine model parameters based on the desired clean signal in hindsight. Although the performance measure including the loss function is defined with respect to the noise-free clean signal, the clean signal, its past samples or prediction errors are not available for training or constructing predictions. We demonstrate the performance of the introduced algorithm when applied to certain chaotic signals.

Source

Publisher

IEEE-Inst Electrical Electronics Engineers Inc

Citation

item.page.haspartof

Source

IEEE Signal Processing Letters

item.page.ispartofseries

item.page.edition

DOI

10.1109/LSP.2009.2039950

item.page.datauri

item.page.link

Rights

N/A

Copyrights Note

Rights and licensing

N/A

Endorsement

Review

Supplemented By

Referenced By

Related Patent

Related Goal

Google Scholar
Scholar'da Ara ↗
Altmetric
Dimensions
PlumX Metrikleri
BIP! Indicators