中文
相关论文

相关论文: Boosting Graph Neural Networks by Injecting Poolin…

200 篇论文

Graph Convolutional Network (GCN) with the powerful capacity to explore graph-structural data has gained noticeable success in recent years. Nonetheless, most of the existing GCN-based models suffer from the notorious over-smoothing issue,…

机器学习 · 计算机科学 2023-04-17 Zhaoliang Chen , Zhihao Wu , Zhenghong Lin , Shiping Wang , Claudia Plant , Wenzhong Guo

Message passing neural networks have shown a lot of success on graph-structured data. However, there are many instances where message passing can lead to over-smoothing or fail when neighboring nodes belong to different classes. In this…

Residual connections and normalization layers have become standard design choices for graph neural networks (GNNs), and were proposed as solutions to the mitigate the oversmoothing problem in GNNs. However, how exactly these methods help…

机器学习 · 计算机科学 2026-01-21 Michael Scholkemper , Xinyi Wu , Ali Jadbabaie , Michael T. Schaub

Message Passing Neural Networks (MPNNs) are instances of Graph Neural Networks that leverage the graph to send messages over the edges. This inductive bias leads to a phenomenon known as over-squashing, where a node feature is insensitive…

While Graph Neural Networks (GNNs) have achieved remarkable success, their design largely relies on empirical intuition rather than theoretical understanding. In this paper, we present a comprehensive analysis of GNN behavior through three…

机器学习 · 计算机科学 2025-02-04 Qin Jiang , Chengjia Wang , Michael Lones , Wei Pang

Graph convolutional networks (GCNs) have achieved promising performance on various graph-based tasks. However they suffer from over-smoothing when stacking more layers. In this paper, we present a quantitative study on this observation and…

机器学习 · 计算机科学 2020-09-28 Hongwei Zhang , Tijin Yan , Zenjun Xie , Yuanqing Xia , Yuan Zhang

While graph neural networks (GNNs) have allowed researchers to successfully apply neural networks to non-Euclidean domains, deep GNNs often exhibit lower predictive performance than their shallow counterparts. This phenomena has been…

机器学习 · 计算机科学 2025-05-20 Keqin Wang , Yulong Yang , Ishan Saha , Christine Allen-Blanchette

Graph neural networks (GNNs) are able to leverage the structure of graph data by passing messages along the edges of the graph. While this allows GNNs to learn features depending on the graph structure, for certain graph topologies it leads…

机器学习 · 计算机科学 2023-02-17 Kedar Karhadkar , Pradeep Kr. Banerjee , Guido Montúfar

There has been significant progress in improving the performance of graph neural networks (GNNs) through enhancements in graph data, model architecture design, and training strategies. For fairness in graphs, recent studies achieve fair…

机器学习 · 计算机科学 2023-12-20 Zhimeng Jiang , Xiaotian Han , Chao Fan , Zirui Liu , Na Zou , Ali Mostafavi , Xia Hu

Geometric deep learning has made great strides towards generalizing the design of structure-aware neural networks from traditional domains to non-Euclidean ones, giving rise to graph neural networks (GNN) that can be applied to…

机器学习 · 统计学 2024-10-28 Frederik Wenkel , Yimeng Min , Matthew Hirn , Michael Perlmutter , Guy Wolf

Oversmoothing has been recognized as a main obstacle to building deep Graph Neural Networks (GNNs), limiting the performance. This position paper argues that the influence of oversmoothing has been overstated and advocates for a further…

机器学习 · 计算机科学 2025-06-06 MoonJeong Park , Sunghyun Choi , Jaeseung Heo , Eunhyeok Park , Dongwoo Kim

The over-smoothing problem is an obstacle of developing deep graph neural network (GNN). Although many approaches to improve the over-smoothing problem have been proposed, there is still a lack of comprehensive understanding and conclusion…

机器学习 · 计算机科学 2023-03-02 Weichen Zhao , Chenguang Wang , Congying Han , Tiande Guo

Graph Neural Network (GNN), with the main idea of encoding graph structure information of graphs by propagation and aggregation, has developed rapidly. It achieved excellent performance in representation learning of multiple types of graphs…

机器学习 · 计算机科学 2024-07-04 Yushan Zhu , Wen Zhang , Yajing Xu , Zhen Yao , Mingyang Chen , Huajun Chen

Graph Neural Networks (GNNs) have achieved a lot of success on graph-structured data. However, it is observed that the performance of graph neural networks does not improve as the number of layers increases. This effect, known as…

机器学习 · 计算机科学 2020-06-25 Chen Cai , Yusu Wang

Message passing mechanism contributes to the success of GNNs in various applications, but also brings the oversquashing problem. Recent works combat oversquashing by improving the graph spectrums with rewiring techniques, disrupting the…

机器学习 · 计算机科学 2024-03-19 Haiquan Qiu , Yatao Bian , Quanming Yao

We propose Scalable Message Passing Neural Networks (SMPNNs) and demonstrate that, by integrating standard convolutional message passing into a Pre-Layer Normalization Transformer-style block instead of attention, we can produce…

Graph Neural Networks (GNNs), a type of neural network that can learn from graph-structured data through neighborhood information aggregation, have shown superior performance in various downstream tasks. However, as the number of layers…

机器学习 · 计算机科学 2024-11-01 Jingbo Zhou , Yixuan Du , Ruqiong Zhang , Jun Xia , Zhizhi Yu , Zelin Zang , Di Jin , Carl Yang , Rui Zhang , Stan Z. Li

Graph Convolutional Networks (GCN) is a pioneering model for graph-based semi-supervised learning. However, GCN does not perform well on sparsely-labeled graphs. Its two-layer version cannot effectively propagate the label information to…

机器学习 · 计算机科学 2025-02-24 Wei Ye , Zexi Huang , Yunqi Hong , Ambuj Singh

Graph neural networks (GNNs) have achieved strong performance across various real-world domains. Nevertheless, they suffer from oversquashing, where long-range information is distorted as it is compressed through limited message-passing…

机器学习 · 计算机科学 2026-04-03 Tanvir Hossain , Muhammad Ifte Khairul Islam , Lilia Chebbah , Charles Fanning , Esra Akbas

Graph Neural Networks (GNNs) suffer from over-smoothing in deep architectures and expressiveness bounded by the 1-Weisfeiler-Leman (1-WL) test. We adapt Manifold-Constrained Hyper-Connections (\mhc)~\citep{xie2025mhc}, recently proposed for…

机器学习 · 计算机科学 2026-01-07 Subhankar Mishra