{"total":37,"rows":[{"id":"2307.00144","title":"Abide by the Law and Follow the Flow: Conservation Laws for Gradient Flows","created":"2023-06-30","cited_by_count":45,"area":null},{"id":"2301.11500","title":"Understanding Incremental Learning of Gradient Descent: A Fine-grained Analysis of Matrix Sensing","created":"2023-01-27","cited_by_count":42,"area":null},{"id":"2406.06158","title":"Get rich quick: exact solutions reveal how unbalanced initializations promote rapid feature learning","created":"2024-06-10","cited_by_count":42,"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":"2403.06925","title":"Transformers Learn Low Sensitivity Functions: Investigations and Implications","created":"2024-03-11","cited_by_count":14,"area":null},{"id":"2408.09966","title":"Mask in the Mirror: Implicit Sparsification","created":"2024-08-19","cited_by_count":14,"area":null},{"id":"2504.12883","title":"Mirror, Mirror of the Flow: How Does Regularization Shape Implicit Bias?","created":"2025-04-17","cited_by_count":12,"area":null},{"id":"2302.09693","title":"mSAM: Micro-Batch-Averaged Sharpness-Aware Minimization","created":"2023-02-19","cited_by_count":10,"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":"2209.09315","title":"Deep Linear Networks can Benignly Overfit when Shallow Ones Do","created":"2022-09-19","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":"2504.12801","title":"Sign-In to the Lottery: Reparameterizing Sparse Training From Scratch","created":"2025-04-17","cited_by_count":6,"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":"2306.00342","title":"Combining Explicit and Implicit Regularization for Efficient Learning in Deep Networks","created":"2023-06-01","cited_by_count":4,"area":null},{"id":"2311.14387","title":"Achieving Margin Maximization Exponentially Fast via Progressive Norm Rescaling","created":"2023-11-24","cited_by_count":4,"area":null},{"id":"2508.07370","title":"Intrinsic training dynamics of deep neural networks","created":"2025-08-10","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":"2403.08585","title":"Improving Implicit Regularization of SGD with Preconditioning for Least Square Problems","created":"2024-03-13","cited_by_count":3,"area":null},{"id":"2410.14158","title":"A Mirror Descent Perspective of Smoothed Sign Descent","created":"2024-10-18","cited_by_count":3,"area":null},{"id":"2505.12325","title":"Neural Graduated Assignment for Maximum Common Edge Subgraphs","created":"2025-05-18","cited_by_count":3,"area":null},{"id":"2507.15264","title":"On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem","created":"2025-07-21","cited_by_count":3,"area":null},{"id":"2601.06597","title":"Understanding and inverse design of implicit bias in stochastic learning: a geometric perspective","created":"2026-01-10","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":"2412.16765","title":"Optimization Insights into Deep Diagonal Linear Networks","created":"2024-12-21","cited_by_count":2,"area":null},{"id":"2603.06248","title":"Gradient Flow Polarizes Softmax Outputs towards Low-Entropy Solutions","created":"2026-03-06","cited_by_count":2,"area":null},{"id":"2606.23198","title":"Incremental Learning in Mirror Flows","created":"2026-06-22","cited_by_count":2,"area":null},{"id":"2606.14929","title":"Policy Regret for Embedding Model Routing: Contextual Bandits with Low-Rank Experts","created":"2026-06-12","cited_by_count":1,"area":null},{"id":"2607.12332","title":"Gradient Flow Dynamics and Implicit Bias of Diagonal Linear Networks under Infinitesimal Initialization","created":"2026-07-14","cited_by_count":1,"area":null},{"id":"2303.14244","title":"Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensing","created":"2023-03-24","cited_by_count":0,"area":null},{"id":"2603.17527","title":"Mirror Descent on Riemannian Manifolds","created":"2026-03-18","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":"2605.26373","title":"Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2608.07248","title":"Establishing Boundary KKT Convergence of Mirror Descent through Reparameterization","created":"2026-08-07","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}