arXiv Machine Learning By Iason Ofeidis, Leandros Tassiulas

Contribution-Aware Bandwidth Allocation for Multimodal Split Learning

Read the original on arXiv Machine Learning →

The paper introduces ModalShare, a bandwidth allocation method for multimodal split learning that assigns each modality a keep‑ratio based on its Shapley contribution score. Unlike existing compression schemes that split the uplink budget proportionally to activation size, ModalShare explicitly optimizes the split across modalities, requiring no extra uplink traffic or client computation. Experiments on CREMA‑D and MVSA datasets show that ModalShare improves accuracy by 12.4–15.4 percentage points over equal keep‑ratios under a 5× compression budget, outperforming three compressors across multiple datasets and 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 2

Beyond Uniform Compression: Budgeted Transmission Allocation for Extreme Federated Learning

The paper introduces Layer-wise Budgeted Adaptive Transmission (LBAT), a method that treats federated learning communication as a resource allocation problem under tight uplink budgets. LBAT estimates the transmission value of each layer using local training signals and then applies a byte‑level dynamic programming allocator to choose optimal rank and bit configurations for each layer. Experiments on heterogeneous federated tabular prediction and data generation tasks show that LBAT outperforms uniform compression baselines, achieving better communication‑utility tradeoffs while maintaining distributional fidelity.

By Pengfei Li, Mohammad Khalil
arXiv Machine Learning
Oct 21

LightSplit: Practical Privacy-Preserving Split Learning via Orthogonal Projections (Full Version)

LightSplit introduces a lightweight orthogonal random projection at the split learning cut layer to reduce communication overhead and limit information exposure. By sending low‑dimensional projections instead of raw activations, the method preserves end‑to‑end differentiability while discarding irreversibly part of the representation, thereby mitigating reconstruction attacks. Experiments on seven benchmarks show up to 32× compression with minimal accuracy loss and strong resistance to state‑of‑the‑art inversion attacks.

By Mert Cihangiroglu, Alessandro Pegoraro, Phillip Rieger, Antonino Nocera, Ahmad-Reza Sadeghi
arXiv Machine Learning
Sep 11

EMMI: Edge Multi-Modal Intelligence for Communication-Efficient MLLM Inference via Fused Representation Compression

The paper introduces EMMI, a framework that enables communication‑efficient inference of multimodal large language models (MLLMs) on edge devices. EMMI encodes each sensor modality separately, fuses the representations, and compresses them into a compact latent vector that is transmitted to a server for high‑capacity reasoning. Experiments on a multimodal benchmark show that EMMI can cut the communication payload by 32× while keeping accuracy comparable, achieving up to a 3.4× reduction in end‑to‑end inference latency under bandwidth‑constrained conditions.

By Motahare Mounesan, Irfan Khan