On almost-sure bounds for the LMS algorithm

DOI10.1109/18.312160zbMATH Open0825.93862OpenAlexW2120366228MaRDI QIDQ4308772FDOQ4308772

Authors: 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) Linear systems in control theory (93C05) Adaptive control/observation systems (93C40)

Cited In (1)

• Convergence rates and decoupling in linear stochastic approximation algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4308772)