arXiv Machine Learning By T. Tony Cai, Yicheng Li

A Van Trees Lower Bound for Fully Interactive Differentially Private Federated Learning

Read the original on arXiv Machine Learning →

arXiv:2605. 19813v2 Announce Type: replace Abstract: Federated differentially private protocols can communicate over many adaptive rounds and reuse each client's local samples.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Aug 27

Differentiated Aggregation to Improve Generalization in Federated Learning

The paper proposes a new federated learning approach called FedALS that reduces communication costs by varying aggregation frequencies across model layers. It derives tighter generalization bounds for one‑round and multi‑round federated learning, linking these bounds to local updates and data heterogeneity. Based on representation‑learning insights, the authors argue that infrequent aggregation of early layers and more frequent aggregation of final layers yields more generalizable models, especially in non‑iid settings, and demonstrate the method’s effectiveness experimentally.

By Peyman Gholami, Hulya Seferoglu