Pages that link to "Item:Q2235160"
From MaRDI portal
The following pages link to Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup (Q2235160):
Displaying 5 items.
- On the convergence analysis of asynchronous SGD for solving consistent linear systems (Q2685380) (← links)
- Revisiting Asynchronous Linear Solvers (Q3177757) (← links)
- Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes (Q5038180) (← links)
- Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism (Q5147036) (← links)
- An Asynchronous Parallel Stochastic Coordinate Descent Algorithm (Q5502117) (← links)