Publication:
Steady state MSE analysis of convexly constrained mixture methods

Placeholder

School / College / Institute

Organizational Unit

Program

KU Authors

Co-Authors

N/A

Publication Date

Language

Embargo Status

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

We study the steady-state performances of four convexly constrained mixture algorithms that adaptively combine outputs of two adaptive filters running in parallel to model an unknown system. We demonstrate that these algorithms are universal such that they achieve the performance of the best constituent filter in the steady-state if certain algorithmic parameters are chosen properly. We also demonstrate that certain mixtures converge to the optimal convex combination filter such that their steady-state performances can be better than the best constituent filter. Furthermore, we show that the investigated convexly constrained algorithms update certain auxiliary variables through sigmoid nonlinearity, hence, in this sense, related.

Source

Publisher

IEEE

Subject

Engineering, Electrical and electronics engineering

Citation

Has Part

Source

2012 3rd International Workshop on Cognitive Information Processing, CIP 2012

Book Series Title

Edition

DOI

10.1109/CIP.2012.6232896

item.page.datauri

Link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

0

Views

0

Downloads

View PlumX Details