Pages that link to "Item:Q2979326"
From MaRDI portal
The following pages link to An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization (Q2979326):
Displaying 21 items.
- A distributed quantile estimation algorithm of heavy-tailed distribution with massive datasets (Q1980051) (← links)
- Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems (Q2046311) (← links)
- Inertial proximal incremental aggregated gradient method with linear convergence guarantees (Q2084299) (← links)
- Asynchronous level bundle methods (Q2205980) (← links)
- Nonconvex proximal incremental aggregated gradient method with linear convergence (Q2275279) (← links)
- Perturbed Iterate Analysis for Asynchronous Stochastic Optimization (Q4588862) (← links)
- Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting (Q4624929) (← links)
- Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods (Q4641660) (← links)
- Random Gradient Extrapolation for Distributed and Stochastic Optimization (Q4687240) (← links)
- Distributed Learning with Sparse Communications by Identification (Q4959464) (← links)
- Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions (Q4969107) (← links)
- Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes (Q5038180) (← links)
- Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays (Q5058405) (← links)
- (Q5149264) (← links)
- A Distributed Flexible Delay-Tolerant Proximal Gradient Algorithm (Q5220423) (← links)
- Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems (Q5865360) (← links)
- Distributed Stochastic Optimization with Large Delays (Q5868949) (← links)
- Parallel and distributed asynchronous adaptive stochastic gradient methods (Q6095736) (← links)
- Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization (Q6166657) (← links)
- Privacy-preserving distributed projected one-point bandit online optimization over directed graphs (Q6583485) (← links)
- Federated dual averaging learning algorithm with delayed gradients for composite optimization (Q6658933) (← links)
