{"list":"other","total":54,"rows":[{"id":"2002.05709","title":"A Simple Framework for Contrastive Learning of Visual Representations","created":"2020-02-13","cited_by_count":12049},{"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":"2006.07733","title":"Bootstrap your own latent: A new approach to self-supervised Learning","created":"2020-06-13","cited_by_count":4750},{"id":"1711.00937","title":"Neural Discrete Representation Learning","created":"2017-11-02","cited_by_count":4712},{"id":"1810.00826","title":"How Powerful are Graph Neural Networks?","created":"2018-10-01","cited_by_count":4393},{"id":"1704.01212","title":"Neural Message Passing for Quantum Chemistry","created":"2017-04-04","cited_by_count":3487},{"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":"1506.02626","title":"Learning both Weights and Connections for Efficient Neural Networks","created":"2015-06-08","cited_by_count":2031},{"id":"1902.07153","title":"Simplifying Graph Convolutional Networks","created":"2019-02-19","cited_by_count":1477},{"id":"2010.13902","title":"Graph Contrastive Learning with Augmentations","created":"2020-10-22","cited_by_count":1208},{"id":"1809.10341","title":"Deep Graph Infomax","created":"2018-09-27","cited_by_count":1106},{"id":"1811.05868","title":"Pitfalls of Graph Neural Network Evaluation","created":"2018-11-14","cited_by_count":1007},{"id":"1603.08861","title":"Revisiting Semi-Supervised Learning with Graph Embeddings","created":"2016-03-29","cited_by_count":976},{"id":"1612.00410","title":"Deep Variational Information Bottleneck","created":"2016-12-01","cited_by_count":930},{"id":"2007.02133","title":"Simple and Deep Graph Convolutional Networks","created":"2020-07-04","cited_by_count":860},{"id":"2005.10243","title":"What Makes for Good Views for Contrastive Learning?","created":"2020-05-20","cited_by_count":846},{"id":"1503.02406","title":"Deep Learning and the Information Bottleneck Principle","created":"2015-03-09","cited_by_count":802},{"id":"1906.00910","title":"Learning Representations by Maximizing Mutual Information Across Views","created":"2019-06-03","cited_by_count":734},{"id":"2007.08663","title":"TUDataset: A collection of benchmark datasets for learning with graphs","created":"2020-07-16","cited_by_count":728},{"id":"2006.05582","title":"Contrastive Multi-View Representation Learning on Graphs","created":"2020-06-10","cited_by_count":652},{"id":"1909.03211","title":"Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological View","created":"2019-09-07","cited_by_count":545},{"id":"2006.04131","title":"Deep Graph Contrastive Representation Learning","created":"2020-06-07","cited_by_count":539},{"id":"1904.03751","title":"DeepGCNs: Can GCNs Go as Deep as CNNs?","created":"2019-04-07","cited_by_count":527},{"id":"2010.14945","title":"Graph Contrastive Learning with Adaptive Augmentation","created":"2020-10-27","cited_by_count":519},{"id":"1908.09355","title":"Patient Knowledge Distillation for BERT Model Compression","created":"2019-08-25","cited_by_count":508},{"id":"1703.00810","title":"Opening the Black Box of Deep Neural Networks via Information","created":"2017-03-02","cited_by_count":503},{"id":"2205.10803","title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","created":"2022-05-22","cited_by_count":448},{"id":"1908.01000","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","created":"2019-07-31","cited_by_count":441},{"id":"1805.10965","title":"Lipschitz regularity of deep neural networks: analysis and efficient estimation","created":"2018-05-28","cited_by_count":415},{"id":"1502.02551","title":"Deep Learning with Limited Numerical Precision","created":"2015-02-09","cited_by_count":376},{"id":"2110.07875","title":"Graph Neural Networks with Learnable Structural and Positional Representations","created":"2021-10-15","cited_by_count":333},{"id":"2106.07594","title":"Graph Contrastive Learning Automated","created":"2021-06-10","cited_by_count":287},{"id":"1901.11365","title":"Noise2Self: Blind Denoising by Self-Supervision","created":"2019-01-30","cited_by_count":276},{"id":"1707.05005","title":"graph2vec: Learning Distributed Representations of Graphs","created":"2017-07-17","cited_by_count":230},{"id":"2006.06830","title":"Data Augmentation for Graph Neural Networks","created":"2020-06-11","cited_by_count":203},{"id":"2205.07308","title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","created":"2022-05-15","cited_by_count":179},{"id":"2110.08727","title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","created":"2021-10-17","cited_by_count":152},{"id":"2003.08983","title":"A unifying mutual information view of metric learning: cross-entropy vs. pairwise losses","created":"2020-03-19","cited_by_count":100},{"id":"2011.11545","title":"APAN: Asynchronous Propagation Attention Network for Real-time Temporal Graph Embedding","created":"2020-11-23","cited_by_count":78},{"id":"2106.04051","title":"Graph-MLP: Node Classification without Message Passing in Graph","created":"2021-06-08","cited_by_count":73},{"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},{"id":"2111.04840","title":"Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoods","created":"2021-11-08","cited_by_count":58},{"id":"2012.07064","title":"Pre-Training Graph Neural Networks for Cold-Start Users and Items Representation","created":"2020-12-13","cited_by_count":42},{"id":"2105.04528","title":"Accelerating Large Scale Real-Time GNN Inference using Channel Pruning","created":"2021-05-10","cited_by_count":41},{"id":"2210.05801","title":"Linkless Link Prediction via Relational Distillation","created":"2022-10-11","cited_by_count":39},{"id":"2310.18884","title":"Simple and Asymmetric Graph Contrastive Learning without Augmentations","created":"2023-10-29","cited_by_count":38},{"id":"2308.02117","title":"VQGraph: Rethinking Graph Representation Space for Bridging GNNs and MLPs","created":"2023-08-04","cited_by_count":35},{"id":"2210.00102","title":"MLPInit: Embarrassingly Simple GNN Training Acceleration with MLP Initialization","created":"2022-09-30","cited_by_count":31},{"id":"2010.15116","title":"On Graph Neural Networks versus Graph-Augmented MLPs","created":"2020-10-28","cited_by_count":30},{"id":"2202.08333","title":"Self-Supervised Representation Learning via Latent Graph Prediction","created":"2022-02-16","cited_by_count":22}],"next_cursor":null}