Sign inGet started
Paper · arXiv

Encryption-Compatible Clustered Federated Learning via Distributed Expectation-Maximization over Metadata

Clustered Federated Learning (CFL) addresses data heterogeneity in federated settings by grouping clients with similar data distributions to enable effective training. Existing methods face a trade-off between privacy preservation, communication cost, and computational efficiency. We formalize this as the CFL trilemma, according to which improving two of these dimensions comes at the expense of the third. A prominent paradigm relies on metadata (i.e., low-dimensional representations of client datasets shared with the server) to enable communication- and computation-efficient clustering. However, such approaches are not compatible with standard FL privacy-preserving mechanisms. To address ...

AuthorsMichael Ben Ali, Imen Megdiche, André Péninou et al.
Primary categorycs.LG
Published30 July 2026
Last updated at source30 July 2026
cs.LGcs.CRcs.DCstat.ML
Embed this entry
<iframe src="https://silytics.si/embed/item/8e37bc77-55c4-4b6e-b75c-3d12ef02e1a5" 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.