On almost-sure bounds for the LMS algorithm

DOI10.1109/18.312160zbMath0825.93862OpenAlexW2120366228MaRDI QIDQ4308772

Michael A. Kouritzin

Publication date: 4 December 1994

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f9a2e5ae1f3a839d54576c96bd17944134ae964c

Mathematics Subject Classification ID

Filtering in stochastic control theory (93E11) Adaptive control/observation systems (93C40) Linear systems in control theory (93C05)

Related Items (1)

Convergence Rates and Decoupling in Linear Stochastic Approximation Algorithms

This page was built for publication: On almost-sure bounds for the LMS algorithm