{"list":"other","total":51,"rows":[{"id":"1502.01852","title":"Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classification","created":"2015-02-06","cited_by_count":3611},{"id":"1606.08415","title":"Gaussian Error Linear Units (GELUs)","created":"2016-06-27","cited_by_count":3502},{"id":"1806.07572","title":"Neural Tangent Kernel: Convergence and Generalization in Neural Networks","created":"2018-06-20","cited_by_count":2621},{"id":"1611.03530","title":"Understanding deep learning requires rethinking generalization","created":"2016-11-10","cited_by_count":1674},{"id":"2010.01412","title":"Sharpness-Aware Minimization for Efficiently Improving Generalization","created":"2020-10-03","cited_by_count":1417},{"id":"1606.04838","title":"Optimization Methods for Large-Scale Machine Learning","created":"2016-06-15","cited_by_count":1150},{"id":"1904.09237","title":"On the Convergence of Adam and Beyond","created":"2019-04-19","cited_by_count":841},{"id":"1811.03962","title":"A Convergence Theory for Deep Learning via Over-Parameterization","created":"2018-11-09","cited_by_count":787},{"id":"1706.08498","title":"Spectrally-normalized margin bounds for neural networks","created":"2017-06-26","cited_by_count":686},{"id":"1810.02054","title":"Gradient Descent Provably Optimizes Over-parameterized Neural Networks","created":"2018-10-04","cited_by_count":659},{"id":"1811.03804","title":"Gradient Descent Finds Global Minima of Deep Neural Networks","created":"2018-11-09","cited_by_count":574},{"id":"1904.11955","title":"On Exact Computation with an Infinitely Wide Neural Net","created":"2019-04-26","cited_by_count":573},{"id":"1901.08584","title":"Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networks","created":"2019-01-24","cited_by_count":566},{"id":"1509.01240","title":"Train faster, generalize better: Stability of stochastic gradient descent","created":"2015-09-03","cited_by_count":552},{"id":"1501.01571","title":"An Introduction to Matrix Concentration Inequalities","created":"2015-01-07","cited_by_count":397},{"id":"2002.09277","title":"Kernel and Rich Regimes in Overparametrized Models","created":"2020-02-20","cited_by_count":306},{"id":"1901.10159","title":"An Investigation into Neural Net Optimization via Hessian Eigenvalue Density","created":"2019-01-29","cited_by_count":292},{"id":"1912.07145","title":"PyHessian: Neural Networks Through the Lens of the Hessian","created":"2019-12-16","cited_by_count":292},{"id":"1712.06541","title":"Size-Independent Sample Complexity of Neural Networks","created":"2017-12-18","cited_by_count":290},{"id":"2010.05761","title":"The Risks of Invariant Risk Minimization","created":"2020-10-12","cited_by_count":262},{"id":"2003.00307","title":"Loss landscapes and optimization in over-parameterized non-linear systems and neural networks","created":"2020-02-29","cited_by_count":233},{"id":"1902.04742","title":"Uniform convergence may be unable to explain generalization in deep learning","created":"2019-02-13","cited_by_count":224},{"id":"1812.04754","title":"Gradient Descent Happens in a Tiny Subspace","created":"2018-12-12","cited_by_count":217},{"id":"2007.07682","title":"FetchSGD: Communication-Efficient Federated Learning with Sketching","created":"2020-07-15","cited_by_count":179},{"id":"1712.06559","title":"The Power of Interpolation: Understanding the Effectiveness of SGD in Modern Over-parametrized Learning","created":"2017-12-18","cited_by_count":150},{"id":"1605.00251","title":"A vector-contraction inequality for Rademacher complexities","created":"2016-05-01","cited_by_count":142},{"id":"1811.08888","title":"Stochastic Gradient Descent Optimizes Over-parameterized Deep ReLU Networks","created":"2018-11-21","cited_by_count":141},{"id":"2010.01092","title":"On the linearity of large non-linear models: when and why the tangent kernel is constant","created":"2020-10-02","cited_by_count":129},{"id":"1405.7085","title":"Differentially Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds","created":"2014-05-27","cited_by_count":107},{"id":"1411.2664","title":"Preserving Statistical Validity in Adaptive Data Analysis","created":"2014-11-10","cited_by_count":103},{"id":"1607.06534","title":"The Landscape of Empirical Risk for Non-convex Losses","created":"2016-07-22","cited_by_count":86},{"id":"1506.02629","title":"Generalization in Adaptive Data Analysis and Holdout Reuse","created":"2015-06-08","cited_by_count":83},{"id":"1903.04488","title":"Communication-efficient distributed SGD with Sketching","created":"2019-03-12","cited_by_count":81},{"id":"1901.08244","title":"Measurements of Three-Level Hierarchical Structure in the Outliers in the Spectrum of Deepnet Hessians","created":"2019-01-24","cited_by_count":68},{"id":"1806.10077","title":"Random Shuffling Beats SGD after Finite Epochs","created":"2018-06-26","cited_by_count":67},{"id":"1908.00045","title":"How Good is SGD with Random Shuffling?","created":"2019-07-31","cited_by_count":64},{"id":"2002.10400","title":"Closing the convergence gap of SGD without replacement","created":"2020-02-24","cited_by_count":57},{"id":"2010.04261","title":"Dissecting Hessian: Understanding Common Structure of Hessian in Neural Networks","created":"2020-10-08","cited_by_count":45},{"id":"1912.04265","title":"In Defense of Uniform Convergence: Generalization via derandomization with an application to interpolating predictors","created":"2019-12-09","cited_by_count":44},{"id":"1810.11059","title":"Uniform Convergence of Gradients for Non-Convex Learning and Optimization","created":"2018-10-25","cited_by_count":38},{"id":"2305.16292","title":"Sharpness-Aware Minimization Leads to Low-Rank Features","created":"2023-05-25","cited_by_count":38},{"id":"1907.10732","title":"Hessian based analysis of SGD for Deep Nets: Dynamics and Generalization","created":"2019-07-24","cited_by_count":37},{"id":"1909.03577","title":"A New Analysis of Differential Privacy's Generalization Guarantees","created":"2019-09-09","cited_by_count":36},{"id":"1410.1228","title":"Interactive Fingerprinting Codes and the Hardness of Preventing False Discovery","created":"2014-10-05","cited_by_count":35},{"id":"1810.07590","title":"Graphical Convergence of Subgradients in Nonconvex Optimization and Learning","created":"2018-10-17","cited_by_count":17},{"id":"2201.13011","title":"On the Power-Law Hessian Spectrums in Deep Learning","created":"2022-01-31","cited_by_count":16},{"id":"2202.13328","title":"Thinking Outside the Ball: Optimal Learning with Gradient Descent for Generalized Linear Stochastic Convex Optimization","created":"2022-02-27","cited_by_count":7},{"id":"2209.15106","title":"Restricted Strong Convexity of Deep Learning Models with Smooth Activations","created":"2022-09-29","cited_by_count":7},{"id":"1402.1864","title":"An Inequality with Applications to Structured Sparsity and Multitask Dictionary Learning","created":"2014-02-08","cited_by_count":5},{"id":"1606.01487","title":"Bounds for Vector-Valued Function Estimation","created":"2016-06-05","cited_by_count":3},{"id":"1910.03493","title":"A Rademacher Complexity Based Method fo rControlling Power and Confidence Level in Adaptive Statistical Analysis","created":"2019-10-04","cited_by_count":3}],"next_cursor":null}