Optimal and Efficient Algorithms for Decentralized Online Convex Optimization

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

We investigate decentralized online convex optimization (D-OCO), in which a set of local learners are required to minimize a sequence of global loss functions using only local computations and communications. Previous studies have established $O(n^{5/4}\rho^{-1/2}\sqrt{T})$ and ${O}(n^{3/2}\rho^{-1}\log T)$ regret bounds for convex and strongly convex functions respectively, where $n$ is the number of local learners, $\rho

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