Convergence in high probability of distributed stochastic gradient descent algorithms
From MaRDI portal
Cited in
(6)- Online distributed nonconvex optimization with stochastic objective functions: high probability bound analysis of dynamic regrets
- Online distributed optimization with stochastic gradients: high probability bound of regrets
- Online distributed algorithms for mixed equilibrium problems in dynamic environments
- Online distributed algorithms for aggregative games with stochastic costs over time-varying networks
- Online distributed optimization with clipped stochastic gradients: high probability bound of regrets
- Initialization-free optimization algorithm for interval-valued distributed optimization
This page was built for publication: Convergence in high probability of distributed stochastic gradient descent algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575928)