Wide and Deep Graph Neural Network with Distributed Online Learning
Zhan Gao, Fernando Gama, Alejandro Ribeiro

TL;DR
This paper introduces WD-GNN, a novel distributed architecture combining linear and nonlinear components, enabling efficient online learning and adaptation to dynamic graph changes in decentralized network tasks.
Contribution
The paper proposes WD-GNN, a new architecture that facilitates distributed online learning for GNNs, with a focus on convex reformulation and stability analysis.
Findings
Effective online adaptation in dynamic graphs
Distributed online learning algorithm with convergence guarantees
Successful applications in recommendation, localization, and swarm control
Abstract
Graph neural networks (GNNs) are naturally distributed architectures for learning representations from network data. This renders them suitable candidates for decentralized tasks. In these scenarios, the underlying graph often changes with time due to link failures or topology variations, creating a mismatch between the graphs on which GNNs were trained and the ones on which they are tested. Online learning can be leveraged to retrain GNNs at testing time to overcome this issue. However, most online algorithms are centralized and usually offer guarantees only on convex problems, which GNNs rarely lead to. This paper develops the Wide and Deep GNN (WD-GNN), a novel architecture that can be updated with distributed online learning mechanisms. The WD-GNN consists of two components: the wide part is a linear graph filter and the deep part is a nonlinear GNN. At training time, the joint wide…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
