arXiv Machine Learning By Liam Mohr, Daphna Weinshall

Coordination on a Budget: Federated Active Learning with Few Labels

Read the original on arXiv Machine Learning →

The paper introduces a federated active learning (FAL) approach that tackles data privacy and label scarcity by coordinating query selection across clients. In low-budget scenarios, it finds that homogeneous (IID) data actually requires stronger coordination to avoid redundant queries, while heterogeneous data naturally yields diversity—a reversal of the usual federated learning narrative. The authors propose a new framework that aligns client data in a shared embedding space via federated representation learning, enabling globally coordinated active selection while keeping annotations local, and demonstrate that this method outperforms existing FAL methods even with larger annotation budgets.

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
Oct 3

Latent Information Sharing for Accelerating Federated Learning

The paper introduces a latent information sharing scheme for federated learning that mitigates client drift by sharing a small amount of hidden‑layer activations. The authors demonstrate both theoretically and empirically that this approach improves training efficiency while maintaining convergence guarantees and data privacy. Compared to existing methods such as FedProx, SCAFFOLD, FedPVR, FedProto, and SplitFed, the proposed method achieves higher model accuracy within a fixed round budget without adding significant communication overhead.

By Seungjun Lee, Ensieh Khazaei, Dimitrios Hatzinakos, Baturalp Buyukates, Sunwoo Lee