Real acceleration of communication process in distributed algorithms with compression

DOI10.1007/978-3-031-47859-8_8MaRDI QIDQ6588735zbMATH OpenFDO

Authors Svetlana Tkachenko, Artem Andreev, Aleksandr Beznosikov, A. V. Gasnikov

Publication date 16 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-47859-8_8

zbMATH Keywords

accelerationcompressiondistributed optimization

Mathematics Subject Classification ID

Stochastic programming (90C15)

Recommendations

• On arbitrary compression for decentralized consensus and stochastic optimization over directed networks
• Towards accelerated rates for distributed optimization over time-varying networks
• Optimal data splitting in distributed optimization for machine learning
• Decentralized online convex optimization with compressed communications
• Stochastic distributed learning with gradient quantization and double-variance reduction

Cites work

• Compression and data similarity: combination of two techniques for communication-efficient solving of distributed variational inequalities
• scientific article; zbMATH DE number 6982986 (Why is no real title available?)

Cited in

(2)

• Optimal data splitting in distributed optimization for machine learning
• Compression and data similarity: combination of two techniques for communication-efficient solving of distributed variational inequalities

This page was built for publication: Real acceleration of communication process in distributed algorithms with compression

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