Convergence rates for stochastic approximation: biased noise with unbounded variance, and applications
From MaRDI portal
(Redirected from Publication:6655795)
Cites work
- A Kiefer-Wolfowitz algorithm with randomized differences
- A Stochastic Approximation Method
- Acceleration of Stochastic Approximation by Averaging
- Analysis of recursive stochastic algorithms
- Applications of a Kushner and Clark lemma to general classes of stochastic algorithms
- Asymptotic bias of stochastic gradient search
- Asynchronous stochastic approximation and Q-learning
- Asynchronous Stochastic Approximations
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Convergence of stochastic approximation via martingale and converse Lyapunov methods
- Coordinate descent algorithms
- General convergence results for stochastic approximations via weak convergence theory
- Gradient Convergence in Gradient methods with Errors
- scientific article; zbMATH DE number 48727 (Why is no real title available?)
- scientific article; zbMATH DE number 1972910 (Why is no real title available?)
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- scientific article; zbMATH DE number 3313108 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- ISS-Lyapunov Functions for Discontinuous Discrete-Time Systems
- Lower bounds for non-convex stochastic optimization
- Multidimensional Stochastic Approximation Methods
- Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
- On gradients of functions definable in o-minimal structures
- On sufficiency of the Kuhn-Tucker conditions
- Optimal random perturbations for stochastic approximation using a simultaneous perturbation gradient approximation
- Optimization methods for large-scale machine learning
- Probability
- Probability with Martingales
- Random gradient-free minimization of convex functions
- Randomized algorithms for stochastic approximation under arbitrary disturbances
- Robust Stochastic Approximation Approach to Stochastic Programming
- Some methods of speeding up the convergence of iteration methods
- Stochastic Estimation of the Maximum of a Regression Function
- Strong convergence of a stochastic approximation algorithm
- The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
- Two models for analyzing the dynamics of adaptation algorithms
Cited in
(6)- A quantitative Robbins-Siegmund theorem
- Self-reinforced preferential attachment
- Stochastic approximation and reinforcement learning: the interface and a little beyond
- Neural implicit solution formula for efficiently solving Hamilton-Jacobi equations
- Stochastic approximation in infinite dimensions
- Adaptive-batch stochastic gradient descent for constrained optimization based on relaxed barrier functions
This page was built for publication: Convergence rates for stochastic approximation: biased noise with unbounded variance, and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655795)
