Pages that link to "Item:Q4507444"
From MaRDI portal
The following pages link to Asymptotic Almost Sure Efficiency of Averaged Stochastic Algorithms (Q4507444):
Displaying 7 items.
- Efficient and fast estimation of the geometric median in Hilbert spaces with an averaged stochastic gradient algorithm (Q89452) (← links)
- Estimating the geometric median in Hilbert spaces with stochastic gradient algorithms: \(L^p\) and almost sure rates of convergence (Q268758) (← links)
- A fast and recursive algorithm for clustering large datasets with \(k\)-medians (Q434902) (← links)
- Online statistical inference for parameters estimation with linear-equality constraints (Q2146461) (← links)
- Online estimation of the asymptotic variance for averaged stochastic gradient algorithms (Q2317311) (← 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)