{"total":79,"rows":[{"id":"2210.06313","title":"The Lazy Neuron Phenomenon: On Emergence of Activation Sparsity in Transformers","created":"2022-10-12","cited_by_count":122,"area":null},{"id":"2106.06530","title":"Label Noise SGD Provably Prefers Flat Global Minimizers","created":"2021-06-11","cited_by_count":121,"area":null},{"id":"2106.09524","title":"Implicit Bias of SGD for Diagonal Linear Networks: a Provable Benefit of Stochasticity","created":"2021-06-17","cited_by_count":110,"area":null},{"id":"2110.06914","title":"What Happens after SGD Reaches Zero Loss? --A Mathematical Framework","created":"2021-10-13","cited_by_count":107,"area":null},{"id":"2202.14026","title":"Robust Training under Label Noise by Over-parameterization","created":"2022-02-28","cited_by_count":93,"area":null},{"id":"2210.14199","title":"Same Pre-training Loss, Better Downstream: Implicit Bias Matters for Language Models","created":"2022-10-25","cited_by_count":84,"area":null},{"id":"2308.16898","title":"Transformers as Support Vector Machines","created":"2023-08-31","cited_by_count":74,"area":null},{"id":"2102.09769","title":"On the Implicit Bias of Initialization Shape: Beyond Infinitesimal Mirror Descent","created":"2021-02-19","cited_by_count":70,"area":null},{"id":"2210.05337","title":"SGD with Large Step Sizes Learns Sparse Features","created":"2022-10-11","cited_by_count":68,"area":null},{"id":"2306.13596","title":"Max-Margin Token Selection in Attention Mechanism","created":"2023-06-23","cited_by_count":58,"area":null},{"id":"2304.00488","title":"Saddle-to-Saddle Dynamics in Diagonal Linear Networks","created":"2023-04-02","cited_by_count":57,"area":null},{"id":"2110.00296","title":"Powerpropagation: A sparsity inducing weight reparameterisation","created":"2021-10-01","cited_by_count":49,"area":null},{"id":"2112.06074","title":"Early Stopping for Deep Image Prior","created":"2021-12-11","cited_by_count":44,"area":null},{"id":"2207.04036","title":"Implicit Bias of Gradient Descent on Reparametrized Models: On Equivalence to Mirror Descent","created":"2022-07-08","cited_by_count":39,"area":null},{"id":"2302.08982","title":"(S)GD over Diagonal Linear Networks: Implicit Regularisation, Large Stepsizes and Edge of Stability","created":"2023-02-17","cited_by_count":36,"area":null},{"id":"2108.05574","title":"Implicit Sparse Regularization: The Impact of Depth and Early Stopping","created":"2021-08-12","cited_by_count":30,"area":null},{"id":"2309.07418","title":"A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time","created":"2023-09-14","cited_by_count":30,"area":null},{"id":"2206.09841","title":"Label noise (stochastic) gradient descent implicitly solves the Lasso for quadratic parametrisation","created":"2022-06-20","cited_by_count":29,"area":null},{"id":"2208.14673","title":"Incremental Learning in Diagonal Linear Networks","created":"2022-08-31","cited_by_count":28,"area":null},{"id":"2206.04613","title":"Explicit Regularization in Overparametrized Models via Noise Injection","created":"2022-06-09","cited_by_count":26,"area":null},{"id":"2112.11027","title":"More is Less: Inducing Sparsity via Overparameterization","created":"2021-12-21","cited_by_count":24,"area":null},{"id":"2111.07167","title":"The Three Stages of Learning Dynamics in High-Dimensional Kernel Methods","created":"2021-11-13","cited_by_count":22,"area":null},{"id":"2403.08699","title":"Implicit Regularization of Gradient Flow on One-Layer Softmax Attention","created":"2024-03-13","cited_by_count":19,"area":null},{"id":"2408.09966","title":"Mask in the Mirror: Implicit Sparsification","created":"2024-08-19","cited_by_count":14,"area":null},{"id":"2502.02496","title":"Deep Weight Factorization: Sparse Learning Through the Lens of Artificial Symmetries","created":"2025-02-04","cited_by_count":14,"area":null},{"id":"2303.15484","title":"Regularize implicit neural representation by itself","created":"2023-03-27","cited_by_count":13,"area":null},{"id":"2305.05448","title":"Robust Implicit Regularization via Weight Normalization","created":"2023-05-09","cited_by_count":12,"area":null},{"id":"2105.13831","title":"Implicit Regularization in Matrix Sensing via Mirror Descent","created":"2021-05-28","cited_by_count":11,"area":null},{"id":"2205.01385","title":"Smooth over-parameterized solvers for non-smooth structured optimization","created":"2022-05-03","cited_by_count":11,"area":null},{"id":"2206.11872","title":"Provable Acceleration of Heavy Ball beyond Quadratics for a Class of Polyak-\\L{}ojasiewicz Functions when the Non-Convexity is Averaged-Out","created":"2022-06-22","cited_by_count":11,"area":null},{"id":"2209.14881","title":"Sequential Attention for Feature Selection","created":"2022-09-29","cited_by_count":9,"area":null},{"id":"2403.05293","title":"Leveraging Continuous Time to Understand Momentum When Training Diagonal Linear Networks","created":"2024-03-08","cited_by_count":9,"area":null},{"id":"2406.12763","title":"Implicit Bias of Mirror Flow on Separable Data","created":"2024-06-18","cited_by_count":9,"area":null},{"id":"2103.13462","title":"Why Do Local Methods Solve Nonconvex Problems?","created":"2021-03-24","cited_by_count":8,"area":null},{"id":"2209.10675","title":"A Validation Approach to Over-parameterized Matrix and Image Recovery","created":"2022-09-21","cited_by_count":8,"area":null},{"id":"2301.12540","title":"Implicit Regularization for Group Sparsity","created":"2023-01-29","cited_by_count":8,"area":null},{"id":"2406.11110","title":"How Neural Networks Learn the Support is an Implicit Regularization Effect of SGD","created":"2024-06-17","cited_by_count":8,"area":null},{"id":"2401.11600","title":"Understanding the Generalization Benefits of Late Learning Rate Decay","created":"2024-01-21","cited_by_count":6,"area":null},{"id":"2504.12801","title":"Sign-In to the Lottery: Reparameterizing Sparse Training From Scratch","created":"2025-04-17","cited_by_count":6,"area":null},{"id":"2111.11542","title":"Depth Without the Magic: Inductive Bias of Natural Gradient Descent","created":"2021-11-22","cited_by_count":5,"area":null},{"id":"2509.24510","title":"Specialization after Generalization: Towards Understanding Test-Time Training in Foundation Models","created":"2025-09-29","cited_by_count":5,"area":null},{"id":"2202.09885","title":"On Optimal Early Stopping: Over-informative versus Under-informative Parametrization","created":"2022-02-20","cited_by_count":4,"area":null},{"id":"2210.00346","title":"Behind the Scenes of Gradient Descent: A Trajectory Analysis via Basis Function Decomposition","created":"2022-10-01","cited_by_count":4,"area":null},{"id":"2302.00257","title":"Implicit Regularization Leads to Benign Overfitting for Sparse Linear Regression","created":"2023-02-01","cited_by_count":4,"area":null},{"id":"2307.07410","title":"Implicit regularization in AI meets generalized hardness of approximation in optimization -- Sharp results for diagonal linear networks","created":"2023-07-13","cited_by_count":4,"area":null},{"id":"2509.18766","title":"Diagonal Linear Networks and the Lasso Regularization Path","created":"2025-09-23","cited_by_count":4,"area":null},{"id":"2603.02064","title":"Never Saddle for Reparameterized Steepest Descent as Mirror Flow","created":"2026-03-02","cited_by_count":4,"area":null},{"id":"2207.07612","title":"Blessing of Nonconvexity in Deep Linear Models: Depth Flattens the Optimization Landscape Around the True Solution","created":"2022-07-15","cited_by_count":3,"area":null},{"id":"2212.12770","title":"COLT: Cyclic Overlapping Lottery Tickets for Faster Pruning of Convolutional Neural Networks","created":"2022-12-24","cited_by_count":3,"area":null},{"id":"2409.00894","title":"Improving Adaptivity via Over-Parameterization in Sequence Models","created":"2024-09-02","cited_by_count":3,"area":null},{"id":"2509.23898","title":"Differentiable Sparsity via $D$-Gating: Simple and Versatile Structured Penalization","created":"2025-09-28","cited_by_count":3,"area":null},{"id":"2605.19458","title":"Implicit Bias of Mirror Flow in Homogeneous Neural Networks: Sparse and Dense Feature Learning","created":"2026-05-19","cited_by_count":3,"area":null},{"id":"2402.08344","title":"Implicit Bias in Noisy-SGD: With Applications to Differentially Private Training","created":"2024-02-13","cited_by_count":2,"area":null},{"id":"2406.02769","title":"Precise asymptotics of reweighted least-squares algorithms for linear diagonal networks","created":"2024-06-04","cited_by_count":2,"area":null},{"id":"2412.16765","title":"Optimization Insights into Deep Diagonal Linear Networks","created":"2024-12-21","cited_by_count":2,"area":null},{"id":"2505.11370","title":"Understanding Nonlinear Implicit Bias via Region Counts in Input Space","created":"2025-05-16","cited_by_count":2,"area":null},{"id":"2510.01930","title":"Precise Dynamics of Diagonal Linear Networks: A Unifying Analysis by Dynamical Mean-Field Theory","created":"2025-10-02","cited_by_count":2,"area":null},{"id":"2202.00420","title":"Iterative regularization for low complexity regularizers","created":"2022-02-01","cited_by_count":1,"area":null},{"id":"2205.00058","title":"Implicit Regularization Properties of Variance Reduced Stochastic Mirror Descent","created":"2022-04-29","cited_by_count":1,"area":null},{"id":"2205.00061","title":"The Directional Bias Helps Stochastic Gradient Descent to Generalize in Kernel Regression Models","created":"2022-04-29","cited_by_count":1,"area":null},{"id":"2311.12888","title":"Acceleration and Implicit Regularization in Gaussian Phase Retrieval","created":"2023-11-21","cited_by_count":1,"area":null},{"id":"2603.20967","title":"Hard labels sampled from sparse targets mislead rotation invariant algorithms","created":"2026-03-21","cited_by_count":1,"area":null},{"id":"2202.11883","title":"A Note on Machine Learning Approach for Computational Imaging","created":"2022-02-24","cited_by_count":0,"area":null},{"id":"2401.05394","title":"Iterative Regularization with k-support Norm: An Important Complement to Sparse Recovery","created":"2023-12-19","cited_by_count":0,"area":null},{"id":"2402.17902","title":"SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization","created":"2024-02-27","cited_by_count":0,"area":null},{"id":"2403.02697","title":"Noise misleads rotation invariant algorithms on sparse targets","created":"2024-03-05","cited_by_count":0,"area":null},{"id":"2409.07275","title":"Tuning-Free Online Robust Principal Component Analysis through Implicit Regularization","created":"2024-09-11","cited_by_count":0,"area":null},{"id":"2411.11436","title":"Implicit Regularization for Multi-label Feature Selection","created":"2024-11-18","cited_by_count":0,"area":null},{"id":"2412.18756","title":"Towards a Statistical Understanding of Neural Networks: Beyond the Neural Tangent Kernel Theories","created":"2024-12-25","cited_by_count":0,"area":null},{"id":"2504.05158","title":"Leveraging Label Potential for Enhanced Multimodal Emotion Recognition","created":"2025-04-07","cited_by_count":0,"area":null},{"id":"2505.02614","title":"Entropic Mirror Descent for Linear Systems: Polyak's Stepsize and Implicit Bias","created":"2025-05-05","cited_by_count":0,"area":null},{"id":"2512.03393","title":"Tuning-Free Structured Sparse Recovery of Multiple Measurement Vectors using Implicit Regularization","created":"2025-12-03","cited_by_count":0,"area":null},{"id":"2605.00473","title":"Near-optimal and Efficient First-Order Algorithm for Multi-Task Learning with Shared Linear Representation","created":"2026-05-01","cited_by_count":0,"area":null},{"id":"2605.21104","title":"HORST: Composing Optimizer Geometries for Sparse Transformer Training","created":"2026-05-20","cited_by_count":0,"area":null},{"id":"2605.25134","title":"Theoretical Analysis of Sparse Optimization with Reparameterization, Weight Decay, and Adaptive Learning Rate","created":"2026-05-24","cited_by_count":0,"area":null},{"id":"2608.02576","title":"Smooth Reparameterizations of Functions on Simplicial Product Spaces: Applications to Probabilistic Tensor Decomposition and Functional Data Registration","created":"2026-08-03","cited_by_count":0,"area":null},{"id":"2609.34756","title":"Statistical Benefits of Fine-Tuning from Pretrained Initialization in Diagonal Linear Networks","created":"2026-09-28","cited_by_count":0,"area":null},{"id":"2610.06120","title":"Mind the Drift: Diagonal Linear Networks Under Large Learning Rates","created":"2026-10-05","cited_by_count":0,"area":null},{"id":"2610.16868","title":"From Parallel to Sequential: Small-Batch Noise Restores Simplicity Bias of Muon","created":"2026-10-12","cited_by_count":0,"area":null}],"next_cursor":null}