Convergence of stochastic algorithms: from the Kushner–Clark theorem to the Lyapounov functional method
From MaRDI portal
Publication:4332210
Recommendations
Cited in
(19)- Interacting generalized Friedman's urn systems
- Nonlinear randomized urn models: a stochastic approximation viewpoint
- Convergence of a stochastic approximation version of the EM algorithm
- Online EM algorithm for mixture with application to Internet traffic modeling
- Gradient descent in the absence of global Lipschitz continuity of the gradients
- Contractivity of a Markov operator on the space of normalised positive distributions
- A space quantization method for numerical integration
- Weak convergence rates for stochastic approximation with application to multiple targets and simulated annealing
- Average competitive learning vector quantization
- Convergence of gradient algorithms for nonconvex \(C^{1+ \alpha}\) cost functions
- scientific article; zbMATH DE number 3941408 (Why is no real title available?)
- Performance analysis of LVQ algorithms: a statistical physics approach
- Applications of a Kushner and Clark lemma to general classes of stochastic algorithms
- Bridging the gap between constant step size stochastic gradient descent and Markov chains
- Convergence in Distribution of the One-Dimensional Kohonen Algorithms when the Stimuli are not Uniform
- On Recursive Estimation in Incomplete Data Models
- Three Stochastic Versions of the EM Algorithm for Estimating Longitudinal Rasch Model
- Randomized urn models revisited using stochastic approximation
- Théorèmes de convergence presque sure pour une classe d'algorithmes stochastiques à pas decroissant
This page was built for publication: Convergence of stochastic algorithms: from the Kushner–Clark theorem to the Lyapounov functional method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4332210)