FirsthandTech
arXiv: cs.AI preprintsInternational19 November 2026

Projected Penalty-Gradient Tracking for Communication-Efficient Byzantine-Resilient Federated Learning

This is an official announcement record

Firsthand records what arXiv: cs.AI preprints announced and links to the original. The wording below is theirs, not ours.

arXiv:2611.22929v1 Announce Type: cross Abstract: We investigate communication-efficient federated learning over heterogeneous datasets in the presence of Byzantine adversaries capable of uploading arbitrary information. Penalty-based methods bound the influence of each worker through the bounded gradient of a penalty function; however, the bound is lost once the uploads are compressed, since a Byzantine worker can accumulate an unbounded state at the server. To retain the Byzantine resilience under compressed uploads, we propose a projected penalty-gradient tracking framework, where each hone
Source: arXiv: cs.AI preprints

More from arXiv: cs.AI preprints

This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.