Convergence Rate of Stochastic Approximation Algorithms in the Degenerate Case
From MaRDI portal
Publication:4388904
Recommendations
- Convergence rates and decoupling in linear stochastic approximation algorithms
- Rate of Convergence for Constrained Stochastic Approximation Algorithms
- Almost sure rate of convergence of the parameter estimates in stochastic approximation algorithm
- Stochastic approximation algorithms: Nonasymptotic estimation of their convergence rates
- Optimal convergence rate of the randomized algorithms of stochastic approximation in arbitrary noise
- On the convergence rate for stochastic approximation in the nonsmooth setting
- Sharp convergence rates of stochastic approximation for degenerate roots
- Generalization of the Dvoretzky theorem of convergence rate of the stochastic approximation algorithms
- General non-asymptotic estimates of the rate of convergence of iterative stochastic algorithms
Cited in
(9)- Behavior of stochastic approximation algorithm in root set of regression function
- scientific article; zbMATH DE number 878593 (Why is no real title available?)
- On the convergence rate for stochastic approximation in the nonsmooth setting
- On the convergence of reinforcement learning
- Geometric structure in stochastic approximation
- On the convergence of markovian stochastic algorithms with rapidly decreasing ergodicity rates
- Sample path based convergence analysis of stochastic approximation algorithm: theories and applications
- Stochastic approximation algorithms: overview and recent trends.
- scientific article; zbMATH DE number 3974121 (Why is no real title available?)
This page was built for publication: Convergence Rate of Stochastic Approximation Algorithms in the Degenerate Case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388904)
