activity
20212026
most citedRevisiting Heterophily For Graph Neural Networks

70 citations · 139 across the 9 of their papers we have counts for

collaborators
Showing cs.LGShow all

7 papers · 1 filter

cs.LG2024★ 1 cited

Flexible Diffusion Scopes with Parameterized Laplacian for Heterophilic Graph Learning

Qincheng Lu, Jiaqi Zhu, Sitao Luan +1

The ability of Graph Neural Networks (GNNs) to capture long-range and global topology information is limited by the scope of conventional graph Laplacian, leading to unsatisfactory…

cs.LG2024

Revealing the Pitfalls and Re-Evaluating the Advancement of Heterophilic Graph Learning

Sitao Luan, Qincheng Lu, Chenqing Hua +3

Over the past decade, Graph Neural Networks (GNNs) have achieved great success on machine learning tasks with relational data. However, recent studies have found that heterophily c…

cs.LG2024★ 3 cited

The Heterophilic Graph Learning Handbook: Benchmarks, Models, Theoretical Analysis, Applications and Challenges

Sitao Luan, Chenqing Hua, Qincheng Lu +11

Homophily principle, \ie{} nodes with the same labels or similar attributes are more likely to be connected, has been commonly believed to be the main reason for the superiority of…

cs.LG2024

GCEPNet: Graph Convolution-Enhanced Expectation Propagation for Massive MIMO Detection

Qincheng Lu, Sitao Luan, Xiao-Wen Chang

Massive MIMO (multiple-input multiple-output) detection is an important topic in wireless communication and various machine learning based methods have been developed recently for…

cs.LG2022★ 70 cited

Revisiting Heterophily For Graph Neural Networks

Sitao Luan, Chenqing Hua, Qincheng Lu +5

Graph Neural Networks (GNNs) extend basic Neural Networks (NNs) by using graph structures based on the relational inductive bias (homophily assumption). While GNNs have been common…

cs.LG2022★ 9 cited

When Do We Need Graph Neural Networks for Node Classification?

Sitao Luan, Chenqing Hua, Qincheng Lu +3

Graph Neural Networks (GNNs) extend basic Neural Networks (NNs) by additionally making use of graph structure based on the relational inductive bias (edge bias), rather than treati…

cs.LG2021★ 44 cited

Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?

Sitao Luan, Chenqing Hua, Qincheng Lu +5

Graph Neural Networks (GNNs) extend basic Neural Networks (NNs) by using the graph structures based on the relational inductive bias (homophily assumption). Though GNNs are believe…