Cover Image

Compressed and Sparse Models for Non-Convex Decentralized Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Campbell, Andrew, Liu, Hang, Woldemariam, Leah, Scaglione, Anna
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Distributed, Parallel, and Cluster Computing Data Structures and Algorithms Multiagent Systems Optimization and Control 68W15, 68W10, 68W40, 90C06, 90C35, 90C25 G.1.6; F.2.1; E.4
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

Communication Compression for Distributed Learning without Control Variates
by: Ortega, Tomas, et al.
Published: (2024)

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

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

Quantized and Asynchronous Federated Learning
by: Ortega, Tomas, et al.
Published: (2024)

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

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

Efficient Multi-Processor Scheduling in Increasingly Realistic Models
by: Papp, Pál András, et al.
Published: (2024)

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

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

A $5$-Approximation Analysis for the Cover Small Cuts Problem
by: Simmons, Miles, et al.
Published: (2026)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
by: Bansal, Ishan, et al.
Published: (2024)

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

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

Replication in Graph Partitioning and Scheduling Problems
by: Papp, Pál András, et al.
Published: (2026)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
by: Grobben, Kobe, et al.
Published: (2025)

Optimal Online Bipartite Matching in Degree-2 Graphs
by: Bhangale, Amey, et al.
Published: (2025)

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

A simple Path-based LP Relaxation for Directed Steiner Tree
by: Pashkovich, Kanstantsin, et al.
Published: (2026)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
by: Buchbinder, Niv, et al.
Published: (2024)

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
by: Li, Shisheng
Published: (2026)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
by: Liu, Bowen
Published: (2025)

Extending Exact Integrality Gap Computations for the Metric TSP
by: Cook, William, et al.
Published: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
by: Heimann, Sophia, et al.
Published: (2026)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)

An Empirical Evaluation of Quantum-Inspired QUBO Methods for Heterogeneous HPC Workflow Mapping and Scheduling
by: Sharma, Aasish Kumar, et al.
Published: (2026)

Loss Minimization for Electrical Flows over Spanning Trees on Grids
by: Ito, Takehiro, et al.
Published: (2024)

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

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
by: Emmerich, Michael T. M.
Published: (2026)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
by: Heimann, Sophia, et al.
Published: (2025)

Leveraging Multi-Instance GPUs through moldable task scheduling
by: Villarrubia, Jorge, et al.
Published: (2025)

Distributed Computing for Huge-Scale Linear Programming
by: Tao, Luoyi
Published: (2024)

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

cuGenOpt: A GPU-Accelerated General-Purpose Metaheuristic Framework for Combinatorial Optimization
by: Liu, Yuyang
Published: (2026)

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

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

Two parallel dynamic lexicographic algorithms for factorization sets in numerical semigroups
by: Barron, Thomas
Published: (2024)