Local smoothness of graph signals
M. Daković, L. Stanković, and E. Sejdić · 2019
Later among the works it cites.
Can gcns go as deep as cnns?
Original
G. Li, M. Müller, A. Thabet, and B. Ghanem · 2019
Later among the works it cites.
Lanczosnet: Multi-scale deep graph convolutional networks
Original
R. Liao, Z. Zhao, R. Urtasun, and R. S. Zemel · 2019
Later among the works it cites.
Break the ceiling: Stronger multi-scale deep graph convolutional networks
S. Luan, M. Zhao, X.-W. Chang, and D. Precup · 2019
Later among the works it cites.
Graph neural networks exponentially lose expressive power for node classification
K. Oono and T. Suzuki · 2019
Later among the works it cites.
Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods
D. Lim, F. Hohne, X. Li, S. L. Huang, V. Gupta, O. Bhalerao, and S. N. Lim · 2021
Closest in time.
Is heterophily a real nightmare for graph neural networks to do node classification?
Original
S. Luan, C. Hua, Q. Lu, J. Zhu, M. Zhao, S. Zhang, X.-W. Chang, and D. Precup · 2021
Closest in time.
When do we need gnn for node classification?
Original
S. Luan, C. Hua, Q. Lu, J. Zhu, X.-W. Chang, and D. Precup · 2022
Closest in time.
Revisiting heterophily for graph neural networks
S. Luan, C. Hua, Q. Lu, J. Zhu, M. Zhao, S. Zhang, X.-W. Chang, and D. Precup · 2022
Closest in time.
Complete the missing half: Augmenting aggregation filtering with diversification for graph convolutional networks
S. Luan, M. Zhao, C. Hua, X.-W. Chang, and D. Precup · 2022
Closest in time.
On addressing the limitations of graph neural networks
Original
S. Luan · 2023
Closest in time.
When do graph neural networks help with node classification: Investigating the homophily principle on node distinguishability
S. Luan, C. Hua, M. Xu, Q. Lu, J. Zhu, X.-W. Chang, J. Fu, J. Leskovec, and D. Precup · 2023
Closest in time.