Convergence Rates of Distributed Gradient Methods Under Random Quantization: A Stochastic Approximation Approach

DOI10.1109/TAC.2020.3031018MaRDI QIDQ5036202zbMATH OpenFDO

Authors Thinh T. Doan, Siva Theja Maguluri, Justin Romberg

Publication date 23 February 2022

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.2020.3031018

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Recommendations

• On convergence rate of distributed stochastic gradient algorithm for convex optimization with inequality constraints
• Convergence Rates of Distributed Nesterov-Like Gradient Methods on Random Networks
• scientific article; zbMATH DE number 7306853
• A Continuous-Time Analysis of Distributed Stochastic Gradient
• Convergence of distributed gradient-tracking-based optimization algorithms with random graphs
• On the convergence of the conditional gradient method in distributed optimization problems
• Convergence of Asynchronous Distributed Gradient Methods Over Stochastic Networks
• Random gradient extrapolation for distributed and stochastic optimization
• Stochastic distributed learning with gradient quantization and double-variance reduction
• Fast Convergence Rates of Distributed Subgradient Methods With Adaptive Quantization

Cited in

(13)

• Quantized Consensus by the ADMM: Probabilistic Versus Deterministic Quantizers
• Finite-time analysis and restarting scheme for linear two-time-scale stochastic approximation
• scientific article; zbMATH DE number 7306853 (Why is no real title available?)
• Gradient-free federated learning methods with l₁ and l₂-randomization for non-smooth convex stochastic optimization problems
• S-NEAR-DGD: A Flexible Distributed Stochastic Gradient Method for Inexact Communication
• Distributed constrained optimization with periodic dynamic quantization
• Distributed constrained online convex optimization with adaptive quantization
• Decentralized online strongly convex optimization with general compressors and random disturbances
• Almost sure convergence of distributed optimization with imperfect information sharing
• Broadcast-based asynchronous convex optimization using quantized distributed stochastic mirror descent algorithm
• Numerical methods for distributed stochastic compositional optimization problems with aggregative structure
• Compressed gradient tracking algorithms for distributed nonconvex optimization
• Efficient gradient tracking algorithms for distributed optimization problems with inexact communication

This page was built for publication: Convergence Rates of Distributed Gradient Methods Under Random Quantization: A Stochastic Approximation Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5036202)