{"list":"other","total":67,"rows":[{"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":"1710.10903","title":"Graph Attention Networks","created":"2017-10-30","cited_by_count":8923},{"id":"1704.01212","title":"Neural Message Passing for Quantum Chemistry","created":"2017-04-04","cited_by_count":3487},{"id":"1611.01144","title":"Categorical Reparameterization with Gumbel-Softmax","created":"2016-11-03","cited_by_count":2739},{"id":"1907.10902","title":"Optuna: A Next-generation Hyperparameter Optimization Framework","created":"2019-07-25","cited_by_count":2501},{"id":"1812.08434","title":"Graph Neural Networks: A Review of Methods and Applications","created":"2018-12-20","cited_by_count":1576},{"id":"1902.07153","title":"Simplifying Graph Convolutional Networks","created":"2019-02-19","cited_by_count":1477},{"id":"1611.00712","title":"The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables","created":"2016-11-02","cited_by_count":1148},{"id":"1806.01973","title":"Graph Convolutional Neural Networks for Web-Scale Recommender Systems","created":"2018-06-06","cited_by_count":1138},{"id":"1810.05997","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","created":"2018-10-14","cited_by_count":993},{"id":"1806.03536","title":"Representation Learning on Graphs with Jumping Knowledge Networks","created":"2018-06-09","cited_by_count":877},{"id":"2007.02133","title":"Simple and Deep Graph Convolutional Networks","created":"2020-07-04","cited_by_count":860},{"id":"2002.05287","title":"Geom-GCN: Geometric Graph Convolutional Networks","created":"2020-02-13","cited_by_count":826},{"id":"2006.07988","title":"Adaptive Universal Generalized PageRank Graph Neural Network","created":"2020-06-14","cited_by_count":595},{"id":"1909.13021","title":"Multi-scale Attributed Node Embedding","created":"2019-09-28","cited_by_count":548},{"id":"1812.04202","title":"Deep Learning on Graphs: A Survey","created":"2018-12-11","cited_by_count":393},{"id":"2005.10203","title":"Graph Structure Learning for Robust Graph Neural Networks","created":"2020-05-20","cited_by_count":371},{"id":"2101.00797","title":"Beyond Low-frequency Information in Graph Convolutional Networks","created":"2021-01-04","cited_by_count":362},{"id":"2006.09252","title":"Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting","created":"2020-06-16","cited_by_count":313},{"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":"1812.02230","title":"Towards a Definition of Disentangled Representations","created":"2018-12-05","cited_by_count":296},{"id":"1905.09550","title":"Revisiting Graph Neural Networks: All We Have is Low-Pass Filters","created":"2019-05-23","cited_by_count":261},{"id":"1711.00740","title":"Learning to Represent Programs with Graphs","created":"2017-11-01","cited_by_count":220},{"id":"2009.13566","title":"Graph Neural Networks with Heterophily","created":"2020-09-28","cited_by_count":202},{"id":"1901.01343","title":"Graph Neural Networks with convolutional ARMA filters","created":"2019-01-05","cited_by_count":185},{"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},{"id":"2106.06134","title":"Is Homophily a Necessity for Graph Neural Networks?","created":"2021-06-11","cited_by_count":182},{"id":"2205.07308","title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","created":"2022-05-15","cited_by_count":179},{"id":"2201.12987","title":"Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanism","created":"2022-01-31","cited_by_count":171},{"id":"2006.03589","title":"Higher-Order Explanations of Graph Neural Networks via Relevant Walks","created":"2020-06-05","cited_by_count":138},{"id":"1807.09596","title":"Contextual Stochastic Block Models","created":"2018-07-23","cited_by_count":134},{"id":"2101.11859","title":"Interpreting and Unifying Graph Neural Networks with An Optimization Framework","created":"2021-01-28","cited_by_count":131},{"id":"2011.07057","title":"Learning to Drop: Robust Graph Neural Network via Topological Denoising","created":"2020-11-13","cited_by_count":127},{"id":"2010.01777","title":"A Unified View on Graph Neural Networks as Graph Signal Denoising","created":"2020-10-05","cited_by_count":110},{"id":"2110.15438","title":"InfoGCL: Information-Aware Graph Contrastive Learning","created":"2021-10-28","cited_by_count":105},{"id":"2204.04879","title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision","created":"2022-04-11","cited_by_count":102},{"id":"2106.04319","title":"Breaking the Limits of Message Passing Graph Neural Networks","created":"2021-06-08","cited_by_count":101},{"id":"1712.02621","title":"Disentangled Person Image Generation","created":"2017-12-07","cited_by_count":98},{"id":"2002.06755","title":"Unifying Graph Convolutional Neural Networks and Label Propagation","created":"2020-02-17","cited_by_count":98},{"id":"2106.06586","title":"Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patterns","created":"2021-06-11","cited_by_count":95},{"id":"2005.14612","title":"Non-Local Graph Neural Networks","created":"2020-05-29","cited_by_count":91},{"id":"2104.01404","title":"New Benchmarks for Learning on Non-Homophilous Graphs","created":"2021-04-03","cited_by_count":81},{"id":"2112.08903","title":"Graph Structure Learning with Variational Information Bottleneck","created":"2021-12-16","cited_by_count":81},{"id":"2010.05421","title":"Factorizable Graph Convolutional Networks","created":"2020-10-12","cited_by_count":79},{"id":"2003.08414","title":"Scattering GCN: Overcoming Oversmoothness in Graph Convolutional Networks","created":"2020-03-18","cited_by_count":57},{"id":"2006.15097","title":"Policy-GNN: Aggregation Optimization for Graph Neural Networks","created":"2020-06-26","cited_by_count":48},{"id":"1909.03051","title":"On Learning Disentangled Representations for Gait Recognition","created":"2019-09-05","cited_by_count":43},{"id":"1911.11430","title":"Independence Promoted Graph Disentangled Networks","created":"2019-11-26","cited_by_count":38},{"id":"2001.07620","title":"EdgeNets:Edge Varying Graph Neural Networks","created":"2020-01-21","cited_by_count":36},{"id":"2204.11028","title":"Reinforced Causal Explainer for Graph Neural Networks","created":"2022-04-23","cited_by_count":34},{"id":"1805.08672","title":"Information Constraints on Auto-Encoding Variational Bayes","created":"2018-05-22","cited_by_count":33},{"id":"2111.03220","title":"Augmentations in Graph Contrastive Learning: Current Methodological Flaws & Towards Better Practices","created":"2021-11-05","cited_by_count":25},{"id":"2006.05385","title":"Interpretable Deep Graph Generation with Node-Edge Co-Disentanglement","created":"2020-06-09","cited_by_count":24},{"id":"1501.06218","title":"Infinite Edge Partition Models for Overlapping Community Detection and Link Prediction","created":"2015-01-25","cited_by_count":23},{"id":"2202.11245","title":"Exploring Edge Disentanglement for Node Classification","created":"2022-02-23","cited_by_count":23},{"id":"2202.11425","title":"Multi-view Intent Disentangle Graph Networks for Bundle Recommendation","created":"2022-02-23","cited_by_count":22},{"id":"2201.11932","title":"Deep Generative Model for Periodic Graphs","created":"2022-01-28","cited_by_count":20},{"id":"2111.00531","title":"Learning Debiased and Disentangled Representations for Semantic Segmentation","created":"2021-10-31","cited_by_count":16},{"id":"2204.01376","title":"Synthetic Graph Generation to Benchmark Graph Learning","created":"2022-04-04","cited_by_count":16},{"id":"2203.10280","title":"Meta-Weight Graph Neural Network: Push the Limits Beyond Global Homophily","created":"2022-03-19","cited_by_count":14},{"id":"2203.00411","title":"Disentangled Spatiotemporal Graph Generative Models","created":"2022-02-28","cited_by_count":12},{"id":"2201.03482","title":"Disentangled Graph Neural Networks for Session-based Recommendation","created":"2022-01-10","cited_by_count":8},{"id":"2202.03233","title":"A Variational Edge Partition Model for Supervised Graph Representation Learning","created":"2022-02-07","cited_by_count":6},{"id":"2103.07295","title":"Adversarial Graph Disentanglement","created":"2021-03-12","cited_by_count":5},{"id":"2111.10539","title":"Edge-Enhanced Global Disentangled Graph Neural Network for Sequential Recommendation","created":"2021-11-20","cited_by_count":3},{"id":"2204.13429","title":"DOTIN: Dropping Task-Irrelevant Nodes for GNNs","created":"2022-04-28","cited_by_count":2}],"next_cursor":null}