{"total":39,"rows":[{"id":"2503.12645","title":"Understanding Gradient Orthogonalization for Deep Learning via Non-Euclidean Trust-Region Optimization","created":"2025-03-16","cited_by_count":92,"area":null},{"id":"2302.12022","title":"DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedule","created":"2023-02-08","cited_by_count":85,"area":null},{"id":"2102.13152","title":"Local Stochastic Gradient Descent Ascent: Convergence Analysis and Communication Efficiency","created":"2021-02-25","cited_by_count":40,"area":null},{"id":"2106.08315","title":"Decentralized Local Stochastic Extra-Gradient for Variational Inequalities","created":"2021-06-15","cited_by_count":25,"area":null},{"id":"2107.05074","title":"SGD: The Role of Implicit Regularization, Batch-size and Multiple-epochs","created":"2021-07-11","cited_by_count":22,"area":null},{"id":"2106.11851","title":"Stochastic Polyak Stepsize with a Moving Target","created":"2021-06-22","cited_by_count":19,"area":null},{"id":"2506.23803","title":"SGD with Adaptive Preconditioning: Unified Analysis and Momentum Acceleration","created":"2025-06-30","cited_by_count":12,"area":null},{"id":"2402.11173","title":"How to Make the Gradients Small Privately: Improved Rates for Differentially Private Non-Convex Optimization","created":"2024-02-17","cited_by_count":10,"area":null},{"id":"2106.06075","title":"A Decentralized Adaptive Momentum Method for Solving a Class of Min-Max Optimization Problems","created":"2021-06-10","cited_by_count":9,"area":null},{"id":"2302.11085","title":"Learning to Generalize Provably in Learning to Optimize","created":"2023-02-22","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":"2102.13233","title":"Spurious Local Minima Are Common for Deep Neural Networks with Piecewise Linear Activations","created":"2021-02-25","cited_by_count":7,"area":null},{"id":"2603.21191","title":"On the Role of Batch Size in Stochastic Conditional Gradient Methods","created":"2026-03-22","cited_by_count":7,"area":null},{"id":"2210.13983","title":"Optimization for Amortized Inverse Problems","created":"2022-10-25","cited_by_count":6,"area":null},{"id":"2502.02002","title":"The Ball-Proximal (=\"Broximal\") Point Method: a New Algorithm, Convergence Theory, and Applications","created":"2025-02-04","cited_by_count":5,"area":null},{"id":"2505.23737","title":"On the Convergence Analysis of Muon","created":"2025-05-29","cited_by_count":5,"area":null},{"id":"2602.05813","title":"Where Does Warm-Up Come From? Adaptive Scheduling for Norm-Constrained Optimizers","created":"2026-02-05","cited_by_count":5,"area":null},{"id":"2303.11526","title":"PRISE: Demystifying Deep Lucas-Kanade with Strongly Star-Convex Constraints for Multimodel Image Alignment","created":"2023-03-21","cited_by_count":4,"area":null},{"id":"2201.12678","title":"A Stochastic Bundle Method for Interpolating Networks","created":"2022-01-29","cited_by_count":3,"area":null},{"id":"2204.10536","title":"Sharper Utility Bounds for Differentially Private Models","created":"2022-04-22","cited_by_count":3,"area":null},{"id":"2411.10649","title":"Deep Loss Convexification for Learning Iterative Models","created":"2024-11-16","cited_by_count":3,"area":null},{"id":"2503.03625","title":"Deterministic Global Optimization of the Acquisition Function in Bayesian Optimization: To Do or Not To Do?","created":"2025-03-05","cited_by_count":3,"area":null},{"id":"2505.02281","title":"Minimisation of Quasar-Convex Functions Using Random Zeroth-Order Oracles","created":"2025-05-04","cited_by_count":3,"area":null},{"id":"2602.07145","title":"Convex Dominance in Deep Learning I: A Scaling Law of Loss and Learning Rate","created":"2026-02-06","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":"2206.05869","title":"On the Convergence to a Global Solution of Shuffling-Type Gradient Algorithms","created":"2022-06-13","cited_by_count":2,"area":null},{"id":"2210.01834","title":"Invariant Aggregator for Defending against Federated Backdoor Attacks","created":"2022-10-04","cited_by_count":2,"area":null},{"id":"2510.01943","title":"Smooth Quasar-Convex Optimization with Constraints","created":"2025-10-02","cited_by_count":2,"area":null},{"id":"2304.02613","title":"Efficient Quantum Algorithms for Quantum Optimal Control","created":"2023-04-05","cited_by_count":1,"area":null},{"id":"2104.01730","title":"Training Deep Neural Networks via Branch-and-Bound","created":"2021-04-05","cited_by_count":0,"area":null},{"id":"2107.08686","title":"Improved Learning Rates for Stochastic Optimization","created":"2021-07-19","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":"2210.04318","title":"Prediction intervals for neural network models using weighted asymmetric loss functions","created":"2022-10-09","cited_by_count":0,"area":null},{"id":"2503.02129","title":"Path Regularization: A Near-Complete and Optimal Nonasymptotic Generalization Theory for Multilayer Neural Networks and Double Descent Phenomenon","created":"2025-03-03","cited_by_count":0,"area":null},{"id":"2602.21276","title":"Neural network optimization strategies and the topography of the loss landscape","created":"2026-02-24","cited_by_count":0,"area":null},{"id":"2604.14017","title":"Stochastic Trust-Region Methods for Over-parameterized Models","created":"2026-04-15","cited_by_count":0,"area":null},{"id":"2605.15522","title":"Stochastic Non-Smooth Convex Optimization with Unbounded Gradients","created":"2026-05-15","cited_by_count":0,"area":null},{"id":"2606.14970","title":"Zero-order Parameter-free Optimization for LMO-based Methods: Novel Approach for Efficient Fine-tuning","created":"2026-06-12","cited_by_count":0,"area":null},{"id":"2606.23477","title":"Sublinearly Structured Deep Neural Networks Achieve Feature Learning Consistency for Compositional Functions","created":"2026-06-22","cited_by_count":0,"area":null}],"next_cursor":null}