{"ID":2844953,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2511.05283","arxiv_id":"2511.05283","title":"Communication-Efficient Decentralized Optimization via Double-Communication Symmetric ADMM","abstract":"This paper focuses on decentralized composite optimization over networks without a central coordinator. We propose a novel decentralized symmetric ADMM algorithm that incorporates multiple communication rounds within each iteration, derived from a new constraint formulation that enables information exchange beyond immediate neighbors. While increasing per-iteration communication, our approach significantly reduces the total number of iterations and overall com- munication cost. We further design optimal communication rules that minimize the number of rounds and variables transmitted per iteration. The proposed algorithm is shown to achieve linear convergence under standard and relatively weak assumptions (e.g., metric subregularity). Extensive experiments on regression and classification tasks validate the theoretical results and demonstrate superior performance compared to existing decentralized optimization methods.","short_abstract":"This paper focuses on decentralized composite optimization over networks without a central coordinator. We propose a novel decentralized symmetric ADMM algorithm that incorporates multiple communication rounds within each iteration, derived from a new constraint formulation that enables information exchange beyond imme...","url_abs":"https://arxiv.org/abs/2511.05283","url_pdf":"https://arxiv.org/pdf/2511.05283v2","authors":"[\"Jinrui Huang\",\"Xueqin Wang\",\"Dong Liu\",\"Jingguo Lan\",\"Runxiong Wu\"]","published":"2025-11-07T14:44:03Z","proceeding":"math.OC","tasks":"[\"math.OC\"]","methods":"[]","has_code":false}