Explore In-Context Message Passing Operator for Graph Neural Networks in A Mean Field Game
Tingting Dan, Xinwei Huang, Won Hwa Kim, Guorong Wu
Abstract
In typical graph neural networks (GNNs), feature representation learning naturally evolves through iteratively updating node features and exchanging information based on graph topology. In this context, we conceptualize that the learning process in GNNs is a mean-field game (MFG), where each graph node is an agent, interacting with its topologically connected neighbors. However, current GNNs often employ the identical MFG strategy across different graph datasets, regardless of whether the graph exhibits homophilic or heterophilic characteristics. To address this challenge, we propose to formulate the learning mechanism into a variational framework of the MFG inverse problem, introducing an in-context selective message passing paradigm for each agent, which promotes the best overall outcome for the graph. Specifically, we seek for the application-adaptive transportation function (controlling information exchange throughout the graph) and reaction function (controlling feature representation learning on each agent), on the fly, which allows us to uncover the most suitable selective mechanism of message passing by solving an MFG variational problem through the lens of Hamiltonian flows. Taken together, our variational framework unifies existing GNN models into various mean-field games with distinct equilibrium states, each characterized by the learned in-context message passing operators. Furthermore, we present an agnostic end-to-end deep model, coined Game-of-GNN, to jointly identify the message passing mechanism and fine-tune the GNN hyper-parameters on top of the elucidated message passing operators. Game-of-GNN has achieved SOTA performance on diverse graph data, including popular benchmark datasets and human connectomes. More importantly, the mathematical insight of MFG framework provides a new window to understand the foundational principles of graph learning as an interactive dynamical system, which allows us to reshape the idea of designing next-generation GNN models.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on14
- Beyond Homophily in Graph Neural Networks: Current Limitations and Effective DesignsJiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann et al.NeurIPS 2020 · 1,490 citations
- AM-GCN: Adaptive Multi-channel Graph Convolutional NetworksXiao Wang, Meiqi Zhu, Deyu Bo, Peng Cui et al.KDD 2020 · 464 citations
- ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph RepresentationsEkagra Ranjan, Soumya Sanyal, Partha P. TalukdarAAAI 2020 · 400 citations
- Graph Neural Networks with HeterophilyJiong Zhu, Ryan A. Rossi, Anup Rao, Tung Mai et al.AAAI 2021 · 393 citations
- GRAND: Graph Neural DiffusionBen Chamberlain, James Rowbottom, Maria I. Gorinova, Michael M. Bronstein et al.ICML 2021 · 358 citations
Related papers
- Cooperative Graph Neural NetworksBen Finkelshtein, Xingyue Huang, Michael M. Bronstein, Ismail Ilkan CeylanICML 2024 · 57 citations
- Beyond Fixed Depth: Adaptive Graph Neural Networks for Node Classification Under Varying HomophilyAsela Hevapathige, Asiri Wijesinghe, Ahad N. ZehmakanAAAI 2026 · 2 citations
- Interpreting and Unifying Graph Neural Networks with An Optimization FrameworkMeiqi Zhu, Xiao Wang, Chuan Shi, Houye Ji et al.WWW 2021 · 233 citations
- Re-Think and Re-Design Graph Neural Networks in Spaces of Continuous Graph Diffusion FunctionalsTingting Dan, Jiaqi Ding, Ziquan Wei, Shahar Z. Kovalsky et al.NeurIPS 2023 · 16 citations
- Boosting Graph Convolution with Disparity-induced Structural RefinementSujia Huang, Yueyang Pi, Tong Zhang, Wenzhe Liu et al.WWW 2025 · 1 citation
