{"list":"other","total":81,"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":"1704.01212","title":"Neural Message Passing for Quantum Chemistry","created":"2017-04-04","cited_by_count":3487},{"id":"1903.02428","title":"Fast Graph Representation Learning with PyTorch Geometric","created":"2019-03-06","cited_by_count":2434},{"id":"1703.06114","title":"Deep Sets","created":"2017-03-10","cited_by_count":1421},{"id":"1801.07606","title":"Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learning","created":"2018-01-22","cited_by_count":1102},{"id":"1810.05997","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","created":"2018-10-14","cited_by_count":993},{"id":"2002.05287","title":"Geom-GCN: Geometric Graph Convolutional Networks","created":"2020-02-13","cited_by_count":826},{"id":"1909.01377","title":"Deep Equilibrium Models","created":"2019-09-03","cited_by_count":615},{"id":"2006.07988","title":"Adaptive Universal Generalized PageRank Graph Neural Network","created":"2020-06-14","cited_by_count":595},{"id":"1809.09401","title":"Hypergraph Neural Networks","created":"2018-09-25","cited_by_count":488},{"id":"1912.10557","title":"Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processing","created":"2019-12-22","cited_by_count":421},{"id":"1704.03264","title":"Learning Deep CNN Denoiser Prior for Image Restoration","created":"2017-04-11","cited_by_count":408},{"id":"1812.09902","title":"Invariant and Equivariant Graph Networks","created":"2018-12-24","cited_by_count":346},{"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":"1503.00759","title":"A Review of Relational Machine Learning for Knowledge Graphs","created":"2015-03-02","cited_by_count":265},{"id":"2106.10934","title":"GRAND: Graph Neural Diffusion","created":"2021-06-21","cited_by_count":258},{"id":"1605.01710","title":"Plug-and-Play ADMM for Image Restoration: Fixed Point Convergence and Applications","created":"2016-05-05","cited_by_count":246},{"id":"1901.08150","title":"Hypergraph Convolution and Hypergraph Attention","created":"2019-01-23","cited_by_count":228},{"id":"1502.03240","title":"Conditional Random Fields as Recurrent Neural Networks","created":"2015-02-11","cited_by_count":214},{"id":"2103.12828","title":"Learning to Optimize: A Primer and A Benchmark","created":"2021-03-23","cited_by_count":208},{"id":"1905.05406","title":"Plug-and-Play Methods Provably Converge with Properly Trained Denoisers","created":"2019-05-14","cited_by_count":198},{"id":"1508.02848","title":"Trainable Nonlinear Reaction Diffusion: A Flexible Framework for Fast and Effective Image Restoration","created":"2015-08-12","cited_by_count":195},{"id":"2005.03675","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","created":"2020-05-07","cited_by_count":156},{"id":"1807.09596","title":"Contextual Stochastic Block Models","created":"2018-07-23","cited_by_count":134},{"id":"2006.01764","title":"Networks beyond pairwise interactions: structure and dynamics","created":"2020-06-02","cited_by_count":130},{"id":"2105.00956","title":"UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks","created":"2021-05-03","cited_by_count":130},{"id":"2106.13264","title":"You are AllSet: A Multiset Function Framework for Hypergraph Neural Networks","created":"2021-06-24","cited_by_count":127},{"id":"1908.06315","title":"Implicit Deep Learning","created":"2019-08-17","cited_by_count":124},{"id":"1612.08447","title":"Higher-order organization of complex networks","created":"2016-12-26","cited_by_count":110},{"id":"2006.12278","title":"HNHN: Hypergraph Networks with Hyperedge Neurons","created":"2020-06-22","cited_by_count":109},{"id":"1704.03488","title":"Learning Proximal Operators: Using Denoising Networks for Regularizing Inverse Imaging Problems","created":"2017-04-11","cited_by_count":107},{"id":"2009.06211","title":"Implicit Graph Neural Networks","created":"2020-09-14","cited_by_count":100},{"id":"1811.01900","title":"Janossy Pooling: Learning Deep Permutation-Invariant Functions for Variable-Size Inputs","created":"2018-11-05","cited_by_count":98},{"id":"1901.09006","title":"On the Limitations of Representing Functions on Sets","created":"2019-01-25","cited_by_count":90},{"id":"1808.10038","title":"Theoretical Linear Convergence of Unfolded ISTA and its Practical Weights and Thresholds","created":"2018-08-29","cited_by_count":85},{"id":"2101.05510","title":"Signal Processing on Higher-Order Networks: Livin' on the Edge ... and Beyond","created":"2021-01-14","cited_by_count":82},{"id":"1409.2574","title":"Deep Unfolding: Model-Based Inspiration of Novel Deep Architectures","created":"2014-09-09","cited_by_count":77},{"id":"2012.06852","title":"Self-Supervised Hypergraph Convolutional Networks for Session-based Recommendation","created":"2020-12-12","cited_by_count":75},{"id":"1703.09912","title":"One Network to Solve Them All --- Solving Linear Inverse Problems using Deep Projection Models","created":"2017-03-29","cited_by_count":67},{"id":"2107.06996","title":"Elastic Graph Neural Networks","created":"2021-07-05","cited_by_count":67},{"id":"1406.7444","title":"Learning to Deblur","created":"2014-06-28","cited_by_count":66},{"id":"2103.06064","title":"Graph Neural Networks Inspired by Classical Iterative Algorithms","created":"2021-03-10","cited_by_count":60},{"id":"2110.15174","title":"On Provable Benefits of Depth in Training Graph Convolutional Networks","created":"2021-10-28","cited_by_count":58},{"id":"2010.04558","title":"HyperSAGE: Generalizing Inductive Representation Learning on Hypergraphs","created":"2020-10-09","cited_by_count":54},{"id":"2101.09611","title":"Generative hypergraph clustering: from blockmodels to modularity","created":"2021-01-24","cited_by_count":49},{"id":"1905.08287","title":"Random Walks on Hypergraphs with Edge-Dependent Vertex Weights","created":"2019-05-20","cited_by_count":45},{"id":"1910.02421","title":"On Universal Equivariant Set Networks","created":"2019-10-06","cited_by_count":45},{"id":"2106.15845","title":"Edge Representation Learning with Hypergraphs","created":"2021-06-30","cited_by_count":37},{"id":"1312.5179","title":"The Total Variation on Hypergraphs - Learning on Hypergraphs Revisited","created":"2013-12-18","cited_by_count":35},{"id":"2006.01301","title":"Graph Unrolling Networks: Interpretable Neural Networks for Graph Signal Denoising","created":"2020-06-01","cited_by_count":33},{"id":"2202.10720","title":"EIGNN: Efficient Infinite-Depth Graph Neural Networks","created":"2022-02-22","cited_by_count":32},{"id":"1709.01249","title":"Inhomogeneous Hypergraph Clustering with Applications","created":"2017-09-05","cited_by_count":31},{"id":"1910.09943","title":"Clustering in graphs and hypergraphs with categorical edge labels","created":"2019-10-22","cited_by_count":31},{"id":"1605.01636","title":"Maximal Sparsity with Deep Networks?","created":"2016-05-05","cited_by_count":29},{"id":"1903.01939","title":"Universal approximations of permutation invariant/equivariant functions by deep neural networks","created":"2019-03-05","cited_by_count":29},{"id":"1606.07230","title":"Deep Learning Markov Random Field for Semantic Segmentation","created":"2016-06-23","cited_by_count":27},{"id":"1803.03833","title":"Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering","created":"2018-03-10","cited_by_count":25},{"id":"2101.07480","title":"How Do Hyperedges Overlap in Real-World Hypergraphs? -- Patterns, Measures, and Generators","created":"2021-01-19","cited_by_count":22},{"id":"1907.09203","title":"Introducing Hypergraph Signal Processing: Theoretical Foundation and Practical Applications","created":"2019-07-22","cited_by_count":20},{"id":"2006.04762","title":"Nonlinear Higher-Order Label Spreading","created":"2020-06-08","cited_by_count":20},{"id":"2112.14266","title":"Session-based Recommendation with Hypergraph Attention Networks","created":"2021-12-28","cited_by_count":19},{"id":"1502.03175","title":"Proximal Algorithms in Statistics and Machine Learning","created":"2015-02-11","cited_by_count":18},{"id":"2203.16939","title":"Hypergraph Convolutional Networks via Equivalency between Hypergraphs and Undirected Graphs","created":"2022-03-31","cited_by_count":16},{"id":"1606.06235","title":"Scalable motif-aware graph clustering","created":"2016-06-20","cited_by_count":15},{"id":"2006.08302","title":"Hypergraph Clustering Based on PageRank","created":"2020-06-15","cited_by_count":15},{"id":"2001.02817","title":"Hypergraph Cuts with General Splitting Functions","created":"2020-01-09","cited_by_count":14},{"id":"1708.08781","title":"Cheeger Inequalities for Submodular Transformations","created":"2017-08-29","cited_by_count":13},{"id":"2106.06039","title":"Neural Predicting Higher-order Patterns in Temporal Networks","created":"2021-06-10","cited_by_count":13},{"id":"2111.06592","title":"Implicit vs Unfolded Graph Neural Networks","created":"2021-11-12","cited_by_count":13},{"id":"2011.07752","title":"Strongly Local Hypergraph Diffusions for Clustering and Semi-supervised Learning","created":"2020-11-16","cited_by_count":12},{"id":"1311.4296","title":"Reflection methods for user-friendly submodular optimization","created":"2013-11-18","cited_by_count":11},{"id":"2103.14867","title":"A nonlinear diffusion method for semi-supervised learning on hypergraphs","created":"2021-03-27","cited_by_count":11},{"id":"1804.10204","title":"End-to-End Speech Separation with Unfolded Iterative Phase Reconstruction","created":"2018-04-26","cited_by_count":10},{"id":"2103.05031","title":"Higher-order Network Analysis Takes Off, Fueled by Classical Ideas and New Data","created":"2021-03-08","cited_by_count":9},{"id":"1612.00895","title":"Motif Clustering and Overlapping Clustering for Social Network Analysis","created":"2016-12-02","cited_by_count":8},{"id":"2102.07945","title":"Local Hyper-Flow Diffusion","created":"2021-02-16","cited_by_count":8},{"id":"1902.10132","title":"Quadratic Decomposable Submodular Function Minimization: Theory and Practice (Computation and Analysis of PageRank over Hypergraphs)","created":"2019-02-26","cited_by_count":7},{"id":"1803.03851","title":"Revisiting Decomposable Submodular Function Minimization with Incidence Relations","created":"2018-03-10","cited_by_count":4},{"id":"2105.01369","title":"Consensus Dynamics and Opinion Formation on Hypergraphs","created":"2021-05-04","cited_by_count":3},{"id":"1806.09842","title":"Quadratic Decomposable Submodular Function Minimization","created":"2018-06-26","cited_by_count":1}],"next_cursor":null}