Strong points of weak convergence: A study using RPA gradient estimation for automatic learning
From MaRDI portal
Publication:1301439
DOI10.1016/S0005-1098(99)00034-5zbMath0940.93078OpenAlexW2142929170WikidataQ128067155 ScholiaQ128067155MaRDI QIDQ1301439
Publication date: 2 November 1999
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0005-1098(99)00034-5
weak convergencelearningstochastic approximationestimate of the gradient vectornon-reset version of the estimatorregenerate estimation approach
Stochastic programming (90C15) Programming in abstract spaces (90C48) Stochastic approximation (62L20) Stochastic learning and adaptive control (93E35)
Related Items (2)
A perturbation analysis approach to phantom estimators for waiting times in the \(G/G/1\) queue ⋮ Perturbation analysis of inhomogeneous finite Markov chains
This page was built for publication: Strong points of weak convergence: A study using RPA gradient estimation for automatic learning