Abstract
Decentralized learning (DL) enables collaborative machine learning (ML) without a central server, making it suitable for settings where training data cannot be centrally hosted. We introduce Mosaic Learning, a DL framework that decomposes models into fragments and disseminates them independently across the network. Fragmentation reduces redundant communication across correlated parameters and enables more diverse information propagation without increasing communication cost. We theoretically show that Mosaic Learning (i) shows state-of-the-art worst-case convergence rate, and (ii) leverages parameter correlation in an ML model, improving contraction by reducing the highest eigenvalue of a simplified system. We empirically evaluate Mosaic Learning on four learning tasks and observe up to 12 percentage points higher node-level test accuracy compared to epidemic learning (EL), a state-of-the-art baseline. In summary, Mosaic Learning improves DL performance without sacrificing its utility or efficiency, and positions itself as a new DL standard.
BibTeX
@article{biswasMosaicLearningFramework2026,
title = {Mosaic {{Learning}}: {{A Framework}} for {{Decentralized Learning}} with {{Model Fragmentation}}},
shorttitle = {Mosaic {{Learning}}},
author = {Biswas, Sayan and Frey, Davide and Gaudel, Romaric and Gupta, Nirupam and Kermarrec, Anne-Marie and Ler{\'e}v{\'e}rend, Dimitri and Pires, Rafael and Sharma, Rishi and Ta{\"i}ani, Fran{\c c}ois and de Vos, Martijn},
year = {2026},
month = feb,
number = {arXiv:2602.04352},
primaryclass = {cs},
publisher = {arXiv},
urldate = {2026-02-09},
doi = {10.48550/arXiv.2602.04352},
archiveprefix = {arXiv},
keywords = {Computer Science - Machine Learning},
url = {https://arxiv.org/abs/2602.04352},
paper = {https://arxiv.org/abs/2602.04352},
}