{"total":73,"rows":[{"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.13697","title":"Graph Condensation via Receptive Field Distribution Matching","created":"2022-06-28","cited_by_count":60,"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":"2205.07865","title":"Simple Contrastive Graph Clustering","created":"2022-05-11","cited_by_count":56,"area":null},{"id":"2211.10738","title":"Knowledge Graph Contrastive Learning Based on Relation-Symmetrical Structure","created":"2022-11-19","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":"2210.05801","title":"Linkless Link Prediction via Relational Distillation","created":"2022-10-11","cited_by_count":39,"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":"2210.00102","title":"MLPInit: Embarrassingly Simple GNN Training Acceleration with MLP Initialization","created":"2022-09-30","cited_by_count":31,"area":null},{"id":"2304.10668","title":"Train Your Own GNN Teacher: Graph-Aware Distillation on Textual Graphs","created":"2023-04-20","cited_by_count":29,"area":null},{"id":"2208.10010","title":"NOSMOG: Learning Noise-robust and Structure-aware MLPs on Graphs","created":"2022-08-22","cited_by_count":14,"area":null},{"id":"2204.12656","title":"SCGC : Self-Supervised Contrastive Graph Clustering","created":"2022-04-27","cited_by_count":13,"area":null},{"id":"2210.01953","title":"Robust Fair Clustering: A Novel Fairness Attack and Defense Framework","created":"2022-10-04","cited_by_count":13,"area":null},{"id":"2210.09609","title":"SA-MLP: Distilling Graph Knowledge from GNNs into Structure-Aware MLP","created":"2022-10-18","cited_by_count":12,"area":"distill"},{"id":"2211.16878","title":"Transformers are Short Text Classifiers: A Study of Inductive Short Text Classifiers on Benchmarks and Real-world Datasets","created":"2022-11-30","cited_by_count":12,"area":null},{"id":"2502.18771","title":"Exploring Graph Learning Tasks with Pure LLMs: A Comprehensive Benchmark and Investigation","created":"2025-02-26","cited_by_count":12,"area":null},{"id":"2112.10558","title":"Lifelong Learning on Evolving Graphs Under the Constraints of Imbalanced Classes and New Classes","created":"2021-12-20","cited_by_count":11,"area":null},{"id":"2405.16435","title":"Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning","created":"2024-05-26","cited_by_count":10,"area":null},{"id":"2203.12265","title":"Node Representation Learning in Graph via Node-to-Neighbourhood Mutual Information Maximization","created":"2022-03-23","cited_by_count":9,"area":null},{"id":"2403.16137","title":"A Survey on Self-Supervised Graph Foundation Models: Knowledge-Based Perspective","created":"2024-03-24","cited_by_count":9,"area":null},{"id":"2403.03483","title":"A Teacher-Free Graph Knowledge Distillation Framework with Dual Self-Distillation","created":"2024-03-06","cited_by_count":8,"area":"distill"},{"id":"2412.03864","title":"Training MLPs on Graphs without Supervision","created":"2024-12-05","cited_by_count":8,"area":null},{"id":"2109.00217","title":"Multi-Sample based Contrastive Loss for Top-k Recommendation","created":"2021-09-01","cited_by_count":7,"area":null},{"id":"2303.13763","title":"Edge-free but Structure-aware: Prototype-Guided Knowledge Distillation from GNNs to MLPs","created":"2023-03-24","cited_by_count":7,"area":"distill"},{"id":"2312.11862","title":"Topo-MLP : A Simplicial Network Without Message Passing","created":"2023-12-19","cited_by_count":7,"area":null},{"id":"2210.02097","title":"Teaching Yourself: Graph Self-Distillation on Neighborhood for Node Classification","created":"2022-10-05","cited_by_count":6,"area":"distill"},{"id":"2409.08658","title":"Promoting Fairness in Link Prediction with Graph Enhancement","created":"2024-09-13","cited_by_count":6,"area":null},{"id":"2308.14172","title":"A Markov Random Field model for Hypergraph-based Machine Learning","created":"2023-08-27","cited_by_count":5,"area":null},{"id":"2310.12565","title":"Open-World Lifelong Graph Learning","created":"2023-10-19","cited_by_count":5,"area":null},{"id":"2312.09778","title":"Hypergraph-MLP: Learning on Hypergraphs without Message Passing","created":"2023-12-15","cited_by_count":5,"area":null},{"id":"2407.11025","title":"Backdoor Graph Condensation","created":"2024-07-03","cited_by_count":5,"area":null},{"id":"2412.11180","title":"TINED: GNNs-to-MLPs by Teacher Injection and Dirichlet Energy Distillation","created":"2024-12-15","cited_by_count":5,"area":null},{"id":"2412.19106","title":"ERGNN: Spectral Graph Neural Network With Explicitly-Optimized Rational Graph Filters","created":"2024-12-26","cited_by_count":5,"area":null},{"id":"2206.03638","title":"Alternately Optimized Graph Neural Networks","created":"2022-06-08","cited_by_count":4,"area":null},{"id":"2302.14189","title":"You Only Transfer What You Share: Intersection-Induced Graph Transfer Learning for Link Prediction","created":"2023-02-27","cited_by_count":4,"area":null},{"id":"2411.19230","title":"Pre-Training Graph Contrastive Masked Autoencoders are Strong Distillers for EEG","created":"2024-11-28","cited_by_count":4,"area":"distill"},{"id":"2412.17355","title":"Bi-Directional Multi-Scale Graph Dataset Condensation via Information Bottleneck","created":"2024-12-23","cited_by_count":4,"area":null},{"id":"2407.18910","title":"Do We Really Need Graph Convolution During Training? Light Post-Training Graph-ODE for Efficient Recommendation","created":"2024-07-26","cited_by_count":3,"area":null},{"id":"2407.21742","title":"HGOE: Hybrid External and Internal Graph Outlier Exposure for Graph Out-of-Distribution Detection","created":"2024-07-31","cited_by_count":3,"area":null},{"id":"2208.06743","title":"Enhancing Graph Contrastive Learning with Node Similarity","created":"2022-08-13","cited_by_count":2,"area":null},{"id":"2209.14067","title":"Efficient block contrastive learning via parameter-free meta-node approximation","created":"2022-09-28","cited_by_count":2,"area":null},{"id":"2302.00109","title":"OrthoReg: Improving Graph-regularized MLPs via Orthogonality Regularization","created":"2023-01-31","cited_by_count":2,"area":null},{"id":"2302.04626","title":"Self-Supervised Node Representation Learning via Node-to-Neighbourhood Alignment","created":"2023-02-09","cited_by_count":2,"area":null},{"id":"2306.09121","title":"The Split Matters: Flat Minima Methods for Improving the Performance of GNNs","created":"2023-06-15","cited_by_count":2,"area":null},{"id":"2402.05934","title":"Classifying Nodes in Graphs without GNNs","created":"2024-02-08","cited_by_count":2,"area":null},{"id":"2403.16033","title":"Node Classification via Semantic-Structural Attention-Enhanced Graph Convolutional Networks","created":"2024-03-24","cited_by_count":2,"area":null},{"id":"2406.11919","title":"Graph Knowledge Distillation to Mixture of Experts","created":"2024-06-17","cited_by_count":2,"area":"moe"},{"id":"2412.08310","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","created":"2024-12-11","cited_by_count":2,"area":null},{"id":"2505.11538","title":"BrainNetMLP: An Efficient and Effective Baseline for Functional Brain Network Classification","created":"2025-05-14","cited_by_count":2,"area":null},{"id":"2509.21097","title":"GraphUniverse: Synthetic Graph Generation for Evaluating Inductive Generalization","created":"2025-09-25","cited_by_count":2,"area":null},{"id":"2306.10123","title":"Dual Node and Edge Fairness-Aware Graph Partition","created":"2023-06-16","cited_by_count":1,"area":null},{"id":"2311.17781","title":"Propagate & Distill: Towards Effective Graph Learners Using Propagation-Embracing MLPs","created":"2023-11-29","cited_by_count":1,"area":"distill"},{"id":"2402.02321","title":"Active Learning for Graphs with Noisy Structures","created":"2024-02-04","cited_by_count":1,"area":null},{"id":"2403.04763","title":"BloomGML: Graph Machine Learning through the Lens of Bilevel Optimization","created":"2024-03-07","cited_by_count":1,"area":null},{"id":"2407.11596","title":"HyperAggregation: Aggregating over Graph Edges with Hypernetworks","created":"2024-07-16","cited_by_count":1,"area":null},{"id":"2411.01532","title":"SPARC: Spectral Architectures Tackling the Cold-Start Problem in Graph Learning","created":"2024-11-03","cited_by_count":1,"area":null},{"id":"2502.01177","title":"Deep Graph Learning will stall without Network Science","created":"2025-02-03","cited_by_count":1,"area":null},{"id":"2203.05919","title":"Graph Summarization with Graph Neural Networks","created":"2022-03-11","cited_by_count":0,"area":null},{"id":"2305.19502","title":"Graph Entropy Minimization for Semi-supervised Node Classification","created":"2023-05-31","cited_by_count":0,"area":null},{"id":"2310.00183","title":"On the Equivalence of Graph Convolution and Mixup","created":"2023-09-29","cited_by_count":0,"area":null},{"id":"2311.11759","title":"Unveiling the Unseen Potential of Graph Learning through MLPs: Effective Graph Learners Using Propagation-Embracing MLPs","created":"2023-11-20","cited_by_count":0,"area":"distill"},{"id":"2311.15448","title":"GGNNs : Generalizing GNNs using Residual Connections and Weighted Message Passing","created":"2023-11-26","cited_by_count":0,"area":null},{"id":"2402.08918","title":"SimMLP: Training MLPs on Graphs without Supervision","created":"2024-02-14","cited_by_count":0,"area":null},{"id":"2403.01079","title":"Teaching MLP More Graph Information: A Three-stage Multitask Knowledge Distillation Framework","created":"2024-03-02","cited_by_count":0,"area":"distill"},{"id":"2405.04114","title":"Acceleration Algorithms in GNNs: A Survey","created":"2024-05-07","cited_by_count":0,"area":null},{"id":"2406.09926","title":"POWN: Prototypical Open-World Node Classification","created":"2024-06-14","cited_by_count":0,"area":null},{"id":"2407.18042","title":"Lifelong Graph Learning for Graph Summarization","created":"2024-07-25","cited_by_count":0,"area":null},{"id":"2408.04895","title":"Better Not to Propagate: Understanding Edge Uncertainty and Over-smoothing in Signed Graph Neural Networks","created":"2024-08-09","cited_by_count":0,"area":null},{"id":"2409.05573","title":"Learning to Model Graph Structural Information on MLPs via Graph Structure Self-Contrasting","created":"2024-09-09","cited_by_count":0,"area":null},{"id":"2410.19723","title":"Sparse Decomposition of Graph Neural Networks","created":"2024-10-25","cited_by_count":0,"area":null},{"id":"2411.06212","title":"Multistage non-deterministic classification using secondary concept graphs and graph convolutional networks for high-level feature extraction","created":"2024-11-09","cited_by_count":0,"area":null},{"id":"2505.10307","title":"Negative Metric Learning for Graphs","created":"2025-05-15","cited_by_count":0,"area":null},{"id":"2506.05039","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","created":"2025-06-05","cited_by_count":0,"area":null}],"next_cursor":null}