On the Almost Sure Rate of Convergence of Linear Stochastic Approximation Algorithms
From MaRDI portal
Publication:3547687
DOI10.1109/TIT.2003.821971zbMath1288.60037OpenAlexW2120339885MaRDI QIDQ3547687
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2003.821971
Related Items (4)
Accelerated and Instance-Optimal Policy Evaluation with Linear Function Approximation ⋮ Is Temporal Difference Learning Optimal? An Instance-Dependent Analysis ⋮ Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema ⋮ Convergence Rates and Decoupling in Linear Stochastic Approximation Algorithms
This page was built for publication: On the Almost Sure Rate of Convergence of Linear Stochastic Approximation Algorithms