{"total":860,"rows":[{"id":"2110.14446","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","created":"2021-10-27","cited_by_count":311,"area":null},{"id":"2206.08164","title":"Long Range Graph Benchmark","created":"2022-06-16","cited_by_count":263,"area":null},{"id":"2303.10993","title":"A Survey on Oversmoothing in Graph Neural Networks","created":"2023-03-20","cited_by_count":247,"area":null},{"id":"2308.07134","title":"Language is All a Graph Needs","created":"2023-08-14","cited_by_count":220,"area":null},{"id":"2202.04579","title":"Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs","created":"2022-02-09","cited_by_count":214,"area":null},{"id":"2102.06462","title":"Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks","created":"2021-02-12","cited_by_count":182,"area":null},{"id":"2106.06134","title":"Is Homophily a Necessity for Graph Neural Networks?","created":"2021-06-11","cited_by_count":182,"area":null},{"id":"2205.07308","title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","created":"2022-05-15","cited_by_count":179,"area":null},{"id":"2202.07082","title":"Graph Neural Networks for Graphs with Heterophily: A Survey","created":"2022-02-14","cited_by_count":175,"area":null},{"id":"2106.07476","title":"Training Graph Neural Networks with 1000 Layers","created":"2021-06-14","cited_by_count":169,"area":null},{"id":"2210.07606","title":"Revisiting Heterophily For Graph Neural Networks","created":"2022-10-14","cited_by_count":169,"area":null},{"id":"2202.02466","title":"Handling Distribution Shifts on Graphs: An Invariance Perspective","created":"2022-02-05","cited_by_count":164,"area":null},{"id":"2110.08727","title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","created":"2021-10-17","cited_by_count":152,"area":null},{"id":"2206.04910","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs","created":"2022-06-10","cited_by_count":137,"area":null},{"id":"2101.11859","title":"Interpreting and Unifying Graph Neural Networks with An Optimization Framework","created":"2021-01-28","cited_by_count":131,"area":null},{"id":"2105.00956","title":"UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks","created":"2021-05-03","cited_by_count":130,"area":null},{"id":"2202.02296","title":"Graph-Coupled Oscillator Networks","created":"2022-02-04","cited_by_count":124,"area":null},{"id":"2102.01987","title":"Learning Graph Embeddings for Compositional Zero-shot Learning","created":"2021-02-03","cited_by_count":112,"area":null},{"id":"2310.01089","title":"GraphText: Graph Reasoning in Text Space","created":"2023-10-02","cited_by_count":111,"area":"lr"},{"id":"2108.01938","title":"PDE-GCN: Novel Architectures for Graph Neural Networks Motivated by Partial Differential Equations","created":"2021-08-04","cited_by_count":106,"area":null},{"id":"2205.12156","title":"Not too little, not too much: a theoretical analysis of graph (over)smoothing","created":"2022-05-24","cited_by_count":106,"area":null},{"id":"2107.06779","title":"MMGCN: Multimodal Fusion via Deep Graph Convolution Network for Emotion Recognition in Conversation","created":"2021-07-14","cited_by_count":99,"area":null},{"id":"2107.02392","title":"Dirichlet Energy Constrained Learning for Deep Graph Neural Networks","created":"2021-07-06","cited_by_count":97,"area":null},{"id":"2201.07858","title":"Decoupling the Depth and Scope of Graph Neural Networks","created":"2022-01-19","cited_by_count":94,"area":null},{"id":"2106.05609","title":"GNNAutoScale: Scalable and Expressive Graph Neural Networks via Historical Embeddings","created":"2021-06-10","cited_by_count":90,"area":null},{"id":"2202.03580","title":"Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited","created":"2022-02-04","cited_by_count":87,"area":null},{"id":"2301.09474","title":"DIFFormer: Scalable (Graph) Transformers Induced by Energy Constrained Diffusion","created":"2023-01-23","cited_by_count":87,"area":null},{"id":"2102.00546","title":"GraphEBM: Molecular Graph Generation with Energy-Based Models","created":"2021-01-31","cited_by_count":85,"area":null},{"id":"2309.00367","title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","created":"2023-09-01","cited_by_count":85,"area":null},{"id":"2406.08993","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","created":"2024-06-13","cited_by_count":85,"area":null},{"id":"2110.15777","title":"GBK-GNN: Gated Bi-Kernel Graph Neural Networks for Modeling Both Homophily and Heterophily","created":"2021-10-29","cited_by_count":84,"area":null},{"id":"2206.04355","title":"Graph Attention Multi-Layer Perceptron","created":"2022-06-09","cited_by_count":83,"area":null},{"id":"2209.14107","title":"Debiasing Graph Neural Networks via Learning Disentangled Causal Substructure","created":"2022-09-28","cited_by_count":83,"area":null},{"id":"2109.05641","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","created":"2021-09-12","cited_by_count":82,"area":null},{"id":"2104.01404","title":"New Benchmarks for Learning on Non-Homophilous Graphs","created":"2021-04-03","cited_by_count":81,"area":null},{"id":"2106.05150","title":"Scaling Up Graph Neural Networks Via Graph Coarsening","created":"2021-06-09","cited_by_count":80,"area":null},{"id":"2206.04216","title":"Neo-GNNs: Neighborhood Overlap-aware Graph Neural Networks for Link Prediction","created":"2022-06-09","cited_by_count":78,"area":null},{"id":"2403.01121","title":"OpenGraph: Towards Open Graph Foundation Models","created":"2024-03-02","cited_by_count":78,"area":null},{"id":"2204.09888","title":"Fairness in Graph Mining: A Survey","created":"2022-04-21","cited_by_count":76,"area":null},{"id":"2108.12055","title":"Towards Self-Explainable Graph Neural Network","created":"2021-08-26","cited_by_count":75,"area":null},{"id":"2304.05055","title":"A Comprehensive Survey on Deep Graph Representation Learning","created":"2023-04-11","cited_by_count":72,"area":null},{"id":"2103.02885","title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","created":"2021-03-04","cited_by_count":69,"area":"distill"},{"id":"2302.01524","title":"Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing","created":"2023-02-03","cited_by_count":67,"area":null},{"id":"2204.01855","title":"A Survey on Graph Representation Learning Methods","created":"2022-04-04","cited_by_count":66,"area":null},{"id":"2206.08702","title":"Sheaf Neural Networks with Connection Laplacians","created":"2022-06-17","cited_by_count":65,"area":null},{"id":"2403.01232","title":"Polynormer: Polynomial-Expressive Graph Transformer in Linear Time","created":"2024-03-02","cited_by_count":65,"area":null},{"id":"2201.00232","title":"Towards Robust Graph Neural Networks for Noisy Graphs with Sparse Labels","created":"2022-01-01","cited_by_count":63,"area":null},{"id":"2206.13510","title":"Structural Entropy Guided Graph Hierarchical Pooling","created":"2022-06-26","cited_by_count":62,"area":null},{"id":"2206.03426","title":"Improving Fairness in Graph Neural Networks via Mitigating Sensitive Attribute Leakage","created":"2022-06-07","cited_by_count":61,"area":null},{"id":"2103.06064","title":"Graph Neural Networks Inspired by Classical Iterative Algorithms","created":"2021-03-10","cited_by_count":60,"area":null},{"id":"2210.09789","title":"Anti-Symmetric DGN: a stable architecture for Deep Graph Networks","created":"2022-10-18","cited_by_count":60,"area":null},{"id":"2206.10991","title":"Understanding convolution on graphs via energies","created":"2022-06-22","cited_by_count":59,"area":null},{"id":"2110.15174","title":"On Provable Benefits of Depth in Training Graph Convolutional Networks","created":"2021-10-28","cited_by_count":58,"area":null},{"id":"2111.04840","title":"Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoods","created":"2021-11-08","cited_by_count":58,"area":null},{"id":"2111.06748","title":"Simplifying approach to Node Classification in Graph Neural Networks","created":"2021-11-12","cited_by_count":56,"area":null},{"id":"2209.15059","title":"Provably expressive temporal graph networks","created":"2022-09-29","cited_by_count":56,"area":null},{"id":"2105.04550","title":"Optimization of Graph Neural Networks: Implicit Acceleration by Skip Connections and More Depth","created":"2021-05-10","cited_by_count":55,"area":null},{"id":"2211.14208","title":"GREAD: Graph Neural Reaction-Diffusion Networks","created":"2022-11-25","cited_by_count":54,"area":null},{"id":"2109.03856","title":"Local Augmentation for Graph Neural Networks","created":"2021-09-08","cited_by_count":53,"area":null},{"id":"2203.02385","title":"MM-DFN: Multimodal Dynamic Fusion Network for Emotion Recognition in Conversations","created":"2022-03-04","cited_by_count":52,"area":null},{"id":"2112.03968","title":"Learning Theory Can (Sometimes) Explain Generalisation in Graph Neural Networks","created":"2021-12-07","cited_by_count":51,"area":null},{"id":"2201.00491","title":"KerGNNs: Interpretable Graph Neural Networks with Graph Kernels","created":"2022-01-03","cited_by_count":50,"area":null},{"id":"2105.01017","title":"Learning Graph Embeddings for Open World Compositional Zero-Shot Learning","created":"2021-05-03","cited_by_count":49,"area":null},{"id":"2210.00513","title":"Gradient Gating for Deep Multi-Rate Learning on Graphs","created":"2022-10-02","cited_by_count":49,"area":null},{"id":"2212.10701","title":"A Non-Asymptotic Analysis of Oversmoothing in Graph Neural Networks","created":"2022-12-21","cited_by_count":49,"area":null},{"id":"2305.16102","title":"Demystifying Oversmoothing in Attention-Based Graph Neural Networks","created":"2023-05-25","cited_by_count":49,"area":null},{"id":"2104.06608","title":"Search to aggregate neighborhood for graph neural network","created":"2021-04-14","cited_by_count":48,"area":null},{"id":"2102.06986","title":"How Framelets Enhance Graph Neural Networks","created":"2021-02-13","cited_by_count":46,"area":null},{"id":"2303.01263","title":"Unnoticeable Backdoor Attacks on Graph Neural Networks","created":"2023-02-11","cited_by_count":45,"area":null},{"id":"2305.13084","title":"A Fractional Graph Laplacian Approach to Oversmoothing","created":"2023-05-22","cited_by_count":45,"area":null},{"id":"2104.12840","title":"AdaGNN: Graph Neural Networks with Adaptive Frequency Response Filter","created":"2021-04-26","cited_by_count":43,"area":null},{"id":"2212.08174","title":"Non-IID Transfer Learning on Graphs","created":"2022-12-15","cited_by_count":43,"area":null},{"id":"2304.10031","title":"Architectures of Topological Deep Learning: A Survey of Message-Passing Topological Neural Networks","created":"2023-04-20","cited_by_count":43,"area":null},{"id":"2502.10818","title":"On Vanishing Gradients, Over-Smoothing, and Over-Squashing in GNNs: Bridging Recurrent and Graph Learning","created":"2025-02-15","cited_by_count":43,"area":null},{"id":"2212.09034","title":"Graph Neural Networks are Inherently Good Generalizers: Insights by Bridging GNNs and MLPs","created":"2022-12-18","cited_by_count":42,"area":null},{"id":"2105.07634","title":"Improving Graph Neural Networks with Simple Architecture Design","created":"2021-05-17","cited_by_count":41,"area":null},{"id":"2305.08048","title":"Towards Understanding the Generalization of Graph Neural Networks","created":"2023-05-14","cited_by_count":41,"area":null},{"id":"2306.01323","title":"Demystifying Structural Disparity in Graph Neural Networks: Can One Size Fit All?","created":"2023-06-02","cited_by_count":41,"area":null},{"id":"2204.09860","title":"Remote Sensing Cross-Modal Text-Image Retrieval Based on Global and Local Information","created":"2022-04-21","cited_by_count":40,"area":null},{"id":"2303.05234","title":"GPGait: Generalized Pose-based Gait Recognition","created":"2023-03-09","cited_by_count":40,"area":null},{"id":"2103.04886","title":"Lipschitz Normalization for Self-Attention Layers with Application to Graph Neural Networks","created":"2021-03-08","cited_by_count":39,"area":null},{"id":"2210.05801","title":"Linkless Link Prediction via Relational Distillation","created":"2022-10-11","cited_by_count":39,"area":null},{"id":"2303.06562","title":"ContraNorm: A Contrastive Learning Perspective on Oversmoothing and Beyond","created":"2023-03-12","cited_by_count":39,"area":null},{"id":"2211.02843","title":"Unleashing the Power of Graph Data Augmentation on Covariate Distribution Shift","created":"2022-11-05","cited_by_count":38,"area":null},{"id":"2108.10521","title":"Bag of Tricks for Training Deeper Graph Neural Networks: A Comprehensive Benchmark Study","created":"2021-08-24","cited_by_count":36,"area":null},{"id":"2302.12432","title":"Graph Neural Networks with Learnable and Optimal Polynomial Bases","created":"2023-02-24","cited_by_count":36,"area":null},{"id":"2310.01267","title":"Cooperative Graph Neural Networks","created":"2023-10-02","cited_by_count":36,"area":null},{"id":"2310.11046","title":"Fast Graph Condensation with Structure-based Neural Tangent Kernel","created":"2023-10-17","cited_by_count":36,"area":null},{"id":"2108.11022","title":"Tree Decomposed Graph Neural Network","created":"2021-08-25","cited_by_count":35,"area":null},{"id":"2303.09778","title":"SE-GSL: A General and Effective Graph Structure Learning Framework through Structural Entropy Optimization","created":"2023-03-17","cited_by_count":35,"area":null},{"id":"2308.02117","title":"VQGraph: Rethinking Graph Representation Space for Bridging GNNs and MLPs","created":"2023-08-04","cited_by_count":35,"area":"distill"},{"id":"2111.01370","title":"FedGraph: Federated Graph Learning with Intelligent Sampling","created":"2021-11-02","cited_by_count":34,"area":null},{"id":"2204.08176","title":"HRCF: Enhancing Collaborative Filtering via Hyperbolic Geometric Regularization","created":"2022-04-18","cited_by_count":34,"area":null},{"id":"2303.14859","title":"Mind the Label Shift of Augmentation-based Graph OOD Generalization","created":"2023-03-27","cited_by_count":34,"area":null},{"id":"2403.16030","title":"VCR-Graphormer: A Mini-batch Graph Transformer via Virtual Connections","created":"2024-03-24","cited_by_count":34,"area":null},{"id":"2406.02997","title":"Residual Connections and Normalization Can Provably Prevent Oversmoothing in GNNs","created":"2024-06-05","cited_by_count":34,"area":null},{"id":"2202.10720","title":"EIGNN: Efficient Infinite-Depth Graph Neural Networks","created":"2022-02-22","cited_by_count":32,"area":null},{"id":"2311.17084","title":"DepthSSC: Monocular 3D Semantic Scene Completion via Depth-Spatial Alignment and Voxel Adaptation","created":"2023-11-28","cited_by_count":32,"area":null},{"id":"2406.18354","title":"Kolmogorov-Arnold Graph Neural Networks","created":"2024-06-26","cited_by_count":32,"area":null},{"id":"2206.05437","title":"ACMP: Allen-Cahn Message Passing with Attractive and Repulsive Forces for Graph Neural Networks","created":"2022-06-11","cited_by_count":31,"area":null}],"next_cursor":"100"}