{"list":"other","total":96,"rows":[{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52096},{"id":"1412.6980","title":"Adam: A Method for Stochastic Optimization","created":"2014-12-22","cited_by_count":37240},{"id":"1609.02907","title":"Semi-Supervised Classification with Graph Convolutional Networks","created":"2016-09-09","cited_by_count":11361},{"id":"1503.02531","title":"Distilling the Knowledge in a Neural Network","created":"2015-03-09","cited_by_count":10324},{"id":"1710.10903","title":"Graph Attention Networks","created":"2017-10-30","cited_by_count":8923},{"id":"1706.02216","title":"Inductive Representation Learning on Large Graphs","created":"2017-06-07","cited_by_count":6320},{"id":"1810.00826","title":"How Powerful are Graph Neural Networks?","created":"2018-10-01","cited_by_count":4393},{"id":"1901.00596","title":"A Comprehensive Survey on Graph Neural Networks","created":"2019-01-03","cited_by_count":2919},{"id":"1903.02428","title":"Fast Graph Representation Learning with PyTorch Geometric","created":"2019-03-06","cited_by_count":2434},{"id":"1803.03635","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","created":"2018-03-09","cited_by_count":2262},{"id":"2005.00687","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","created":"2020-05-02","cited_by_count":2163},{"id":"1902.07153","title":"Simplifying Graph Convolutional Networks","created":"2019-02-19","cited_by_count":1477},{"id":"1806.01973","title":"Graph Convolutional Neural Networks for Web-Scale Recommender Systems","created":"2018-06-06","cited_by_count":1138},{"id":"1811.05868","title":"Pitfalls of Graph Neural Network Evaluation","created":"2018-11-14","cited_by_count":1007},{"id":"2007.02133","title":"Simple and Deep Graph Convolutional Networks","created":"2020-07-04","cited_by_count":860},{"id":"1806.08804","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","created":"2018-06-22","cited_by_count":787},{"id":"1509.09292","title":"Convolutional Networks on Graphs for Learning Molecular Fingerprints","created":"2015-09-30","cited_by_count":754},{"id":"1907.10903","title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","created":"2019-07-25","cited_by_count":680},{"id":"1912.05671","title":"Linear Mode Connectivity and the Lottery Ticket Hypothesis","created":"2019-12-11","cited_by_count":637},{"id":"1907.04931","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","created":"2019-07-10","cited_by_count":618},{"id":"1710.01878","title":"To prune, or not to prune: exploring the efficacy of pruning for model compression","created":"2017-10-05","cited_by_count":603},{"id":"2006.07988","title":"Adaptive Universal Generalized PageRank Graph Neural Network","created":"2020-06-14","cited_by_count":595},{"id":"1801.10247","title":"FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling","created":"2018-01-30","cited_by_count":584},{"id":"1905.07953","title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","created":"2019-05-20","cited_by_count":541},{"id":"1904.03751","title":"DeepGCNs: Can GCNs Go as Deep as CNNs?","created":"2019-04-07","cited_by_count":527},{"id":"2102.00554","title":"Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networks","created":"2021-01-31","cited_by_count":527},{"id":"2006.05929","title":"Dataset Condensation with Gradient Matching","created":"2020-06-10","cited_by_count":516},{"id":"1911.11134","title":"Rigging the Lottery: Making All Tickets Winners","created":"2019-11-25","cited_by_count":495},{"id":"1905.05178","title":"Graph U-Nets","created":"2019-05-11","cited_by_count":492},{"id":"2002.07376","title":"Picking Winning Tickets Before Training by Preserving Gradient Flow","created":"2020-02-18","cited_by_count":471},{"id":"1905.00067","title":"MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing","created":"2019-04-30","cited_by_count":443},{"id":"1904.08082","title":"Self-Attention Graph Pooling","created":"2019-04-17","cited_by_count":421},{"id":"2005.10203","title":"Graph Structure Learning for Robust Graph Neural Networks","created":"2020-05-20","cited_by_count":371},{"id":"2110.04181","title":"Dataset Condensation with Distribution Matching","created":"2021-10-08","cited_by_count":365},{"id":"2101.00797","title":"Beyond Low-frequency Information in Graph Convolutional Networks","created":"2021-01-04","cited_by_count":362},{"id":"1707.04780","title":"Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Science","created":"2017-07-15","cited_by_count":328},{"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},{"id":"2007.09296","title":"Towards Deeper Graph Neural Networks","created":"2020-07-18","cited_by_count":296},{"id":"2004.11198","title":"SIGN: Scalable Inception Graph Neural Networks","created":"2020-04-23","cited_by_count":284},{"id":"2007.12223","title":"The Lottery Ticket Hypothesis for Pre-trained BERT Networks","created":"2020-07-23","cited_by_count":275},{"id":"2006.13009","title":"Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddings","created":"2020-06-21","cited_by_count":214},{"id":"1907.04840","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","created":"2019-07-10","cited_by_count":213},{"id":"1905.01067","title":"Deconstructing Lottery Tickets: Zeros, Signs, and the Supermask","created":"2019-05-03","cited_by_count":207},{"id":"1902.05967","title":"Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterization","created":"2019-02-15","cited_by_count":189},{"id":"2102.04010","title":"Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch","created":"2021-02-08","cited_by_count":179},{"id":"2007.01570","title":"Scaling Graph Neural Networks with Approximate PageRank","created":"2020-07-03","cited_by_count":174},{"id":"1909.11957","title":"Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networks","created":"2019-09-26","cited_by_count":160},{"id":"1801.03226","title":"Adaptive Graph Convolutional Neural Networks","created":"2018-01-10","cited_by_count":155},{"id":"2110.08727","title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","created":"2021-10-17","cited_by_count":152},{"id":"2110.07580","title":"Graph Condensation for Graph Neural Networks","created":"2021-10-14","cited_by_count":150},{"id":"2003.10477","title":"Distilling Knowledge from Graph Convolutional Networks","created":"2020-03-23","cited_by_count":129},{"id":"2102.06790","title":"A Unified Lottery Ticket Hypothesis for Graph Neural Networks","created":"2021-02-12","cited_by_count":118},{"id":"2102.02887","title":"Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Training","created":"2021-02-04","cited_by_count":110},{"id":"2102.05034","title":"SLAPS: Self-Supervision Improves Structure Learning for Graph Neural Networks","created":"2021-02-09","cited_by_count":110},{"id":"2008.05000","title":"Degree-Quant: Quantization-Aware Training for Graph Neural Networks","created":"2020-08-11","cited_by_count":96},{"id":"2106.10404","title":"Sparse Training via Boosting Pruning Plasticity with Neuroregeneration","created":"2021-06-19","cited_by_count":84},{"id":"1911.05954","title":"Hierarchical Graph Pooling with Structure Learning","created":"2019-11-14","cited_by_count":81},{"id":"2112.08903","title":"Graph Structure Learning with Variational Information Bottleneck","created":"2021-12-16","cited_by_count":81},{"id":"2106.05150","title":"Scaling Up Graph Neural Networks Via Graph Coarsening","created":"2021-06-09","cited_by_count":80},{"id":"2010.03533","title":"Gradient Flow in Sparse Neural Networks and How Lottery Tickets Win","created":"2020-10-07","cited_by_count":77},{"id":"1704.05119","title":"Exploring Sparsity in Recurrent Neural Networks","created":"2017-04-17","cited_by_count":75},{"id":"1910.06849","title":"DeepGCNs: Making GCNs Go as Deep as CNNs","created":"2019-10-15","cited_by_count":72},{"id":"2103.03036","title":"A Survey on Graph Structure Learning: Progress and Opportunities","created":"2021-03-04","cited_by_count":71},{"id":"1912.00195","title":"SGAS: Sequential Greedy Architecture Search","created":"2019-11-30","cited_by_count":69},{"id":"1802.07510","title":"Spectrally approximating large graphs with smaller graphs","created":"2018-02-21","cited_by_count":56},{"id":"2002.09518","title":"Memory-Based Graph Networks","created":"2020-02-21","cited_by_count":56},{"id":"2102.01350","title":"Graph Coarsening with Neural Networks","created":"2021-02-02","cited_by_count":55},{"id":"2107.00166","title":"Sanity Checks for Lottery Tickets: Does Your Winning Ticket Really Win the Jackpot?","created":"2021-07-01","cited_by_count":52},{"id":"2204.07321","title":"Graph Pooling for Graph Neural Networks: Progress, Challenges, and Opportunities","created":"2022-04-15","cited_by_count":52},{"id":"2104.06608","title":"Search to aggregate neighborhood for graph neural network","created":"2021-04-14","cited_by_count":48},{"id":"2105.07519","title":"Graph-Free Knowledge Distillation for Graph Neural Networks","created":"2021-05-16","cited_by_count":46},{"id":"2010.09834","title":"Topology-Aware Graph Pooling Networks","created":"2020-10-19","cited_by_count":44},{"id":"2106.03225","title":"Efficient Lottery Ticket Finding: Less Data is More","created":"2021-06-06","cited_by_count":44},{"id":"2105.04528","title":"Accelerating Large Scale Real-Time GNN Inference using Channel Pruning","created":"2021-05-10","cited_by_count":41},{"id":"2103.05872","title":"Sampling methods for efficient training of graph convolutional networks: A survey","created":"2021-03-10","cited_by_count":40},{"id":"2103.00742","title":"Automated Machine Learning on Graphs: A Survey","created":"2021-03-01","cited_by_count":39},{"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},{"id":"1810.11899","title":"Accurate, Efficient and Scalable Graph Embedding","created":"2018-10-28","cited_by_count":35},{"id":"2011.02255","title":"On Self-Distilling Graph Neural Network","created":"2020-11-04","cited_by_count":35},{"id":"2012.15823","title":"Binary Graph Neural Networks","created":"2020-12-31","cited_by_count":34},{"id":"2106.00134","title":"GANs Can Play Lottery Tickets Too","created":"2021-05-31","cited_by_count":32},{"id":"2010.01804","title":"Graph Cross Networks with Vertex Infomax Pooling","created":"2020-10-05","cited_by_count":31},{"id":"1910.11436","title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","created":"2019-10-24","cited_by_count":30},{"id":"2010.07565","title":"Bi-GCN: Binary Graph Convolutional Network","created":"2020-10-15","cited_by_count":28},{"id":"2103.00794","title":"Early-Bird GCNs: Graph-Network Co-Optimization Towards More Efficient GCN Training and Inference via Drawing Early-Bird Lottery Tickets","created":"2021-03-01","cited_by_count":27},{"id":"2202.04822","title":"Survey on Graph Neural Network Acceleration: An Algorithmic Perspective","created":"2022-02-10","cited_by_count":26},{"id":"2206.12755","title":"Training Your Sparse Neural Network Better with Any Mask","created":"2022-06-26","cited_by_count":26},{"id":"2102.01670","title":"Keep the Gradients Flowing: Using Gradient Flow to Study Sparse Network Optimization","created":"2021-02-02","cited_by_count":22},{"id":"1907.00832","title":"iPool -- Information-based Pooling in Hierarchical Graph Neural Networks","created":"2019-07-01","cited_by_count":21},{"id":"2002.07206","title":"Ripple Walk Training: A Subgraph-based training framework for Large and Deep Graph Neural Network","created":"2020-02-17","cited_by_count":19},{"id":"2002.00848","title":"Structure-Feature based Graph Self-adaptive Pooling","created":"2020-01-30","cited_by_count":18},{"id":"2111.00162","title":"You are caught stealing my winning lottery ticket! Making a lottery ticket claim its ownership","created":"2021-10-30","cited_by_count":18},{"id":"2102.07655","title":"Dense for the Price of Sparse: Improved Performance of Sparsely Initialized Networks via a Subspace Offset","created":"2021-02-12","cited_by_count":9},{"id":"2108.07548","title":"HAWK: Rapid Android Malware Detection through Heterogeneous Graph Attention Networks","created":"2021-08-17","cited_by_count":9},{"id":"2109.10061","title":"Graph Neural Networks for Graph Drawing","created":"2021-09-21","cited_by_count":8},{"id":"2104.03058","title":"Optimizing Memory Efficiency of Graph Neural Networks on Edge Computing Platforms","created":"2021-04-07","cited_by_count":6}],"next_cursor":null}