On the Law of the Iterated Logarithm in Stochastic Approximation Processes
From MaRDI portal
Cited in
(15)- Asymptotic behaviour of a class of stochastic approximation procedures
- A stochastic Newton-Raphson method
- On the interrelation of almost sure invariance principles for certain stochastic adaptive algorithms and for partial sums of random variables
- On one-sided convergence of a modified stochastic approximation process
- General multilevel adaptations for stochastic approximation algorithms of Robbins-Monro and Polyak-Ruppert type
- On the almost sure asymptotic behaviour of stochastic algorithm
- Strong representation of an adaptive stochastic approximation procedure
- Stochastic approximation algorithms for superquantiles estimation
- Exact bounds for the rate of convergence in general stochastic approximation procedures
- A Robbins-Monro procedure for estimation in semiparametric regression models
- The Compact Law of the Iterated Logarithm for Multivariate Stochastic Approximation Algorithms
- Asymptotic behavior for the Robbins-Monro process
- The ODE method for asymptotic statistics in stochastic approximation and reinforcement learning
- Multivariate compact law of the iterated logarithm for averaged stochastic approximation algorithms
- The law of the iterated logarithm for the nonlinear unbalanced urn model
This page was built for publication: On the Law of the Iterated Logarithm in Stochastic Approximation Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4099096)