{"list":"other","total":58,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52096},{"id":"1412.6572","title":"Explaining and Harnessing Adversarial Examples","created":"2014-12-20","cited_by_count":7364},{"id":"1312.6199","title":"Intriguing properties of neural networks","created":"2013-12-21","cited_by_count":5155},{"id":"1806.07572","title":"Neural Tangent Kernel: Convergence and Generalization in Neural Networks","created":"2018-06-20","cited_by_count":2621},{"id":"1802.05957","title":"Spectral Normalization for Generative Adversarial Networks","created":"2018-02-16","cited_by_count":1636},{"id":"1611.01236","title":"Adversarial Machine Learning at Scale","created":"2016-11-04","cited_by_count":936},{"id":"1812.11118","title":"Reconciling modern machine learning practice and the bias-variance trade-off","created":"2018-12-28","cited_by_count":927},{"id":"1706.08498","title":"Spectrally-normalized margin bounds for neural networks","created":"2017-06-26","cited_by_count":686},{"id":"1812.07956","title":"On Lazy Training in Differentiable Programming","created":"2018-12-19","cited_by_count":675},{"id":"1912.02292","title":"Deep Double Descent: Where Bigger Models and More Data Hurt","created":"2019-12-04","cited_by_count":672},{"id":"1810.02054","title":"Gradient Descent Provably Optimizes Over-parameterized Neural Networks","created":"2018-10-04","cited_by_count":659},{"id":"1904.11955","title":"On Exact Computation with an Infinitely Wide Neural Net","created":"2019-04-26","cited_by_count":573},{"id":"1906.11300","title":"Benign Overfitting in Linear Regression","created":"2019-06-26","cited_by_count":549},{"id":"1805.10965","title":"Lipschitz regularity of deep neural networks: analysis and efficient estimation","created":"2018-05-28","cited_by_count":415},{"id":"1908.05355","title":"The generalization error of random features regression: Precise asymptotics and double descent curve","created":"2019-08-14","cited_by_count":413},{"id":"1804.04368","title":"Regularisation of Neural Networks by Enforcing Lipschitz Continuity","created":"2018-04-12","cited_by_count":314},{"id":"1704.08847","title":"Parseval Networks: Improving Robustness to Adversarial Examples","created":"2017-04-28","cited_by_count":293},{"id":"1906.04893","title":"Efficient and Accurate Estimation of Lipschitz Constants for Deep Neural Networks","created":"2019-06-12","cited_by_count":293},{"id":"1705.08292","title":"The Marginal Value of Adaptive Gradient Methods in Machine Learning","created":"2017-05-23","cited_by_count":250},{"id":"1811.05381","title":"Sorting out Lipschitz function approximation","created":"2018-11-13","cited_by_count":213},{"id":"1802.04034","title":"Lipschitz-Margin Training: Scalable Certification of Perturbation Invariance for Deep Neural Networks","created":"2018-02-12","cited_by_count":195},{"id":"1801.10578","title":"Evaluating the Robustness of Neural Networks: An Extreme Value Theory Approach","created":"2018-01-31","cited_by_count":182},{"id":"2006.04710","title":"The Lipschitz Constant of Self-Attention","created":"2020-06-08","cited_by_count":174},{"id":"2007.15801","title":"Finite Versus Infinite Neural Networks: an Empirical Study","created":"2020-07-31","cited_by_count":157},{"id":"2105.12806","title":"A Universal Law of Robustness via Isoperimetry","created":"2021-05-26","cited_by_count":151},{"id":"2105.14368","title":"Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolation","created":"2021-05-29","cited_by_count":132},{"id":"2003.01897","title":"Optimal Regularization Can Mitigate Double Descent","created":"2020-03-04","cited_by_count":109},{"id":"2102.08452","title":"Globally-Robust Neural Networks","created":"2021-02-16","cited_by_count":108},{"id":"2003.01219","title":"Exactly Computing the Local Lipschitz Constant of ReLU Networks","created":"2020-03-02","cited_by_count":102},{"id":"2008.06786","title":"The Neural Tangent Kernel in High Dimensions: Triple Descent and a Multi-Scale Theory of Generalization","created":"2020-08-15","cited_by_count":101},{"id":"2005.02929","title":"Training robust neural networks using Lipschitz bounds","created":"2020-05-06","cited_by_count":99},{"id":"1804.07193","title":"Lipschitz Continuity in Model-based Reinforcement Learning","created":"2018-04-19","cited_by_count":91},{"id":"2006.12070","title":"Lipschitz Recurrent Neural Networks","created":"2020-06-22","cited_by_count":89},{"id":"1911.00937","title":"Preventing Gradient Attenuation in Lipschitz Constrained Convolutional Networks","created":"2019-11-03","cited_by_count":87},{"id":"2004.08688","title":"Lipschitz constant estimation of Neural Networks via sparse polynomial optimization","created":"2020-04-18","cited_by_count":87},{"id":"2007.12826","title":"The Interpolation Phase Transition in Neural Networks: Memorization and Generalization under Lazy Training","created":"2020-07-25","cited_by_count":84},{"id":"2105.11417","title":"Skew Orthogonal Convolutions","created":"2021-05-24","cited_by_count":67},{"id":"1709.08894","title":"On the regularization of Wasserstein GANs","created":"2017-09-26","cited_by_count":65},{"id":"1810.08591","title":"A Modern Take on the Bias-Variance Tradeoff in Neural Networks","created":"2018-10-19","cited_by_count":65},{"id":"2111.01395","title":"Training Certifiably Robust Neural Networks with Efficient Local Lipschitz Bounds","created":"2021-11-02","cited_by_count":65},{"id":"2110.12690","title":"A Dynamical System Perspective for Lipschitz Neural Networks","created":"2021-10-25","cited_by_count":60},{"id":"2301.11526","title":"Direct Parameterization of Lipschitz-Bounded Deep Networks","created":"2023-01-27","cited_by_count":51},{"id":"1807.09705","title":"Limitations of the Lipschitz constant as a defense against adversarial examples","created":"2018-07-25","cited_by_count":49},{"id":"2010.01732","title":"Lipschitz Bounded Equilibrium Networks","created":"2020-10-05","cited_by_count":49},{"id":"2208.03160","title":"Almost-Orthogonal Layers for Efficient General-Purpose Lipschitz Networks","created":"2022-08-05","cited_by_count":39},{"id":"2209.13083","title":"Why neural networks find simple solutions: the many regularizers of geometric complexity","created":"2022-09-27","cited_by_count":39},{"id":"1907.05681","title":"Adversarial Lipschitz Regularization","created":"2019-07-12","cited_by_count":30},{"id":"2104.05097","title":"Pay attention to your loss: understanding misconceptions about 1-Lipschitz neural networks","created":"2021-04-11","cited_by_count":30},{"id":"2103.12531","title":"CLIP: Cheap Lipschitz Training of Neural Networks","created":"2021-03-23","cited_by_count":29},{"id":"2011.14439","title":"Scaling Down Deep Learning with MNIST-1D","created":"2020-11-29","cited_by_count":25},{"id":"2106.03314","title":"Measuring Generalization with Optimal Transport","created":"2021-06-07","cited_by_count":25},{"id":"1902.05687","title":"Lipschitz Generative Adversarial Nets","created":"2019-02-15","cited_by_count":24},{"id":"2203.01212","title":"A Quantitative Geometric Approach to Neural-Network Smoothness","created":"2022-03-02","cited_by_count":16},{"id":"2203.07337","title":"Phenomenology of Double Descent in Finite-Width Neural Networks","created":"2022-03-14","cited_by_count":12},{"id":"2301.12309","title":"On the Lipschitz Constant of Deep Networks and Double Descent","created":"2023-01-28","cited_by_count":11},{"id":"1811.09567","title":"How does Lipschitz Regularization Influence GAN Training?","created":"2018-11-23","cited_by_count":6},{"id":"1811.08080","title":"Lightweight Lipschitz Margin Training for Certified Defense against Adversarial Examples","created":"2018-11-20","cited_by_count":2}],"next_cursor":null}