Pages that link to "Item:Q2696976"

The following pages link to On the parallelization upper bound for asynchronous stochastic gradients descent in non-convex optimization (Q2696976):

Displaying 10 items.

• A sharp convergence rate for a model equation of the asynchronous stochastic gradient descent (Q2057038) (← links)
• Asynchronous parallel algorithms for nonconvex optimization (Q2205974) (← links)
• An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization (Q2979326) (← links)
• On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm (Q4012438) (← links)
• Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes (Q5038180) (← links)
• (Q5149233) (← links)
• The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory (Q5197680) (← links)
• An Asynchronous Parallel Stochastic Coordinate Descent Algorithm (Q5502117) (← links)
• Distributed Stochastic Optimization with Large Delays (Q5868949) (← links)
• Parallel and distributed asynchronous adaptive stochastic gradient methods (Q6095736) (← links)