Pages that link to "Item:Q4507444"
From MaRDI portal
The following pages link to Asymptotic Almost Sure Efficiency of Averaged Stochastic Algorithms (Q4507444):
Displayed 15 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)
- Trajectory averaging for stochastic approximation MCMC algorithms (Q605929) (← links)
- Convergence rate and averaging of nonlinear two-time-scale stochastic approximation algo\-rithms (Q862224) (← links)
- Importance sampling and statistical Romberg method (Q888470) (← links)
- Unconstrained recursive importance sampling (Q988764) (← links)
- Online estimation of the asymptotic variance for averaged stochastic gradient algorithms (Q2317311) (← links)
- The multivariate Révész's online estimator of a regression function and its averaging (Q2396740) (← links)
- A companion for the Kiefer-Wolfowitz-Blum stochastic approximation algorithm (Q2456019) (← links)
- CV<scp>a</scp> R HEDGING USING QUANTIZATION-BASED STOCHASTIC APPROXIMATION ALGORITHM (Q2788694) (← links)
- A framework for adaptive Monte Carlo procedures (Q3168631) (← links)
- Some multivariate risk indicators: Minimization by using a Kiefer–Wolfowitz approach to the mirror stochastic algorithm (Q3224136) (← 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)