{"list":"other","total":69,"rows":[{"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":"1710.10903","title":"Graph Attention Networks","created":"2017-10-30","cited_by_count":8923},{"id":"1810.00826","title":"How Powerful are Graph Neural Networks?","created":"2018-10-01","cited_by_count":4393},{"id":"2106.01946","title":"Convex optimization","created":"2021-06-03","cited_by_count":2515},{"id":"1506.03134","title":"Pointer Networks","created":"2015-06-09","cited_by_count":895},{"id":"1810.02244","title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","created":"2018-10-04","cited_by_count":881},{"id":"1511.05493","title":"Gated Graph Sequence Neural Networks","created":"2015-11-17","cited_by_count":796},{"id":"2003.00982","title":"Benchmarking Graph Neural Networks","created":"2020-03-02","cited_by_count":680},{"id":"1811.06128","title":"Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon","created":"2018-11-15","cited_by_count":623},{"id":"1611.09940","title":"Neural Combinatorial Optimization with Reinforcement Learning","created":"2016-11-29","cited_by_count":608},{"id":"1704.01665","title":"Learning Combinatorial Optimization Algorithms over Graphs","created":"2017-04-05","cited_by_count":561},{"id":"1910.12430","title":"Differentiable Convex Optimization Layers","created":"2019-10-28","cited_by_count":465},{"id":"1802.04240","title":"Reinforcement Learning for Solving the Vehicle Routing Problem","created":"2018-02-12","cited_by_count":333},{"id":"2110.07875","title":"Graph Neural Networks with Learnable Structural and Positional Representations","created":"2021-10-15","cited_by_count":333},{"id":"1906.01629","title":"Exact Combinatorial Optimization with Graph Convolutional Neural Networks","created":"2019-06-04","cited_by_count":318},{"id":"1703.00887","title":"How to Escape Saddle Points Efficiently","created":"2017-03-02","cited_by_count":285},{"id":"1906.01227","title":"An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem","created":"2019-06-04","cited_by_count":269},{"id":"2102.09544","title":"Combinatorial optimization and reasoning with graph neural networks","created":"2021-02-18","cited_by_count":268},{"id":"2103.09177","title":"Deep learning: a statistical viewpoint","created":"2021-03-16","cited_by_count":240},{"id":"1907.03199","title":"What graph neural networks cannot learn: depth vs width","created":"2019-07-06","cited_by_count":201},{"id":"1802.03685","title":"Learning a SAT Solver from Single-Bit Supervision","created":"2018-02-11","cited_by_count":200},{"id":"2002.03155","title":"Random Features Strengthen Graph Neural Networks","created":"2020-02-08","cited_by_count":186},{"id":"1810.00337","title":"Learning to Perform Local Rewriting for Combinatorial Optimization","created":"2018-09-30","cited_by_count":185},{"id":"1810.10659","title":"Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search","created":"2018-10-25","cited_by_count":183},{"id":"2012.13349","title":"Solving Mixed Integer Programs Using Neural Networks","created":"2020-12-23","cited_by_count":182},{"id":"1905.12149","title":"SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver","created":"2019-05-29","cited_by_count":173},{"id":"1809.09573","title":"Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview","created":"2018-09-25","cited_by_count":160},{"id":"1605.07272","title":"Matrix Completion has No Spurious Local Minimum","created":"2016-05-24","cited_by_count":125},{"id":"1910.10593","title":"Neural Execution of Graph Algorithms","created":"2019-10-23","cited_by_count":121},{"id":"2006.10643","title":"Erdos Goes Neural: an Unsupervised Learning Framework for Combinatorial Optimization on Graphs","created":"2020-06-18","cited_by_count":115},{"id":"2107.01188","title":"Combinatorial Optimization with Physics-Inspired Graph Neural Networks","created":"2021-07-02","cited_by_count":108},{"id":"2205.15659","title":"The CLRS Algorithmic Reasoning Benchmark","created":"2022-05-31","cited_by_count":106},{"id":"2006.15212","title":"Hybrid Models for Learning to Branch","created":"2020-06-26","cited_by_count":95},{"id":"2105.02761","title":"Neural Algorithmic Reasoning","created":"2021-05-06","cited_by_count":94},{"id":"1909.04063","title":"Exploratory Combinatorial Optimization with Reinforcement Learning","created":"2019-09-09","cited_by_count":82},{"id":"1905.10261","title":"Approximation Ratios of Graph Neural Networks for Combinatorial Problems","created":"2019-05-24","cited_by_count":69},{"id":"1903.04671","title":"Guiding High-Performance SAT Solvers with Unsat-Core Predictions","created":"2019-03-12","cited_by_count":62},{"id":"2206.13414","title":"Learning To Cut By Looking Ahead: Cutting Plane Selection via Imitation Learning","created":"2022-06-27","cited_by_count":61},{"id":"2209.11142","title":"A Generalist Neural Algorithmic Learner","created":"2022-09-22","cited_by_count":59},{"id":"1809.02721","title":"Learning to Solve NP-Complete Problems - A Graph Neural Network for Decision TSP","created":"2018-09-08","cited_by_count":58},{"id":"2006.09607","title":"Learning What to Defer for Maximum Independent Sets","created":"2020-06-17","cited_by_count":54},{"id":"2305.17010","title":"Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with GFlowNets","created":"2023-05-26","cited_by_count":40},{"id":"2209.12288","title":"On Representing Linear Programs by Graph Neural Networks","created":"2022-09-25","cited_by_count":39},{"id":"2201.10494","title":"What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization","created":"2022-01-25","cited_by_count":37},{"id":"2207.05984","title":"Unsupervised Learning for Combinatorial Optimization with Principled Objective Relaxation","created":"2022-07-13","cited_by_count":32},{"id":"2202.01606","title":"Graph Coloring with Physics-Inspired Graph Neural Networks","created":"2022-02-03","cited_by_count":29},{"id":"2106.07162","title":"Goal-Aware Neural SAT Solver","created":"2021-06-14","cited_by_count":28},{"id":"2208.10227","title":"One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction","created":"2022-08-22","cited_by_count":27},{"id":"2206.01506","title":"Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem?","created":"2022-06-03","cited_by_count":25},{"id":"2012.11978","title":"Finding Global Minima via Kernel Approximations","created":"2020-12-22","cited_by_count":23},{"id":"2302.04496","title":"Dual Algorithmic Reasoning","created":"2023-02-09","cited_by_count":21},{"id":"2301.03116","title":"Unsupervised Learning for Combinatorial Optimization Needs Meta-Learning","created":"2023-01-08","cited_by_count":20},{"id":"1804.02008","title":"Deterministic guarantees for Burer-Monteiro factorizations of smooth semidefinite programs","created":"2018-04-05","cited_by_count":19},{"id":"2306.06064","title":"Neural Algorithmic Reasoning for Combinatorial Optimisation","created":"2023-05-18","cited_by_count":19},{"id":"2207.11542","title":"Annealed Training for Combinatorial Optimization on Graphs","created":"2022-07-23","cited_by_count":18},{"id":"1903.01969","title":"PDP: A General Neural Framework for Learning Constraint Satisfaction Solvers","created":"2019-03-05","cited_by_count":14},{"id":"2205.14105","title":"Learning to Solve Combinatorial Graph Partitioning Problems via Efficient Exploration","created":"2022-05-27","cited_by_count":14},{"id":"2208.04055","title":"Neural Set Function Extensions: Learning with Discrete Functions in High Dimensions","created":"2022-08-08","cited_by_count":14},{"id":"1809.03359","title":"Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning","created":"2018-09-10","cited_by_count":13},{"id":"1404.5236","title":"Sum-of-squares proofs and the quest toward optimal algorithms","created":"2014-04-21","cited_by_count":12},{"id":"1803.00186","title":"Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form","created":"2018-03-01","cited_by_count":10},{"id":"2207.13667","title":"Unsupervised Training for Neural TSP Solver","created":"2022-07-27","cited_by_count":9},{"id":"1812.06362","title":"Low-rank semidefinite programming for the MAX2SAT problem","created":"2018-12-15","cited_by_count":8},{"id":"1807.04428","title":"Convergence Rate of Block-Coordinate Maximization Burer-Monteiro Method for Solving Large SDPs","created":"2018-07-12","cited_by_count":7},{"id":"2111.07568","title":"Can Graph Neural Networks Learn to Solve MaxSAT Problem?","created":"2021-11-15","cited_by_count":5},{"id":"2011.05785","title":"Fast semidefinite programming with feedforward neural networks","created":"2020-11-11","cited_by_count":4},{"id":"2211.12389","title":"The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound","created":"2022-11-22","cited_by_count":4},{"id":"2302.11992","title":"Solving Recurrent MIPs with Semi-supervised Graph Neural Networks","created":"2023-02-20","cited_by_count":1}],"next_cursor":null}