{"total":40,"rows":[{"id":"2101.08286","title":"Can stable and accurate neural networks be computed? -- On the barriers of deep learning and Smale's 18th problem","created":"2021-01-20","cited_by_count":53,"area":null},{"id":"2106.08502","title":"Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descent","created":"2021-06-16","cited_by_count":32,"area":null},{"id":"2111.01875","title":"Subquadratic Overparameterization for Shallow Neural Networks","created":"2021-11-02","cited_by_count":26,"area":null},{"id":"2108.02391","title":"Adapting to Function Difficulty and Growth Conditions in Private Optimization","created":"2021-08-05","cited_by_count":20,"area":null},{"id":"2206.10713","title":"Beyond Uniform Lipschitz Condition in Differentially Private Optimization","created":"2022-06-21","cited_by_count":19,"area":null},{"id":"2206.08868","title":"A Conditional Gradient-based Method for Simple Bilevel Optimization with Convex Lower-level Problem","created":"2022-06-17","cited_by_count":17,"area":null},{"id":"2209.10825","title":"Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis","created":"2022-09-22","cited_by_count":12,"area":null},{"id":"2306.07892","title":"Robustly Learning a Single Neuron via Sharpness","created":"2023-06-13","cited_by_count":12,"area":null},{"id":"2106.02720","title":"An Even More Optimal Stochastic Optimization Algorithm: Minibatching and Interpolation Learning","created":"2021-06-04","cited_by_count":10,"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":"2506.06599","title":"Direct Prediction Set Minimization via Bilevel Conformal Classifier Training","created":"2025-06-07","cited_by_count":8,"area":null},{"id":"2110.07810","title":"Towards Statistical and Computational Complexities of Polyak Step Size Gradient Descent","created":"2021-10-15","cited_by_count":5,"area":null},{"id":"2204.14067","title":"Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition","created":"2022-04-29","cited_by_count":5,"area":null},{"id":"2209.00771","title":"Optimizing the Performative Risk under Weak Convexity Assumptions","created":"2022-09-02","cited_by_count":5,"area":null},{"id":"2212.07844","title":"Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems","created":"2022-12-15","cited_by_count":5,"area":null},{"id":"2101.00935","title":"First-Order Methods for Convex Optimization","created":"2021-01-04","cited_by_count":4,"area":null},{"id":"2102.05134","title":"Local and Global Uniform Convexity Conditions","created":"2021-02-09","cited_by_count":4,"area":null},{"id":"2311.13447","title":"Differentially Private Non-Convex Optimization under the KL Condition with Optimal Rates","created":"2023-11-22","cited_by_count":4,"area":null},{"id":"2312.01047","title":"A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization","created":"2023-12-02","cited_by_count":4,"area":null},{"id":"2402.08097","title":"An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization","created":"2024-02-12","cited_by_count":4,"area":null},{"id":"2306.09778","title":"Gradient is All You Need? How Consensus-Based Optimization can be Interpreted as a Stochastic Relaxation of Gradient Descent","created":"2023-06-16","cited_by_count":3,"area":null},{"id":"2308.09310","title":"Variance reduction techniques for stochastic proximal point algorithms","created":"2023-08-18","cited_by_count":3,"area":null},{"id":"2309.12128","title":"Convergence and Recovery Guarantees of Unsupervised Neural Networks for Inverse Problems","created":"2023-09-21","cited_by_count":3,"area":null},{"id":"2410.16849","title":"Polyak's Heavy Ball Method Achieves Accelerated Local Rate of Convergence under Polyak-Lojasiewicz Inequality","created":"2024-10-22","cited_by_count":3,"area":null},{"id":"2505.11434","title":"Controlling the Flow: Stability and Convergence for Stochastic Gradient Descent with Decaying Regularization","created":"2025-05-16","cited_by_count":3,"area":null},{"id":"2301.02268","title":"Restarts subject to approximate sharpness: A parameter-free and optimal scheme for first-order methods","created":"2023-01-05","cited_by_count":2,"area":null},{"id":"2505.17965","title":"Bias-Optimal Bounds for SGD: A Computer-Aided Lyapunov Analysis","created":"2025-05-23","cited_by_count":2,"area":null},{"id":"2110.12437","title":"WARPd: A linearly convergent first-order method for inverse problems with approximate sharpness conditions","created":"2021-10-24","cited_by_count":1,"area":null},{"id":"2205.07999","title":"An Exponentially Increasing Step-size for Parameter Estimation in Statistical Models","created":"2022-05-16","cited_by_count":1,"area":null},{"id":"2403.05395","title":"Recovery Guarantees of Unsupervised Neural Networks for Inverse Problems trained with Gradient Descent","created":"2024-03-08","cited_by_count":1,"area":null},{"id":"2404.19517","title":"Inexact subgradient methods for semialgebraic functions","created":"2024-04-30","cited_by_count":1,"area":null},{"id":"2604.04130","title":"Primal-Dual Methods for Nonsmooth Nonconvex Optimization with Orthogonality Constraints","created":"2026-04-05","cited_by_count":1,"area":null},{"id":"2108.04482","title":"Complexity of Inexact Proximal Point Algorithm for minimizing convex functions with Holderian Growth","created":"2021-08-10","cited_by_count":0,"area":null},{"id":"2212.12675","title":"Iterative regularization in classification via hinge loss diagonal descent","created":"2022-12-24","cited_by_count":0,"area":null},{"id":"2303.16822","title":"An inexact LPA for DC composite optimization and application to matrix completions with outliers","created":"2023-03-29","cited_by_count":0,"area":null},{"id":"2411.15795","title":"Beyond adaptive gradient: Fast-Controlled Minibatch Algorithm for large-scale optimization","created":"2024-11-24","cited_by_count":0,"area":null},{"id":"2412.11554","title":"Learning Massive-scale Partial Correlation Networks in Clinical Multi-omics Studies with HP-ACCORD","created":"2024-12-16","cited_by_count":0,"area":null},{"id":"2604.17067","title":"Trajectory-Restricted Optimization Conditions and Geometry-Aware Linear Convergence","created":"2026-04-18","cited_by_count":0,"area":null},{"id":"2607.06151","title":"Leveraging Extragradient for Effective Sharpness-Aware Minimization in Deep Learning","created":"2026-07-07","cited_by_count":0,"area":null},{"id":"2607.20769","title":"Memory-Computation Tradeoffs in Semi Amortized Parametric Optimization","created":"2026-07-22","cited_by_count":0,"area":null}],"next_cursor":null}