Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 26 min ago
PreprintCC BY 4.0arXiv

Data-Topology Compatibility Enables Personalization in Decentralized Learning

Abstract

Decentralized learning must balance collaboration with personalization across heterogeneous agents. This paper studies when cooperation can support statistically coherent groups of personalized models. We show that data-topology compatibility enables robust orbit-wise personalization: when local objectives and communication topology have (approximately) compatible automorphisms, agents within an orbit share (approximately) equal limiting distributions, while different orbits remain distinct without explicit personalization. This creates a new intermediate regime between global consensus and independent local learning. Under exact data-topology compatibility, as a reference system, we decompose the stochastic learning dynamics into orbit-level and transverse components, derive a necessary and sufficient stability criterion for distributional synchronization, and characterize the orbit-structured stationary law. Modelling an approximate data-topology compatible system as an ε-perturbed reference system, we prove the introduced errors have uniform-in-time and stationary O(ε) bounds in 2-Wasserstein distance. We also prove sufficient conditions for lower stationary average excess risk than both independent local training and the best single shared parameter. Experiments on synthetic data, MNIST, and CIFAR-10 are in full agreement with the theory. The code is available at https://github.com/Veronicaaa1/orbit-personalization.

Related

  1. Decentralized Bandit Learning of Markov Perfect Equilibria
    Felix Höfer, H. Mete Soner
    arXivPreprintCC BY-NC-ND 4.0Full textOptimisation & controlarXiv
  2. Learning to Refer: Inference-Time Collaboration in Decentralized Federated Learning
    Yuheng Ma, Chendi Wang, Qiong Zhang
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. Decentralized Strategies for Finite Population LQG Social Control: A Reinforcement Learning Approach
    Liangyuan Guo, Bing-Chang Wang, Guangchen Wang
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. Mission-critical spectrum sharing with decentralized Multi-Agent Reinforcement Learning
    Dimitrios Pylorof, Imtiaz Nasim, Humberto E. Garcia +3
    arXivPreprintCC BY-NC-ND 4.0Full textOptimisation & controlarXiv
  5. A Joint Power-Privacy Control Framework for Decentralized Learning over Heterogeneous Wireless Multicasting Networks
    Amir Ziaeddini, Yauhen Yakimenka, Joerg Kliewer
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
BibTeX
@misc{xu2026datatopology,
  title = {{Data-Topology Compatibility Enables Personalization in Decentralized Learning}},
  author = {Veronica Xu and Lingfei Wang and Chenlei Leng and Fengxiang He},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.15126},
  eprint = {2610.15126},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.15126},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Data-Topology Compatibility Enables Personalization in Decentralized Learning
AU  - Veronica Xu
AU  - Lingfei Wang
AU  - Chenlei Leng
AU  - Fengxiang He
PY  - 2026
DA  - 2026/10/10
PB  - arXiv
DO  - 10.48550/arxiv.2610.15126
UR  - https://arxiv.org/abs/2610.15126
AB  - Decentralized learning must balance collaboration with personalization across heterogeneous agents. This paper studies when cooperation can support statistically coherent groups of personalized models. We show that data-topology compatibility enables robust orbit-wise personalization: when local objectives and communication topology have (approximately) compatible automorphisms, agents within an orbit share (approximately) equal limiting distributions, while different orbits remain distinct without explicit personalization. This creates a new intermediate regime between global consensus and independent local learning. Under exact data-topology compatibility, as a reference system, we decompose the stochastic learning dynamics into orbit-level and transverse components, derive a necessary and sufficient stability criterion for distributional synchronization, and characterize the orbit-structured stationary law. Modelling an approximate data-topology compatible system as an ε-perturbed reference system, we prove the introduced errors have uniform-in-time and stationary O(ε) bounds in 2-Wasserstein distance. We also prove sufficient conditions for lower stationary average excess risk than both independent local training and the best single shared parameter. Experiments on synthetic data, MNIST, and CIFAR-10 are in full agreement with the theory. The code is available at https://github.com/Veronicaaa1/orbit-personalization.
ER  -