Copertina

Communication Compression for Distributed Learning without Control Variates

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Ortega, Tomas, Huang, Chun-Yin, Li, Xiaoxiao, Jafarkhani, Hamid
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Signal Processing Optimization and Control 68W10, 68W15, 68W40, 90C06, 90C35, 90C26 G.1.6; F.2.1; E.4
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Communication Compression for Distributed Learning with Aggregate and Server-Guided Feedback
di: Ortega, Tomas, et al.
Pubblicazione: (2025)

Decentralized Parameter-Free Online Learning with Compressed Gossip
di: Ortega, Tomas, et al.
Pubblicazione: (2026)

Quantized and Asynchronous Federated Learning
di: Ortega, Tomas, et al.
Pubblicazione: (2024)

Decentralized Parameter-Free Online Learning
di: Ortega, Tomas, et al.
Pubblicazione: (2025)

Decentralized Optimization in Networks with Arbitrary Delays
di: Ortega, Tomas, et al.
Pubblicazione: (2024)

Decentralized Optimization in Time-Varying Networks with Arbitrary Delays
di: Ortega, Tomas, et al.
Pubblicazione: (2024)

Distributed Computing for Huge-Scale Aggregative Convex Programming
di: Tao, Luoyi
Pubblicazione: (2026)

Compressed and Sparse Models for Non-Convex Decentralized Learning
di: Campbell, Andrew, et al.
Pubblicazione: (2023)

SUDA-Muon: Structural Design Principles and Boundaries for Fully Decentralized Muon
di: Zhang, Hengrui, et al.
Pubblicazione: (2026)

A Heuristic Alternating Direction Method of Multipliers Framework for Distributed and Centralized Tree-Constrained Optimization: Applications to Hop-Constrained Spanning Tree Multicommodity Flow Design
di: Mokhtari, Yacine
Pubblicazione: (2025)

Stable gradient-adjusted root mean square propagation on least squares problem
di: Li, Runze, et al.
Pubblicazione: (2024)

Stochastic versus Deterministic in Stochastic Gradient Descent
di: Li, Runze, et al.
Pubblicazione: (2025)

Similarity-based fuzzy clustering scientific articles: potentials and challenges from mathematical and computational perspectives
di: Huong, Vu Thi, et al.
Pubblicazione: (2025)

CompressedScaffnew: The First Theoretical Double Acceleration of Communication from Local Training and Compression in Distributed Optimization
di: Condat, Laurent, et al.
Pubblicazione: (2022)

Distributed Computing for Huge-Scale Linear Programming
di: Tao, Luoyi
Pubblicazione: (2024)

The Güler-type acceleration for proximal gradient, linearized augmented Lagrangian and linearized alternating direction method of multipliers
di: Zhou, Bin, et al.
Pubblicazione: (2025)

General Constrained Matrix Optimization
di: Garner, Casey, et al.
Pubblicazione: (2024)

Spectrally Constrained Optimization
di: Garner, Casey, et al.
Pubblicazione: (2023)

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
di: Lara, Felipe, et al.
Pubblicazione: (2024)

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
di: Ammann, Sabrina C. L., et al.
Pubblicazione: (2024)

Socio-cognitive agent-oriented evolutionary algorithm with trust-based optimization
di: Urbańczyk, Aleksandra, et al.
Pubblicazione: (2025)

Bundle EXTRA for Decentralized Optimization
di: Liu, Haijuan, et al.
Pubblicazione: (2026)

On the boundedness of the sequence generated by minibatch stochastic gradient descent
di: Bauschke, Heinz H., et al.
Pubblicazione: (2025)

Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs
di: Ju, Caleb, et al.
Pubblicazione: (2023)

Cutting Some Slack for SGD with Adaptive Polyak Stepsizes
di: Gower, Robert M., et al.
Pubblicazione: (2022)

MoMo: Momentum Models for Adaptive Learning Rates
di: Schaipp, Fabian, et al.
Pubblicazione: (2023)

DualFL: A Duality-based Federated Learning Algorithm with Communication Acceleration in the General Convex Regime
di: Park, Jongho, et al.
Pubblicazione: (2023)

Analysis of an Idealized Stochastic Polyak Method and its Application to Black-Box Model Distillation
di: Gower, Robert M., et al.
Pubblicazione: (2025)

Primal-Dual Coordinate Descent for Nonconvex-Nonconcave Saddle Point Problems Under the Weak MVI Assumption
di: Walwil, Iyad, et al.
Pubblicazione: (2025)

Riemannian Federated Learning via Averaging Gradient Streams
di: Huang, Zhenwei, et al.
Pubblicazione: (2024)

Nature-Inspired Algorithms in Optimization: Introduction, Hybridization and Insights
di: Yang, Xin-She
Pubblicazione: (2023)

Multiprocessor Scheduling with Memory Constraints: Fundamental Properties and Finding Optimal Solutions
di: Papp, Pál András, et al.
Pubblicazione: (2025)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
di: Hu, Wei, et al.
Pubblicazione: (2026)

On the connected (sub)partition polytope
di: Moura, Phablo F. S., et al.
Pubblicazione: (2024)

On the Geometric Convergence of Byzantine-Resilient Distributed Optimization Algorithms
di: Kuwaranancharoen, Kananart, et al.
Pubblicazione: (2023)

Multi-Party Multi-Objective Optimization as Consensus Search: Runtime Analysis of Cross-Party Recombination
di: Fang, Xiaolei, et al.
Pubblicazione: (2026)

On Covering Euclidean Space with Q-arrangements of Cones
di: Ghorbal, Khalil, et al.
Pubblicazione: (2022)

Approximation algorithms for the prize-collecting rural postman problem
di: Li, Hong, et al.
Pubblicazione: (2026)

Some Remarks on the Optimal Level of Randomization in Global Optimization
di: Theodosopoulos, Ted
Pubblicazione: (2004)

Federated Learning on Riemannian Manifolds with Differential Privacy
di: Huang, Zhenwei, et al.
Pubblicazione: (2024)