Pages that link to "Item:Q2297648"

The following pages link to Communication-efficient algorithms for decentralized and stochastic optimization (Q2297648):

Displaying 35 items.

• The communication complexity for decentralized evaluation of functions (Q915467) (← links)
• On the communication complexity of Lipschitzian optimization for the coordinated model of computation (Q1578430) (← links)
• Distributed stochastic gradient tracking methods (Q2020611) (← links)
• Decentralized optimization over tree graphs (Q2031996) (← links)
• On the linear convergence of two decentralized algorithms (Q2032033) (← links)
• Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems (Q2042418) (← links)
• Incremental without replacement sampling in nonconvex optimization (Q2046568) (← links)
• On arbitrary compression for decentralized consensus and stochastic optimization over directed networks (Q2095323) (← links)
• Distributed communication-sliding mirror-descent algorithm for nonsmooth resource allocation problem (Q2674925) (← links)
• Stochastic first-order methods for convex and nonconvex functional constrained optimization (Q2689819) (← links)
• DSA: decentralized double stochastic averaging gradient algorithm (Q2810864) (← links)
• Revisiting EXTRA for Smooth Distributed Optimization (Q3300767) (← links)
• (Q4558572) (← links)
• Random Gradient Extrapolation for Distributed and Stochastic Optimization (Q4687240) (← links)
• Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions (Q4969107) (← links)
• A randomized incremental primal-dual method for decentralized consensus optimization (Q4995044) (← links)
• Fast Decentralized Nonconvex Finite-Sum Optimization with Recursive Variance Reduction (Q5026835) (← links)
• Decentralized multi-agent optimization based on a penalty method (Q5055302) (← links)
• On the Divergence of Decentralized Nonconvex Optimization (Q5056326) (← links)
• Exact penalties for decomposable convex optimization problems (Q5058390) (← links)
• Distributed aggregative optimization with quantized communication (Q5071659) (← links)
• (Q5149230) (← links)
• Optimal Algorithms for Non-Smooth Distributed Optimization in Networks (Q5214253) (← links)
• Balancing Communication and Computation in Distributed Optimization (Q5228298) (← links)
• A dual approach for optimal algorithms in distributed optimization over networks (Q5859014) (← links)
• Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method (Q5883312) (← links)
• Distributed Sparse Composite Quantile Regression in Ultrahigh Dimensions (Q6069861) (← links)
• Optimal Methods for Convex Risk-Averse Distributed Optimization (Q6116242) (← links)
• Graph Topology Invariant Gradient and Sampling Complexity for Decentralized and Stochastic Optimization (Q6116247) (← links)
• Communication-efficient and privacy-preserving large-scale federated learning counteracting heterogeneity (Q6126867) (← links)
• Decentralized online convex optimization with compressed communications (Q6136129) (← links)
• A review of decentralized optimization focused on information flows of decomposition algorithms (Q6164389) (← links)
• More communication-efficient distributed sparse learning (Q6546022) (← links)
• Distributed multi-agent optimisation via coordination with second-order nearest neighbours (Q6608904) (← links)
• Adaptive consensus: a network pruning approach for decentralized optimization (Q6644846) (← links)