Pages that link to "Item:Q1917693"
From MaRDI portal
The following pages link to Do stochastic algorithms avoid traps? (Q1917693):
Displayed 17 items.
- Sharp convergence rates of stochastic approximation for degenerate roots (Q1267748) (← links)
- Stochastic approximation algorithms with constant step size whose average is cooperative (Q1296595) (← links)
- Weak convergence rates for stochastic approximation with application to multiple targets and simulated annealing (Q1296615) (← links)
- Piecewise constant triangular cooling schedules for generalized simulated annealing algorithms (Q1296737) (← links)
- Vertex-reinforced random walks and a conjecture of Pemantle (Q1356346) (← links)
- Convergence rates for annealing diffusion processes (Q1379726) (← links)
- A space quantization method for numerical integration (Q1392785) (← links)
- Importance sampling for families of distributions (Q1578598) (← links)
- On the convergence of reinforcement learning (Q1779805) (← links)
- Convergence of a stochastic approximation version of the EM algorithm (Q1807177) (← links)
- Mixed equilibria and dynamical systems arising from fictitious play in perturbed games (Q1818284) (← links)
- Weak dependence beyond mixing and asymptotics for nonparametric regression (Q1848943) (← links)
- When can the two-armed bandit algorithm be trusted? (Q1879915) (← links)
- Avoidance of traps in stochastic approximation (Q2503522) (← links)
- Sur quelques algorithmes récursifs pour les probabilités numériques (Q4534847) (← links)
- The actor-critic algorithm as multi-time-scale stochastic approximation. (Q5955801) (← links)
- Stochastic approximation algorithms: overview and recent trends. (Q5955825) (← links)