{"list":"other","total":58,"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":"1806.07572","title":"Neural Tangent Kernel: Convergence and Generalization in Neural Networks","created":"2018-06-20","cited_by_count":2621},{"id":"2301.05217","title":"Progress measures for grokking via mechanistic interpretability","created":"2023-01-12","cited_by_count":839},{"id":"1811.03962","title":"A Convergence Theory for Deep Learning via Over-Parameterization","created":"2018-11-09","cited_by_count":787},{"id":"1812.07956","title":"On Lazy Training in Differentiable Programming","created":"2018-12-19","cited_by_count":675},{"id":"1810.02054","title":"Gradient Descent Provably Optimizes Over-parameterized Neural Networks","created":"2018-10-04","cited_by_count":659},{"id":"1710.10345","title":"The Implicit Bias of Gradient Descent on Separable Data","created":"2017-10-27","cited_by_count":655},{"id":"2201.02177","title":"Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets","created":"2022-01-06","cited_by_count":629},{"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":"1905.13655","title":"Implicit Regularization in Deep Matrix Factorization","created":"2019-05-31","cited_by_count":405},{"id":"1705.09280","title":"Implicit Regularization in Matrix Factorization","created":"2017-05-25","cited_by_count":322},{"id":"1906.05890","title":"Gradient Descent Maximizes the Margin of Homogeneous Neural Networks","created":"2019-06-13","cited_by_count":320},{"id":"2002.09277","title":"Kernel and Rich Regimes in Overparametrized Models","created":"2020-02-20","cited_by_count":306},{"id":"2002.04486","title":"Implicit Bias of Gradient Descent for Wide Two-layer Neural Networks Trained with the Logistic Loss","created":"2020-02-11","cited_by_count":268},{"id":"1802.08246","title":"Characterizing Implicit Bias in Terms of Optimization Geometry","created":"2018-02-22","cited_by_count":266},{"id":"1806.00468","title":"Implicit Bias of Gradient Descent on Linear Convolutional Networks","created":"2018-06-01","cited_by_count":251},{"id":"2205.10343","title":"Towards Understanding Grokking: An Effective Theory of Representation Learning","created":"2022-05-20","cited_by_count":230},{"id":"1905.13210","title":"Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networks","created":"2019-05-30","cited_by_count":222},{"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":"2006.06657","title":"Directional convergence and alignment in deep learning","created":"2020-06-11","cited_by_count":178},{"id":"2012.09839","title":"Towards Resolving the Implicit Bias of Gradient Descent for Matrix Factorization: Greedy Low-Rank Learning","created":"2020-12-17","cited_by_count":150},{"id":"2210.01117","title":"Omnigrok: Grokking Beyond Algorithmic Data","created":"2022-10-03","cited_by_count":146},{"id":"2302.03025","title":"A Toy Model of Universality: Reverse Engineering How Networks Learn Group Operations","created":"2023-02-06","cited_by_count":144},{"id":"1904.09080","title":"Implicit regularization for deep neural networks driven by an Ornstein-Uhlenbeck like process","created":"2019-04-19","cited_by_count":123},{"id":"1909.12292","title":"Polylogarithmic width suffices for gradient descent to achieve arbitrarily small test error with shallow ReLU networks","created":"2019-09-26","cited_by_count":121},{"id":"2106.06530","title":"Label Noise SGD Provably Prefers Flat Global Minimizers","created":"2021-06-11","cited_by_count":121},{"id":"2005.06398","title":"Implicit Regularization in Deep Learning May Not Be Explainable by Norms","created":"2020-05-13","cited_by_count":119},{"id":"2309.02390","title":"Explaining grokking through circuit efficiency","created":"2023-09-05","cited_by_count":111},{"id":"1803.01905","title":"Convergence of Gradient Descent on Separable Data","created":"2018-03-05","cited_by_count":110},{"id":"2310.06110","title":"Grokking as the Transition from Lazy to Rich Training Dynamics","created":"2023-10-09","cited_by_count":108},{"id":"2110.06914","title":"What Happens after SGD Reaches Zero Loss? --A Mathematical Framework","created":"2021-10-13","cited_by_count":107},{"id":"2206.04817","title":"The Slingshot Mechanism: An Empirical Study of Adaptive Optimizers and the Grokking Phenomenon","created":"2022-06-10","cited_by_count":94},{"id":"2006.08680","title":"Shape Matters: Understanding the Implicit Bias of the Noise Covariance","created":"2020-06-15","cited_by_count":88},{"id":"2206.07085","title":"Understanding the Generalization Benefit of Normalization Layers: Sharpness Reduction","created":"2022-06-14","cited_by_count":86},{"id":"2301.02679","title":"Grokking modular arithmetic","created":"2023-01-06","cited_by_count":83},{"id":"2303.11873","title":"A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworks","created":"2023-03-21","cited_by_count":83},{"id":"2007.06738","title":"Implicit Bias in Deep Linear Classification: Initialization Scale vs Training Accuracy","created":"2020-07-13","cited_by_count":71},{"id":"2211.12316","title":"Simplicity Bias in Transformers and their Ability to Learn Sparse Boolean Functions","created":"2022-11-22","cited_by_count":70},{"id":"2211.05729","title":"How Does Sharpness-Aware Minimization Minimize Sharpness?","created":"2022-11-10","cited_by_count":65},{"id":"1905.07325","title":"Lexicographic and Depth-Sensitive Margins in Homogeneous and Non-Homogeneous Deep Models","created":"2019-05-17","cited_by_count":53},{"id":"2303.06173","title":"Unifying Grokking and Double Descent","created":"2023-03-10","cited_by_count":50},{"id":"2012.06244","title":"The Implicit Bias for Adaptive Optimization Algorithms on Homogeneous Neural Networks","created":"2020-12-11","cited_by_count":46},{"id":"2006.08643","title":"On the training dynamics of deep networks with $L_2$ regularization","created":"2020-06-15","cited_by_count":39},{"id":"2306.13253","title":"Predicting Grokking Long Before it Happens: A look into the loss landscape of models which grok","created":"2023-06-23","cited_by_count":35},{"id":"2308.15594","title":"Learning the greatest common divisor: explaining transformer predictions","created":"2023-08-29","cited_by_count":33},{"id":"2310.02541","title":"Benign Overfitting and Grokking in ReLU Networks for XOR Cluster Data","created":"2023-10-04","cited_by_count":33},{"id":"2311.07568","title":"Feature emergence via margin maximization: case studies in algebraic tasks","created":"2023-11-13","cited_by_count":33},{"id":"1807.02581","title":"The Goldilocks zone: Towards better understanding of neural network loss landscapes","created":"2018-07-06","cited_by_count":32},{"id":"2203.03756","title":"Flat minima generalize for low-rank matrix recovery","created":"2022-03-07","cited_by_count":28},{"id":"2210.15435","title":"Grokking phase transitions in learning local rules with gradient descent","created":"2022-10-26","cited_by_count":28},{"id":"2303.01215","title":"Why (and When) does Local SGD Generalize Better than SGD?","created":"2023-03-02","cited_by_count":26},{"id":"2210.03820","title":"The Asymmetric Maximum Margin Bias of Quasi-Homogeneous Neural Networks","created":"2022-10-07","cited_by_count":25},{"id":"2212.13881","title":"Mechanism of feature learning in deep fully connected networks and kernel machines that recursively learn features","created":"2022-12-28","cited_by_count":25},{"id":"2310.16441","title":"Grokking in Linear Estimators -- A Solvable Model that Groks without Understanding","created":"2023-10-25","cited_by_count":25},{"id":"2007.11045","title":"On the Rademacher Complexity of Linear Hypothesis Sets","created":"2020-07-21","cited_by_count":17},{"id":"2308.09543","title":"Latent State Models of Training Dynamics","created":"2023-08-18","cited_by_count":16}],"next_cursor":null}