{"total":65,"rows":[{"id":"2103.17182","title":"Positive-Negative Momentum: Manipulating Stochastic Gradient Noise to Improve Generalization","created":"2021-03-31","cited_by_count":28,"area":null},{"id":"2212.13827","title":"Escaping Saddle Points for Effective Generalization on Class-Imbalanced Data","created":"2022-12-28","cited_by_count":28,"area":null},{"id":"2107.13289","title":"The loss landscape of deep linear neural networks: a second-order analysis","created":"2021-07-28","cited_by_count":24,"area":null},{"id":"2301.08203","title":"An SDE for Modeling SAM: Theory and Insights","created":"2023-01-19","cited_by_count":22,"area":null},{"id":"2207.00391","title":"A Theoretical Analysis of the Learning Dynamics under Class Imbalance","created":"2022-07-01","cited_by_count":20,"area":null},{"id":"2202.03684","title":"Efficiently Escaping Saddle Points in Bilevel Optimization","created":"2022-02-08","cited_by_count":19,"area":null},{"id":"2212.02083","title":"On the Overlooked Structure of Stochastic Gradients","created":"2022-12-05","cited_by_count":13,"area":null},{"id":"2305.15659","title":"How to escape sharp minima with random perturbations","created":"2023-05-25","cited_by_count":13,"area":null},{"id":"2406.01909","title":"A Global Geometric Analysis of Maximal Coding Rate Reduction","created":"2024-06-04","cited_by_count":13,"area":null},{"id":"2309.10688","title":"On the different regimes of Stochastic Gradient Descent","created":"2023-09-19","cited_by_count":12,"area":null},{"id":"2602.03067","title":"FlashSinkhorn: IO-Aware Entropic Optimal Transport on GPU","created":"2026-02-03","cited_by_count":11,"area":null},{"id":"2102.10734","title":"Provable Super-Convergence with a Large Cyclical Learning Rate","created":"2021-02-22","cited_by_count":10,"area":null},{"id":"2205.15142","title":"Special Properties of Gradient Descent with Large Learning Rates","created":"2022-05-30","cited_by_count":10,"area":null},{"id":"2212.07534","title":"Decentralized Nonconvex Optimization with Guaranteed Privacy and Accuracy","created":"2022-12-14","cited_by_count":10,"area":null},{"id":"2310.00692","title":"A Theoretical Analysis of Noise Geometry in Stochastic Gradient Descent","created":"2023-10-01","cited_by_count":9,"area":null},{"id":"2106.02985","title":"Escaping Saddle Points Faster with Stochastic Momentum","created":"2021-06-05","cited_by_count":8,"area":null},{"id":"2107.11774","title":"SGD with a Constant Large Learning Rate Can Converge to Local Maxima","created":"2021-07-25","cited_by_count":8,"area":null},{"id":"2410.12455","title":"Loss Landscape Characterization of Neural Networks without Over-Parametrization","created":"2024-10-16","cited_by_count":8,"area":null},{"id":"2106.09815","title":"Escaping strict saddle points of the Moreau envelope in nonsmooth optimization","created":"2021-06-17","cited_by_count":7,"area":null},{"id":"2211.00915","title":"Passage-Mask: A Learnable Regularization Strategy for Retriever-Reader Models","created":"2022-11-02","cited_by_count":6,"area":null},{"id":"2402.05626","title":"Loss Landscape of Shallow ReLU-like Neural Networks: Stationary Points, Saddle Escape, and Network Embedding","created":"2024-02-08","cited_by_count":6,"area":null},{"id":"2106.07094","title":"On the Convergence of Differentially Private Federated Learning on Non-Lipschitz Objectives, and with Normalized Client Updates","created":"2021-06-13","cited_by_count":5,"area":null},{"id":"2110.13265","title":"On the Second-order Convergence Properties of Random Search Methods","created":"2021-10-25","cited_by_count":5,"area":null},{"id":"2111.04004","title":"Exponential escape efficiency of SGD from sharp minima in non-stationary regime","created":"2021-11-07","cited_by_count":5,"area":null},{"id":"2208.10025","title":"Simple and Optimal Stochastic Gradient Methods for Nonsmooth Nonconvex Optimization","created":"2022-08-22","cited_by_count":5,"area":null},{"id":"2209.09162","title":"On the Theoretical Properties of Noise Correlation in Stochastic Optimization","created":"2022-09-19","cited_by_count":5,"area":null},{"id":"2302.04753","title":"Efficient displacement convex optimization with particle gradient descent","created":"2023-02-09","cited_by_count":5,"area":null},{"id":"2311.02546","title":"On the Second-Order Convergence of Biased Policy Gradient Algorithms","created":"2023-11-05","cited_by_count":5,"area":null},{"id":"2406.04549","title":"Concurrent Training and Layer Pruning of Deep Neural Networks","created":"2024-06-06","cited_by_count":5,"area":null},{"id":"2102.02837","title":"Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms","created":"2021-02-04","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":"2310.19059","title":"Escaping Saddle Points in Heterogeneous Federated Learning via Distributed SGD with Communication Compression","created":"2023-10-29","cited_by_count":4,"area":null},{"id":"2106.03763","title":"Vanishing Curvature and the Power of Adaptive Methods in Randomly Initialized Deep Networks","created":"2021-06-07","cited_by_count":3,"area":null},{"id":"2110.00684","title":"Learning Compact Representations of Neural Networks using DiscriminAtive Masking (DAM)","created":"2021-10-01","cited_by_count":3,"area":null},{"id":"2303.10599","title":"Convergence Analysis of Stochastic Gradient Descent with MCMC Estimators","created":"2023-03-19","cited_by_count":3,"area":null},{"id":"2306.02618","title":"Enhance Diffusion to Improve Robust Generalization","created":"2023-06-05","cited_by_count":3,"area":null},{"id":"2308.08070","title":"Max-affine regression via first-order methods","created":"2023-08-15","cited_by_count":3,"area":null},{"id":"2412.13715","title":"SSE-SAM: Balancing Head and Tail Classes Gradually through Stage-Wise SAM","created":"2024-12-18","cited_by_count":3,"area":null},{"id":"2505.15647","title":"Second-Order Convergence in Private Stochastic Non-Convex Optimization","created":"2025-05-21","cited_by_count":3,"area":null},{"id":"2202.09052","title":"Tackling benign nonconvexity with smoothing and stochastic gradients","created":"2022-02-18","cited_by_count":2,"area":null},{"id":"2209.03705","title":"Losing momentum in continuous-time stochastic optimisation","created":"2022-09-08","cited_by_count":2,"area":null},{"id":"2311.08745","title":"Using Stochastic Gradient Descent to Smooth Nonconvex Functions: Analysis of Implicit Graduated Optimization","created":"2023-11-15","cited_by_count":2,"area":null},{"id":"2506.20344","title":"A Complete Loss Landscape Analysis of Regularized Deep Matrix Factorization","created":"2025-06-25","cited_by_count":2,"area":null},{"id":"2509.18001","title":"Unveiling m-Sharpness Through the Structure of Stochastic Gradient Noise","created":"2025-09-22","cited_by_count":2,"area":null},{"id":"2602.05600","title":"On the Superlinear Relationship between SGD Noise Covariance and Loss Landscape Curvature","created":"2026-02-05","cited_by_count":2,"area":null},{"id":"2101.06847","title":"On the Differentially Private Nature of Perturbed Gradient Descent","created":"2021-01-18","cited_by_count":1,"area":null},{"id":"2103.00075","title":"Noisy Truncated SGD: Optimization and Generalization","created":"2021-02-26","cited_by_count":1,"area":null},{"id":"2110.13144","title":"Faster Perturbed Stochastic Gradient Methods for Finding Local Minima","created":"2021-10-25","cited_by_count":1,"area":null},{"id":"2212.14150","title":"A Dynamics Theory of Implicit Regularization in Deep Low-Rank Matrix Factorization","created":"2022-12-29","cited_by_count":1,"area":null},{"id":"2302.07862","title":"Almost Sure Saddle Avoidance of Stochastic Gradient Methods without the Bounded Gradient Assumption","created":"2023-02-15","cited_by_count":1,"area":null},{"id":"2311.14120","title":"Weight fluctuations in (deep) linear neural networks and a derivation of the inverse-variance flatness relation","created":"2023-11-23","cited_by_count":1,"area":null},{"id":"2401.09274","title":"Avoiding strict saddle points of nonconvex regularized problems","created":"2024-01-17","cited_by_count":1,"area":null},{"id":"2410.06878","title":"Noise is All You Need: Private Second-Order Convergence of Noisy SGD","created":"2024-10-09","cited_by_count":1,"area":null},{"id":"2411.09127","title":"Complexity-Aware Training of Deep Neural Networks for Optimal Structure Discovery","created":"2024-11-14","cited_by_count":1,"area":null},{"id":"2605.09331","title":"Dimension-Free Saddle-Point Escape in Muon","created":"2026-05-10","cited_by_count":1,"area":null},{"id":"2101.02625","title":"Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm","created":"2021-01-07","cited_by_count":0,"area":null},{"id":"2103.04413","title":"Escaping Saddle Points with Stochastically Controlled Stochastic Gradient Methods","created":"2021-03-07","cited_by_count":0,"area":null},{"id":"2112.07110","title":"Non-Asymptotic Analysis of Online Multiplicative Stochastic Gradient Descent","created":"2021-12-14","cited_by_count":0,"area":null},{"id":"2205.13753","title":"HOUDINI: Escaping from Moderately Constrained Saddles","created":"2022-05-27","cited_by_count":0,"area":null},{"id":"2301.12174","title":"Stochastic Dimension-reduced Second-order Methods for Policy Optimization","created":"2023-01-28","cited_by_count":0,"area":null},{"id":"2411.16200","title":"Neural Network-based High-index Saddle Dynamics Method for Searching Saddle Points and Solution Landscape","created":"2024-11-25","cited_by_count":0,"area":null},{"id":"2502.12329","title":"A Novel Unified Parametric Assumption for Nonconvex Optimization","created":"2025-02-17","cited_by_count":0,"area":null},{"id":"2508.16540","title":"Escaping Saddle Points via Curvature-Calibrated Perturbations: A Complete Analysis with Explicit Constants and Empirical Validation","created":"2025-08-22","cited_by_count":0,"area":null},{"id":"2605.01288","title":"A Theory of Saddle Escape in Deep Nonlinear Networks","created":"2026-05-02","cited_by_count":0,"area":null},{"id":"2609.13057","title":"Benign Loss Landscapes Can Coexist with Worst-Case Hardness","created":"2026-09-11","cited_by_count":0,"area":null}],"next_cursor":null}