Avoidance of traps in stochastic approximation
From MaRDI portal
(Redirected from Publication:2503522)
Recommendations
Cites work
- scientific article; zbMATH DE number 48727 (Why is no real title available?)
- scientific article; zbMATH DE number 976356 (Why is no real title available?)
- scientific article; zbMATH DE number 825585 (Why is no real title available?)
- scientific article; zbMATH DE number 1405930 (Why is no real title available?)
- Convergence of stochastic-approximation procedures in the case of regression equation with several roots
- Do stochastic algorithms avoid traps?
- Nonconvergence to unstable points in urn models and stochastic approximations
- On the Lock-in Probability of Stochastic Approximation
- Some Pathological Traps for Stochastic Approximation
- Strong convergence of a stochastic approximation algorithm
- The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
Cited in
(5)- On the convergence, lock-in probability, and sample complexity of stochastic approximation
- scientific article; zbMATH DE number 841848 (Why is no real title available?)
- Stochastic approximation and reinforcement learning: the interface and a little beyond
- A dynamic view of some anomalous phenomena in SGD for over-parametrized neural networks
- Q-learning for continuous-time linear systems: A model-free infinite horizon optimal control approach
This page was built for publication: Avoidance of traps in stochastic approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503522)