{"list":"other","total":51,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"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":"1912.01703","title":"PyTorch: An Imperative Style, High-Performance Deep Learning Library","created":"2019-12-03","cited_by_count":20305},{"id":"1609.02907","title":"Semi-Supervised Classification with Graph Convolutional Networks","created":"2016-09-09","cited_by_count":11361},{"id":"1710.10903","title":"Graph Attention Networks","created":"2017-10-30","cited_by_count":8923},{"id":"1807.03748","title":"Representation Learning with Contrastive Predictive Coding","created":"2018-07-10","cited_by_count":7777},{"id":"1706.02216","title":"Inductive Representation Learning on Large Graphs","created":"2017-06-07","cited_by_count":6320},{"id":"1907.10902","title":"Optuna: A Next-generation Hyperparameter Optimization Framework","created":"2019-07-25","cited_by_count":2501},{"id":"1903.02428","title":"Fast Graph Representation Learning with PyTorch Geometric","created":"2019-03-06","cited_by_count":2434},{"id":"2005.00687","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","created":"2020-05-02","cited_by_count":2163},{"id":"1806.01261","title":"Relational inductive biases, deep learning, and graph networks","created":"2018-06-04","cited_by_count":1360},{"id":"1808.06670","title":"Learning deep representations by mutual information estimation and maximization","created":"2018-08-20","cited_by_count":1273},{"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":"1611.08097","title":"Geometric deep learning: going beyond Euclidean data","created":"2016-11-24","cited_by_count":1048},{"id":"1802.09691","title":"Link Prediction Based on Graph Neural Networks","created":"2018-02-27","cited_by_count":832},{"id":"1511.05493","title":"Gated Graph Sequence Neural Networks","created":"2015-11-17","cited_by_count":796},{"id":"1903.03894","title":"GNNExplainer: Generating Explanations for Graph Neural Networks","created":"2019-03-10","cited_by_count":737},{"id":"2006.08218","title":"Self-supervised Learning: Generative or Contrastive","created":"2020-06-15","cited_by_count":694},{"id":"1801.04062","title":"MINE: Mutual Information Neural Estimation","created":"2018-01-12","cited_by_count":683},{"id":"1907.10903","title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","created":"2019-07-25","cited_by_count":680},{"id":"2003.00982","title":"Benchmarking Graph Neural Networks","created":"2020-03-02","cited_by_count":680},{"id":"2006.05582","title":"Contrastive Multi-View Representation Learning on Graphs","created":"2020-06-10","cited_by_count":652},{"id":"1907.04931","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","created":"2019-07-10","cited_by_count":618},{"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":"1606.00709","title":"f-GAN: Training Generative Neural Samplers using Variational Divergence Minimization","created":"2016-06-02","cited_by_count":506},{"id":"2006.09963","title":"GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training","created":"2020-06-17","cited_by_count":463},{"id":"1511.06452","title":"Deep Metric Learning via Lifted Structured Feature Embedding","created":"2015-11-19","cited_by_count":449},{"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":"2010.10144","title":"Keystroke Dynamics as Part of Lifelogging","created":"2020-10-20","cited_by_count":334},{"id":"1907.13625","title":"On Mutual Information Maximization for Representation Learning","created":"2019-07-31","cited_by_count":316},{"id":"1605.05273","title":"Learning Convolutional Neural Networks for Graphs","created":"2016-05-17","cited_by_count":314},{"id":"2006.09252","title":"Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting","created":"2020-06-16","cited_by_count":313},{"id":"1911.06962","title":"Inductive Relation Prediction by Subgraph Reasoning","created":"2019-11-16","cited_by_count":239},{"id":"2002.01169","title":"Graph Representation Learning via Graphical Mutual Information Maximization","created":"2020-02-04","cited_by_count":217},{"id":"1903.12355","title":"Local Aggregation for Unsupervised Learning of Visual Embeddings","created":"2019-03-29","cited_by_count":204},{"id":"2001.06362","title":"Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networks","created":"2020-01-17","cited_by_count":153},{"id":"2010.05563","title":"Graph Information Bottleneck for Subgraph Recognition","created":"2020-10-12","cited_by_count":119},{"id":"2109.01116","title":"An Empirical Study of Graph Contrastive Learning","created":"2021-09-02","cited_by_count":113},{"id":"1911.06750","title":"Unsupervised Attributed Multiplex Network Embedding","created":"2019-11-15","cited_by_count":95},{"id":"2009.10273","title":"Sub-graph Contrast for Scalable Self-Supervised Graph Representation Learning","created":"2020-09-22","cited_by_count":90},{"id":"2006.07889","title":"Graph Meta Learning via Local Subgraphs","created":"2020-06-14","cited_by_count":89},{"id":"2102.07810","title":"HDMI: High-order Deep Multiplex Infomax","created":"2021-02-15","cited_by_count":82},{"id":"2101.08170","title":"SUGAR: Subgraph Neural Network with Reinforcement Pooling and Self-Supervised Mutual Information Mechanism","created":"2021-01-20","cited_by_count":75},{"id":"2006.10538","title":"Subgraph Neural Networks","created":"2020-06-18","cited_by_count":73},{"id":"1406.3676","title":"Question Answering with Subgraph Embeddings","created":"2014-06-14","cited_by_count":58},{"id":"2010.02037","title":"Conditional Negative Sampling for Contrastive Learning of Visual Representations","created":"2020-10-05","cited_by_count":57},{"id":"2010.01804","title":"Graph Cross Networks with Vertex Infomax Pooling","created":"2020-10-05","cited_by_count":31},{"id":"2012.05442","title":"Bipartite Graph Embedding via Mutual Information Maximization","created":"2020-12-10","cited_by_count":29},{"id":"1811.09702","title":"Homogeneity-Based Transmissive Process to Model True and False News in Social Networks","created":"2018-11-16","cited_by_count":2}],"next_cursor":null}