Cover Image

Local adapt-then-combine algorithms for distributed nonsmooth optimization: Achieving provable communication acceleration

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Guo, Luyao, Shi, Xinli, Xu, Wenying, Cao, Jinde
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Proximal Gradient Method With Probabilistic Multi-Gossip Communications for Decentralized Composite Optimization
by: Guo, Luyao, et al.
Published: (2023)

Achieving Linear Speedup with ProxSkip in Distributed Stochastic Optimization
by: Guo, Luyao, et al.
Published: (2023)

Distributed Online Randomized Gradient-Free optimization with Compressed Communication
by: Zhu, Longkang, et al.
Published: (2025)

Perturbed Proximal Gradient ADMM for Nonconvex Composite Optimization
by: Zhou, Yuan, et al.
Published: (2025)

Decentralized Nonconvex Composite Federated Learning with Gradient Tracking and Momentum
by: Zhou, Yuan, et al.
Published: (2025)

Block majorization-minimization with diminishing radius for constrained nonsmooth nonconvex optimization
by: Lyu, Hanbaek, et al.
Published: (2020)

Distributed Online Randomized Gradient-Free Optimization with Compressed Communication
by: Zhu, Longkang, et al.
Published: (2025)

Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization
by: Bodard, Alexander, et al.
Published: (2025)

TS-RSR: A provably efficient approach for batch Bayesian Optimization
by: Ren, Zhaolin, et al.
Published: (2024)

An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
by: Zhang, Huiling, et al.
Published: (2023)

Tradeoffs between convergence rate and noise amplification for momentum-based accelerated optimization algorithms
by: Mohammadi, Hesameddin, et al.
Published: (2022)

A theoretical and empirical study of new adaptive algorithms with additional momentum steps and shifted updates for stochastic non-convex optimization
by: Alecsa, Cristian Daniel
Published: (2021)

Fast sparse optimization via adaptive shrinkage
by: Cerone, Vito, et al.
Published: (2025)

Learning to accelerate distributed ADMM using graph neural networks
by: Doerks, Henri, et al.
Published: (2025)

A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization
by: Liu, Wei, et al.
Published: (2025)

Linear convergence of forward-backward accelerated algorithms without knowledge of the modulus of strong convexity
by: Li, Bowen, et al.
Published: (2023)

Primal-dual algorithm for contextual stochastic combinatorial optimization
by: Bouvier, Louis, et al.
Published: (2025)

An inexact Bregman proximal point method and its acceleration version for unbalanced optimal transport
by: Chen, Xiang, et al.
Published: (2024)

Achieving Linear Speedup for Composite Federated Learning
by: Huang, Kun, et al.
Published: (2026)

Empirical and computer-aided robustness analysis of long-step and accelerated methods in smooth convex optimization
by: Vernimmen, Pierre, et al.
Published: (2025)

Stochastic ADMM with batch size adaptation for nonconvex nonsmooth optimization
by: Jin, Jiachen, et al.
Published: (2025)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
by: Jia, Tingkai, et al.
Published: (2026)

Sinkhorn algorithms and linear programming solvers for optimal partial transport problems
by: Bai, Yikun
Published: (2024)

Projected proximal gradient trust-region algorithm for nonsmooth optimization
by: Dao, Minh N., et al.
Published: (2025)

An adaptively inexact first-order method for bilevel optimization with application to hyperparameter learning
by: Salehi, Mohammad Sadegh, et al.
Published: (2023)

Beyond adaptive gradient: Fast-Controlled Minibatch Algorithm for large-scale optimization
by: Coppola, Corrado, et al.
Published: (2024)

Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms
by: Martin, Andrea, et al.
Published: (2025)

A framework for bilevel optimization that enables stochastic and global variance reduction algorithms
by: Dagréou, Mathieu, et al.
Published: (2022)

Online estimation of the inverse of the Hessian for stochastic optimization with application to universal stochastic Newton algorithms
by: Godichon-Baggioni, Antoine, et al.
Published: (2024)

A smoothing Anderson acceleration algorithm for nonsmooth fixed point problem with linear convergence
by: Li, Zekai, et al.
Published: (2024)

Efficient and provably convergent end-to-end training of deep neural networks with linear constraints
by: Yang, Zonglin, et al.
Published: (2026)

HBNET-GIANT: A communication-efficient accelerated Newton-type fully distributed optimization algorithm
by: Das, Souvik, et al.
Published: (2025)

Extended alternating structure-adapted proximal gradient algorithm for nonconvex nonsmooth problems
by: Gao, Ying, et al.
Published: (2024)

On the numerical reliability of nonsmooth autodiff: a MaxPool case study
by: Boustany, Ryan
Published: (2024)

A stochastic smoothing framework for nonconvex-nonconcave min-sum-max problems with applications to Wasserstein distributionally robust optimization
by: Liu, Wei, et al.
Published: (2025)

Local convergence of simultaneous min-max algorithms to differential equilibrium on Riemannian manifold
by: Zhang, Sixin
Published: (2024)

Unregularized limit of stochastic gradient method for Wasserstein distributionally robust optimization
by: Le, Tam
Published: (2025)

Stochastic smoothing accelerated gradient method for general constrained nonsmooth convex composite optimization
by: Wang, Ruyu, et al.
Published: (2023)

Polygonal Unadjusted Langevin Algorithms: Creating stable and efficient adaptive algorithms for neural networks
by: Lim, Dong-Young, et al.
Published: (2021)

A distributed semismooth Newton based augmented Lagrangian method for distributed optimization
by: Ma, Qihao, et al.
Published: (2026)