Explore In-Context Message Passing Operator for Graph Neural Networks in A Mean Field Game
Tingting Dan, Xinwei Huang, Won Hwa Kim, Guorong Wu
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper14
- Beyond Homophily in Graph Neural Networks: Current Limitations and Effective DesignsJiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann 等NeurIPS 2020 · 被引用 1,490 次
- AM-GCN: Adaptive Multi-channel Graph Convolutional NetworksXiao Wang, Meiqi Zhu, Deyu Bo, Peng Cui 等KDD 2020 · 被引用 464 次
- ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph RepresentationsEkagra Ranjan, Soumya Sanyal, Partha P. TalukdarAAAI 2020 · 被引用 400 次
- Graph Neural Networks with HeterophilyJiong Zhu, Ryan A. Rossi, Anup Rao, Tung Mai 等AAAI 2021 · 被引用 393 次
- GRAND: Graph Neural DiffusionBen Chamberlain, James Rowbottom, Maria I. Gorinova, Michael M. Bronstein 等ICML 2021 · 被引用 358 次
相关 Paper
- Cooperative Graph Neural NetworksBen Finkelshtein, Xingyue Huang, Michael M. Bronstein, Ismail Ilkan CeylanICML 2024 · 被引用 57 次
- Beyond Fixed Depth: Adaptive Graph Neural Networks for Node Classification Under Varying HomophilyAsela Hevapathige, Asiri Wijesinghe, Ahad N. ZehmakanAAAI 2026 · 被引用 2 次
- Interpreting and Unifying Graph Neural Networks with An Optimization FrameworkMeiqi Zhu, Xiao Wang, Chuan Shi, Houye Ji 等WWW 2021 · 被引用 233 次
- Re-Think and Re-Design Graph Neural Networks in Spaces of Continuous Graph Diffusion FunctionalsTingting Dan, Jiaqi Ding, Ziquan Wei, Shahar Z. Kovalsky 等NeurIPS 2023 · 被引用 16 次
- Boosting Graph Convolution with Disparity-induced Structural RefinementSujia Huang, Yueyang Pi, Tong Zhang, Wenzhe Liu 等WWW 2025 · 被引用 1 次
