Wide & Deep Learning for Node Classification
Not on the map. Why?
Abstract (arXiv)
Wide & Deep, a simple yet effective learning architecture for recommendation systems developed by Google, has had a significant impact in both academia and industry due to its combination of the memorization ability of generalized linear models and the generalization ability of deep models. Graph convolutional networks (GCNs) remain dominant in node classification tasks; however, recent studies have highlighted issues such as heterophily and expressiveness, which focus on graph structure while seemingly neglecting the potential role of node features. In this paper, we propose a flexible framework GCNIII, which leverages the Wide & Deep architecture and incorporates three techniques: Intersect memory, Initial residual and Identity mapping. We provide comprehensive empirical evidence showing that GCNIII can more effectively balance the trade-off between over-fitting and over-generalization on various semi- and full- supervised tasks. Additionally, we explore the use of large language models (LLMs) for node feature engineering to enhance the performance of GCNIII in cross-domain node classification tasks. Our implementation is available at https://github.com/CYCUCAS/GCNIII.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 44 of its 54 references that are in the map. First posted on arXiv 4 May 2025.
Builds on
44 of 54 references.
References · 44
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
- 2019Simplifying Graph Convolutional Networkscited by 1,477
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,102
32 more
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 993
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 877
- 2020Simple and Deep Graph Convolutional Networkscited by 860
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 826
- 2016Wide & Deep Learning for Recommender Systemscited by 747
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 680
- 2019Multi-scale Attributed Node Embeddingcited by 548
- 2019Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networkscited by 541
- 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 343
- 2021Do Transformers Really Perform Bad for Graph Representation?cited by 320
- 2020Towards Deeper Graph Neural Networkscited by 296
- 2023Exploring the Potential of Large Language Models (LLMs) in Learning on Graphscited by 274
- 2023One for All: Towards Training One Graph Model for All Classification Taskscited by 243
- 2020How Neural Networks Extrapolate: From Feedforward to Graph Neural Networkscited by 222
- 2023NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classificationcited by 210
- 2021Is Homophily a Necessity for Graph Neural Networks?cited by 182
- 2022Revisiting Heterophily For Graph Neural Networkscited by 169
- 2023Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learningcited by 133
- 2023SGFormer: Simplifying and Empowering Transformers for Large-Graph Representationscited by 133
- 2023Rethinking the Expressive Power of GNNs via Graph Biconnectivitycited by 119
- 2024Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classificationcited by 85
- 2023Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothingcited by 67
- 2024Polynormer: Polynomial-Expressive Graph Transformer in Linear Timecited by 65
- 2023A Complete Expressiveness Hierarchy for Subgraph GNNs via Subgraph Weisfeiler-Lehman Testscited by 64
- 2022Graph Neural Networks are Inherently Good Generalizers: Insights by Bridging GNNs and MLPscited by 42
- 2023Class-Imbalanced Graph Learning without Class Rebalancingcited by 29
- 2021Evaluating Deep Graph Neural Networkscited by 19
- 2024Online GNN Evaluation Under Test-time Graph Distribution Shiftscited by 12
- 2024What Is Missing In Homophily? Disentangling Graph Homophily For Graph Neural Networkscited by 9
- 2024Fast Graph Sharpness-Aware Minimization for Enhancing and Accelerating Few-Shot Node Classificationcited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.