MUFFLe: Efficient Model Update Compression via Generalized Deduplication for Federated Learning

46d ago · Global · primary source: export.arxiv.org

A new compression scheme called MUFFLe aims to cut the uplink communication cost of federated learning by applying generalized deduplication to model updates, according to a work-in-progress paper posted to arXiv on 12 June 2026 [1]. The paper, hosted on the open-access preprint repository arXiv, introduces MUFFLe as a method that integrates generalized deduplication into the standard FedAvg pipeline [1][2]. The technique identifies and removes repeated patterns across the update vector, producing what the authors describe as a fixed-rate, variable-count compression scheme [2]. Preliminary experiments used the IID MNIST dataset with 20 clients. The authors report that MUFFLe reached a target accuracy of 92.93% while consuming 38 MB of cumulative uplink communication [1][2]. By comparison, 8-bit quantization required 75 MB, Top-k sparsification used 86 MB, and uncompressed FedAvg transmitted 310 MB to achieve the same accuracy level [2]. Federated learning is often deployed in edge environments where uplink bandwidth is constrained, making the transmission of model updates a bottleneck [2]. The MUFFLe results, though described as preliminary, suggest that generalized deduplication can be applied to this problem [1]. The paper appears on arXiv as a preprint, meaning it has been moderated but not peer-reviewed [6]. arXiv, founded in 1991, now hosts more than two million articles and receives roughly 24,000 submissions per month as of late 2024 [6]. The repository’s Labs framework, which appears at the bottom of the MUFFLe abstract page, allows community collaborators to build tools such as Bibliographic Explorer and CORE Recommender that sit alongside papers [4][5]. Those tools are governed by guidelines that require partners to uphold openness, community, excellence, and user data privacy [4]. The MUFFLe paper does not include deployment benchmarks beyond the MNIST trial, and the authors frame the work as an initial feasibility demonstration [1][2]. No external validation or independent replication of the results has been cited in the preprint.

research-paper

Background sources we checked (7)
  • arxiv.org ↗ Federated learning is well suited to edge environments but is often limited by the uplink cost of transmitting model updates. This Work-in-Progress paper presents MUFFLe, a communication-efficient update compression scheme that integrates generalized deduplication (GD) into the F…
  • info.arxiv.org ↗ arXiv Labs - arXiv info | arXiv e-print repository Skip to content # arXiv Labs Attention arXiv Users: arXiv Labs is pausing new proposals ## What are arXiv Labs? arXiv Labs are a way for the community to contribute new, useful features to arXiv. These integrations are avail…
  • blog.arxiv.org ↗ arXivLabs: a space for community innovation – arXiv blog arXiv has launched a new, formalized framework enabling innovative collaborations with individuals and organizations. “Members of our community want to contribute tools that enhance the arXiv experience, and we val…
  • info.arxiv.org ↗ arXivLabs: Showcase - arXiv info | arXiv e-print repository ... # arXivLabs: Showcase ... arXiv is surrounded by a community of researchers and developers working at the cutting edge of information science and technology. ... While the arXiv team is focused on our core mission—pr…
  • en.wikipedia.org ↗ arXiv (pronounced as "archive"—the X represents the Greek letter chi ⟨χ⟩) is an open-access repository of electronic preprints and postprints (known as e-prints) approved for posting after moderation, but not peer reviewed. It consists of scientific papers in the fields of mathem…
  • en.wikipedia.org ↗ 14 (fourteen) is the natural number following 13 and preceding 15.…
  • en.wikipedia.org ↗ A large language model (LLM) is a type of machine learning model designed for natural language processing tasks such as language generation. LLMs are language models with many parameters, and are trained with self-supervised learning on a vast amount of text.…

Sources

Spot something wrong? Report an issue