{"list":"other","total":58,"rows":[{"id":"1806.07572","title":"Neural Tangent Kernel: Convergence and Generalization in Neural Networks","created":"2018-06-20","cited_by_count":2621},{"id":"1811.03962","title":"A Convergence Theory for Deep Learning via Over-Parameterization","created":"2018-11-09","cited_by_count":787},{"id":"1610.01145","title":"Error bounds for approximations with deep ReLU networks","created":"2016-10-03","cited_by_count":574},{"id":"1811.03804","title":"Gradient Descent Finds Global Minima of Deep Neural Networks","created":"2018-11-09","cited_by_count":574},{"id":"1402.1869","title":"On the Number of Linear Regions of Deep Neural Networks","created":"2014-02-08","cited_by_count":381},{"id":"1804.04368","title":"Regularisation of Neural Networks by Enforcing Lipschitz Continuity","created":"2018-04-12","cited_by_count":314},{"id":"1606.05336","title":"On the Expressive Power of Deep Neural Networks","created":"2016-06-16","cited_by_count":306},{"id":"1611.01491","title":"Understanding Deep Neural Networks with Rectified Linear Units","created":"2016-11-04","cited_by_count":257},{"id":"1602.04485","title":"Benefits of depth in neural networks","created":"2016-02-14","cited_by_count":250},{"id":"1512.03965","title":"The Power of Depth for Feedforward Neural Networks","created":"2015-12-12","cited_by_count":183},{"id":"1901.09021","title":"Complexity of Linear Regions in Deep Networks","created":"2019-01-25","cited_by_count":167},{"id":"1711.02114","title":"Bounding and Counting Linear Regions of Deep Neural Networks","created":"2017-11-06","cited_by_count":161},{"id":"2105.12806","title":"A Universal Law of Robustness via Isoperimetry","created":"2021-05-26","cited_by_count":151},{"id":"1710.11278","title":"Approximating Continuous Functions by ReLU Nets of Minimal Width","created":"2017-10-31","cited_by_count":122},{"id":"1708.02691","title":"Universal Function Approximation by Deep Neural Nets with Bounded Width and ReLU Activations","created":"2017-08-09","cited_by_count":104},{"id":"1805.07091","title":"Tropical Geometry of Deep Neural Networks","created":"2018-05-18","cited_by_count":95},{"id":"1312.6098","title":"On the number of response regions of deep feed forward networks with piece-wise linear activations","created":"2013-12-20","cited_by_count":94},{"id":"1509.08101","title":"Representation Benefits of Deep Feedforward Networks","created":"2015-09-27","cited_by_count":86},{"id":"1610.04161","title":"Why Deep Neural Networks for Function Approximation?","created":"2016-10-13","cited_by_count":82},{"id":"1810.07770","title":"Small ReLU networks are powerful memorizers: a tight analysis of memorization capacity","created":"2018-10-17","cited_by_count":78},{"id":"1705.10412","title":"Gradient Descent Can Take Exponential Time to Escape Saddle Points","created":"2017-05-29","cited_by_count":74},{"id":"2105.04026","title":"The Modern Mathematics of Deep Learning","created":"2021-05-09","cited_by_count":63},{"id":"1702.07966","title":"Globally Optimal Gradient Descent for a ConvNet with Gaussian Inputs","created":"2017-02-26","cited_by_count":61},{"id":"1610.09887","title":"Depth-Width Tradeoffs in Approximating Natural Functions with Neural Networks","created":"2016-10-31","cited_by_count":59},{"id":"2105.14835","title":"Towards Lower Bounds on the Depth of ReLU Neural Networks","created":"2021-05-31","cited_by_count":56},{"id":"2110.03187","title":"On the Optimal Memorization Power of ReLU Neural Networks","created":"2021-10-07","cited_by_count":40},{"id":"2104.08135","title":"Sharp bounds for the number of regions of maxout networks and vertices of Minkowski sums","created":"2021-04-16","cited_by_count":37},{"id":"1611.10258","title":"Reliably Learning the ReLU in Polynomial Time","created":"2016-11-30","cited_by_count":36},{"id":"2011.13550","title":"Tight Hardness Results for Training Depth-2 ReLU Networks","created":"2020-11-27","cited_by_count":35},{"id":"2005.12844","title":"Approximation Schemes for ReLU Regression","created":"2020-05-26","cited_by_count":34},{"id":"1811.01885","title":"Learning Two Layer Rectified Neural Networks in Polynomial Time","created":"2018-11-05","cited_by_count":31},{"id":"2202.05258","title":"Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks","created":"2022-02-10","cited_by_count":28},{"id":"2009.13512","title":"Learning Deep ReLU Networks Is Fixed-Parameter Tractable","created":"2020-09-28","cited_by_count":26},{"id":"1809.10787","title":"Complexity of Training ReLU Neural Network","created":"2018-09-27","cited_by_count":23},{"id":"2105.08675","title":"The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality","created":"2021-05-18","cited_by_count":22},{"id":"1711.03073","title":"Lower bounds over Boolean inputs for deep neural networks with ReLU gates","created":"2017-11-08","cited_by_count":21},{"id":"1802.02547","title":"Learning One Convolutional Layer with Overlapping Patches","created":"2018-02-07","cited_by_count":21},{"id":"1803.00094","title":"Neural Networks Should Be Wide Enough to Learn Disconnected Decision Regions","created":"2018-02-28","cited_by_count":17},{"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":"1810.03218","title":"Principled Deep Neural Network Training through Linear Programming","created":"2018-10-07","cited_by_count":13},{"id":"2108.05643","title":"On minimal representations of shallow ReLU networks","created":"2021-08-12","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":"2111.08117","title":"Neural networks with linear threshold activations: structure and algorithms","created":"2021-11-15","cited_by_count":12},{"id":"1912.02278","title":"Smoothing the gap between NP and ER","created":"2019-12-04","cited_by_count":10},{"id":"2008.05584","title":"Graph Drawing via Gradient Descent, $(GD)^2$","created":"2020-08-12","cited_by_count":5},{"id":"2106.02397","title":"On Classifying Continuous Constraint Satisfaction Problems","created":"2021-06-04","cited_by_count":5},{"id":"2112.04343","title":"The Complexity of the Hausdorff Distance","created":"2021-12-08","cited_by_count":5},{"id":"1612.03638","title":"Intersection Graphs of Rays and Grounded Segments","created":"2016-12-12","cited_by_count":4},{"id":"1802.06699","title":"The Complexity of Drawing a Graph in a Polygonal Region","created":"2018-02-19","cited_by_count":4},{"id":"1908.02213","title":"A Universality Theorem for Nested Polytopes","created":"2019-08-06","cited_by_count":4},{"id":"1912.08674","title":"Dynamic Toolbox for ETRINV","created":"2019-12-18","cited_by_count":4},{"id":"2001.05196","title":"On the Computational Complexity of Decision Problems about Multi-Player Nash Equilibria","created":"2020-01-15","cited_by_count":4},{"id":"1605.07061","title":"On Restricted Nonnegative Matrix Factorization","created":"2016-05-23","cited_by_count":2},{"id":"1810.01393","title":"Approximating the Existential Theory of the Reals","created":"2018-10-02","cited_by_count":2},{"id":"2007.06920","title":"A Practical Algorithm with Performance Guarantees for the Art Gallery Problem","created":"2020-07-14","cited_by_count":2},{"id":"2106.02335","title":"Covering Polygons is Even Harder","created":"2021-06-04","cited_by_count":2},{"id":"1410.8720","title":"Engineering Art Galleries","created":"2014-10-31","cited_by_count":1},{"id":"2107.02060","title":"On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets","created":"2021-07-05","cited_by_count":1}],"next_cursor":null}