Event-Triggered Gossip for Distributed Learning
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910029235355648 |
|---|---|
| author | Zhai, Zhiyuan Yuan, Xiaojun Ni, Wei Wang, Xin Zhang, Rui Li, Geoffrey Ye |
| author_facet | Zhai, Zhiyuan Yuan, Xiaojun Ni, Wei Wang, Xin Zhang, Rui Li, Geoffrey Ye |
| contents | While distributed learning offers a new learning paradigm for distributed network with no central coordination, it is constrained by communication bottleneck between nodes.
We develop a new event-triggered gossip framework for distributed learning to reduce inter-node communication overhead. The framework introduces an adaptive communication control mechanism that enables each node to autonomously decide in a fully decentralized fashion when to exchange model information with its neighbors based on local model deviations. We analyze the ergodic convergence of the proposed framework under noconvex objectives and interpret the convergence guarantees under different triggering conditions. Simulation results show that the proposed framework achieves substantially lower communication overhead than the state-of-the-art distributed learning methods, reducing cumulative point-to-point transmissions by \textbf{71.61\%} with only a marginal performance loss, compared with the conventional full-communication baseline. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_19116 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Event-Triggered Gossip for Distributed Learning Zhai, Zhiyuan Yuan, Xiaojun Ni, Wei Wang, Xin Zhang, Rui Li, Geoffrey Ye Signal Processing Machine Learning While distributed learning offers a new learning paradigm for distributed network with no central coordination, it is constrained by communication bottleneck between nodes. We develop a new event-triggered gossip framework for distributed learning to reduce inter-node communication overhead. The framework introduces an adaptive communication control mechanism that enables each node to autonomously decide in a fully decentralized fashion when to exchange model information with its neighbors based on local model deviations. We analyze the ergodic convergence of the proposed framework under noconvex objectives and interpret the convergence guarantees under different triggering conditions. Simulation results show that the proposed framework achieves substantially lower communication overhead than the state-of-the-art distributed learning methods, reducing cumulative point-to-point transmissions by \textbf{71.61\%} with only a marginal performance loss, compared with the conventional full-communication baseline. |
| title | Event-Triggered Gossip for Distributed Learning |
| topic | Signal Processing Machine Learning |
| url | https://arxiv.org/abs/2602.19116 |