Message passing neural networks (MPNNs) have emerged as go-to models for learning on graph-structured data in the past decade. Despite their effectiveness, most of such models still incur severe issues such as over-smoothing and -correlation, due to their underlying objective of minimizing the Dirichlet energy and the derived neighborhood aggregation operations. In this paper, we propose the DDSM, a new MPNN model built on an optimization framework that includes the stress majorization and orthogonal regularization for overcoming the above issues. Further, we introduce the diffusion distances for nodes into the framework to guide the new message passing operations and develop efficient algorithms for distance approximations, both backed by rigorous theoretical analyses. Our comprehensive experiments showcase that DDSM consistently and considerably outperforms 15 strong baselines on both homophilic and heterophilic graphs.
@article{arxiv.2511.19984,
title = {Rethinking Message Passing Neural Networks with Diffusion Distance-guided Stress Majorization},
author = {Haoran Zheng and Renchi Yang and Yubo Zhou and Jianliang Xu},
journal= {arXiv preprint arXiv:2511.19984},
year = {2025}
}
Comments
Accepted by SIGKDD 2026. The code is available at https://github.com/HaoranZ99/DDSM