DCatalyst: A Unified Accelerated Framework for Decentralized Optimization

Дата публикации: 17-08-2026 20:26:00

We study decentralized optimization over a network of agents, modeled as an undirected graph and operating without a central server. The objective is to minimize a composite function $f+r$, where $f$ is a (strongly) convex function representing the average of the agents' losses, and $r$ is a convex, extended-value function (regularizer).
We introduce DCatalyst, a unified black-box framework that injects Nesterov-type acceleration into decentralized optimization algorithms. At its core, DCatalyst is an inexact, momentum-accelerated proximal scheme (outer loop) that seamlessly wraps around a given decentralized method (inner loop). We show that DCatalyst attains optimal (up to logarithmic factors) communication and computational complexity across a broad family of decentralized algorithms and problem instances. In particular, it delivers accelerated rates for problem classes that previously lacked accelerated decentralized methods, thereby broadening the effectiveness of decentralized methods.
On the technical side, our framework introduces inexact estimating sequences--an extension of Nesterov's classical estimating sequences, tailored to decentralized, composite optimization. This construction systematically accommodates consensus errors and inexact solutions of local subproblems, addressing challenges that existing estimating-sequence-based analyses cannot handle while retaining a black-box, plug-and-play character.

Схожие новости

#	Наименование новости	Тональность	Информативность	Дата публикации
1	Convergence of Decentralized Stochastic Subgradient-based Methods for Nonsmooth Nonconvex Optimization	0	8.78	17-08-2026
2	Kernel-based Distributed Learning	0	7	17-08-2026
3	On the Relevance of Byzantine Robust Optimization Against Data Poisoning	0	4.9	17-08-2026
4	A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization	0	8	17-08-2026
5	A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems	0	13.11	17-08-2026
6	High-dimensional Parameter Transfer With Fused-Regularizer	0	9.38	17-08-2026
7	Finite-Time Decoupled Convergence in Nonlinear Two-Time-Scale Stochastic Approximation	0	9.64	17-08-2026
8	A Convex Framework for Confounding Robust Inference	0	5.45	17-08-2026
9	The Sample Complexity of Parameter-Free Stochastic Convex Optimization	0	5.7	17-08-2026

Классификация: Пресс-релизы. Схожих патентов: 0. Схожих новостей: 9. Тональность: 0. Информативность: 7. Источник: jmlr.org.