aiqbench analysis
This research tackles critical communication bottlenecks in federated learning by introducing LBAT, a method that dynamically allocates transmission budgets to high-value parameter layers rather than applying uniform compression. By reframing the problem as a resource allocation task solved via dynamic programming, the approach significantly improves utility and fidelity under extreme bandwidth constraints compared to standard baselines. The work advances the practical deployment of large-scale federated models where uplink resources are scarce.
Beyond Uniform Compression: Budgeted Transmission Allocation for Extreme Federated Learning
arXiv:2609.39646v1 Announce Type: new Abstract: Federated learning faces severe communication bottlenecks when clients upload high-dimensional model updates. Existing methods often compress these updates uniformly across all layers. This uniform approach ignores the heterogeneous value of different parameter blocks and wastes limited bandwidth on insensitive layers. To address this issue, we propose Layer-wise Budgeted Adaptive Transmission (LBAT). LBAT reframes federated communication under extreme uplink budgets as a resource allocation problem. Our framework dynamically estimates the transmission value of different layers utilising local training signals. It then employs an exact byte dynamic programming allocator to determine optimal rank and bit configurations under strict budgets. We validate LBAT on highly heterogeneous federated tabular prediction and data generation tasks. Extensive experiments demonstrate that LBAT consistently outperforms uniform rank, uniform quantisation, and fixed compression baselines across various extreme budget regimes. Furthermore, it achieves significantly better communication and utility tradeoffs while preserving essential distributional fidelity.
Abstract:Federated learning faces severe communication bottlenecks when clients upload high-dimensional model updates. Existing methods often compress these updates uniformly across all layers. This uniform approach ignores the heterogeneous value of different parameter blocks and wastes limited bandwidth on insensitive layers. To address this issue, we propose Layer-wise Budgeted Adaptive Transmission (LBAT). LBAT reframes federated communication under extreme uplink budgets as a resource allocation problem. Our framework dynamically estimates the transmission value of different layers utilising local training signals. It then employs an exact byte dynamic programming allocator to determine optimal rank and bit configurations under strict budgets. We validate LBAT on highly heterogeneous federated tabular prediction and data generation tasks. Extensive experiments demonstrate that LBAT consistently outperforms uniform rank, uniform quantisation, and fixed compression baselines across various extreme budget regimes. Furthermore, it achieves significantly better communication and utility tradeoffs while preserving essential distributional fidelity.
Machine Learning (cs.LG)
arXiv:2609.39646 [cs.LG]
(or arXiv:2609.39646v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.39646 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 238 words
Related coverage

[AINews] not much happened today
Latent Space · Oct 3, 2026

Can we change an AI model’s architecture without retraining it from scratch?
Amazon Science · Oct 12, 2026

[AINews] Reality Checks on AI News (Yegge shuts down Gas Town, Databricks’ +60% Astra cost)
Latent Space · Sep 17, 2026
KV-COBRA: KV Cache Compression via Co-Optimized Bit-Rank Allocation
arXiv · Sep 22, 2026