Pages that link to "Item:Q5881051"
From MaRDI portal
The following pages link to <i>L</i><sup><i>p</i></sup> and almost sure rates of convergence of averaged stochastic gradient algorithms: locally strongly convex objective (Q5881051):
Displaying 6 items.
- Asymptotic distribution and convergence rates of stochastic algorithms for entropic optimal transportation between probability measures (Q2039796) (← links)
- Optimal non-asymptotic analysis of the Ruppert-Polyak averaging stochastic algorithm (Q2680399) (← links)
- On the asymptotic rate of convergence of stochastic Newton algorithms and their weighted averaged versions (Q2696929) (← links)
- On the rates of convergence of parallelized averaged stochastic gradient algorithms (Q5110810) (← links)
- An Efficient Stochastic Newton Algorithm for Parameter Estimation in Logistic Regressions (Q5212017) (← links)
- An efficient averaged stochastic Gauss-Newton algorithm for estimating parameters of nonlinear regressions models (Q6632594) (← links)
