Sign inGet started
Paper · arXiv

Compressed Proximal Federated Learning for Non-Convex Composite Optimization on Heterogeneous Data

Federated Composite Optimization (FCO) has emerged as a promising framework for training models with structural constraints (e.g., sparsity) in distributed edge networks. However, simultaneously achieving communication efficiency and convergence robustness remains a significant challenge, particularly when dealing with non-smooth regularizers, statistical heterogeneity, and the restrictions of biased compression. To address these issues, we propose FedCEF (Federated Composite Error Feedback), a novel algorithm tailored for non-convex FCO. FedCEF introduces a decoupled proximal update scheme that separates the proximal operator from communication, enabling clients to handle non-smooth term...

AuthorsPu Qiu, Chen Ouyang, Yongyang Xiong et al.
Primary categorymath.OC
Published8 March 2026
Last updated at source8 March 2026
math.OCcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/da6f4bd6-a560-44cd-b0df-7a19ee97e14e" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.