{"list":"other","total":62,"rows":[{"id":"2011.13456","title":"Score-Based Generative Modeling through Stochastic Differential Equations","created":"2020-11-26","cited_by_count":9122},{"id":"1312.5602","title":"Playing Atari with Deep Reinforcement Learning","created":"2013-12-19","cited_by_count":3274},{"id":"1812.08434","title":"Graph Neural Networks: A Review of Methods and Applications","created":"2018-12-20","cited_by_count":1576},{"id":"2006.09011","title":"Improved Techniques for Training Score-Based Generative Models","created":"2020-06-16","cited_by_count":1043},{"id":"1506.03134","title":"Pointer Networks","created":"2015-06-09","cited_by_count":895},{"id":"1803.08475","title":"Attention, Learn to Solve Routing Problems!","created":"2018-03-22","cited_by_count":656},{"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":"2010.16011","title":"POMO: Policy Optimization with Multiple Optima for Reinforcement Learning","created":"2020-10-30","cited_by_count":348},{"id":"1802.04240","title":"Reinforcement Learning for Solving the Vehicle Routing Problem","created":"2018-02-12","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":"2101.03288","title":"How to Train Your Energy-Based Models","created":"2021-01-09","cited_by_count":274},{"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":"2003.03600","title":"Reinforcement Learning for Combinatorial Optimization: A Survey","created":"2020-03-07","cited_by_count":236},{"id":"1802.03685","title":"Learning a SAT Solver from Single-Bit Supervision","created":"2018-02-11","cited_by_count":200},{"id":"2207.08799","title":"Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit","created":"2022-07-18","cited_by_count":187},{"id":"1810.00337","title":"Learning to Perform Local Rewriting for Combinatorial Optimization","created":"2018-09-30","cited_by_count":185},{"id":"2206.15144","title":"Neural Networks can Learn Representations with Gradient Descent","created":"2022-06-30","cited_by_count":161},{"id":"2302.11055","title":"SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics","created":"2023-02-21","cited_by_count":143},{"id":"2202.08658","title":"The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networks","created":"2022-02-17","cited_by_count":142},{"id":"2205.13209","title":"Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimization","created":"2022-05-26","cited_by_count":119},{"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":"2110.02544","title":"Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer","created":"2021-10-06","cited_by_count":108},{"id":"2210.15651","title":"Learning Single-Index Models with Shallow Neural Networks","created":"2022-10-27","cited_by_count":92},{"id":"2106.11113","title":"Matrix Encoding Networks for Neural Combinatorial Optimization","created":"2021-06-21","cited_by_count":91},{"id":"2110.13987","title":"Learning Collaborative Policies to Solve NP-hard Routing Problems","created":"2021-10-26","cited_by_count":86},{"id":"1609.05191","title":"Gradient Descent Learns Linear Dynamical Systems","created":"2016-09-16","cited_by_count":79},{"id":"1911.04936","title":"Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning","created":"2019-11-12","cited_by_count":78},{"id":"1507.02030","title":"Beyond Convexity: Stochastic Quasi-Convex Optimization","created":"2015-07-08","cited_by_count":76},{"id":"2108.10573","title":"The staircase property: How hierarchical structure can guide deep learning","created":"2021-08-24","cited_by_count":62},{"id":"2010.12001","title":"Reinforcement Learning with Combinatorial Actions: An Application to Vehicle Routing","created":"2020-10-22","cited_by_count":61},{"id":"2204.07697","title":"Theory of Graph Neural Networks: Representation and Learning","created":"2022-04-16","cited_by_count":61},{"id":"1909.08387","title":"Graph Neural Networks for Maximum Constraint Satisfaction","created":"2019-09-18","cited_by_count":46},{"id":"1906.11985","title":"Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond","created":"2019-06-27","cited_by_count":36},{"id":"2206.13211","title":"Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set","created":"2022-06-27","cited_by_count":33},{"id":"2002.09398","title":"It's Not What Machines Can Learn, It's What We Cannot Teach","created":"2020-02-21","cited_by_count":29},{"id":"2108.04190","title":"On the Power of Differentiable Learning versus PAC and SQ Learning","created":"2021-08-09","cited_by_count":28},{"id":"2202.05258","title":"Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks","created":"2022-02-10","cited_by_count":28},{"id":"1805.07010","title":"Learning Permutations with Sinkhorn Policy Gradient","created":"2018-05-18","cited_by_count":26},{"id":"2102.00434","title":"The Connection Between Approximation, Depth Separation and Learnability in Neural Networks","created":"2021-01-31","cited_by_count":19},{"id":"2208.03113","title":"On the non-universality of deep learning: quantifying the cost of symmetry","created":"2022-08-05","cited_by_count":18},{"id":"2005.14105","title":"Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size","created":"2020-05-28","cited_by_count":16},{"id":"1908.05767","title":"Experimental performance of graph neural networks on random instances of max-cut","created":"2019-08-15","cited_by_count":15},{"id":"2008.11990","title":"Neural Learning of One-of-Many Solutions for Combinatorial Problems in Structured Output Spaces","created":"2020-08-27","cited_by_count":14},{"id":"2309.03800","title":"Pareto Frontiers in Neural Feature Learning: Data, Compute, Width, and Luck","created":"2023-09-07","cited_by_count":13},{"id":"2102.06635","title":"ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation","created":"2021-02-12","cited_by_count":12},{"id":"2008.12248","title":"A Survey on Reinforcement Learning for Combinatorial Optimization","created":"2020-08-17","cited_by_count":10},{"id":"1511.04466","title":"Optimizing Star-Convex Functions","created":"2015-11-13","cited_by_count":9},{"id":"1812.06369","title":"Provable limitations of deep learning","created":"2018-12-16","cited_by_count":5},{"id":"2201.05674","title":"Cut query algorithms with star contraction","created":"2022-01-14","cited_by_count":4},{"id":"1711.03165","title":"Computing exact minimum cuts without knowing the graph","created":"2017-11-08","cited_by_count":3},{"id":"2106.03366","title":"Spectral Independence via Stability and Applications to Holant-Type Problems","created":"2021-06-07","cited_by_count":3},{"id":"1704.06493","title":"The Ising Partition Function: Zeros and Deterministic Approximation","created":"2017-04-21","cited_by_count":2},{"id":"1901.06653","title":"Fast algorithms at low temperatures via Markov chains","created":"2019-01-20","cited_by_count":2},{"id":"2007.08285","title":"Quantum algorithms for graph problems with cut queries","created":"2020-07-16","cited_by_count":2},{"id":"2207.09391","title":"A Near-Linear Time Sampler for the Ising Model with External Field","created":"2022-07-19","cited_by_count":2},{"id":"1911.06889","title":"New Query Lower Bounds for Submodular Function MInimization","created":"2019-11-15","cited_by_count":1},{"id":"2211.04506","title":"On the cut-query complexity of approximating max-cut","created":"2022-11-08","cited_by_count":1},{"id":"2306.02555","title":"Barriers for the performance of graph neural networks (GNN) in discrete random structures. A comment on~\\cite{schuetz2022combinatorial},\\cite{angelini2023modern},\\cite{schuetz2023reply}","created":"2023-06-05","cited_by_count":1}],"next_cursor":null}