{"total":19,"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":"2305.16284","title":"DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Method","created":"2023-05-25","cited_by_count":35,"area":null},{"id":"2308.05621","title":"Normalized Gradients for All","created":"2023-08-10","cited_by_count":20,"area":null},{"id":"2403.04081","title":"Directional Smoothness and Gradient Methods: Convergence and Adaptivity","created":"2024-03-06","cited_by_count":17,"area":null},{"id":"2504.09951","title":"Towards Weaker Variance Assumptions for Stochastic Optimization","created":"2025-04-14","cited_by_count":17,"area":null},{"id":"2402.13794","title":"Revisiting Convergence of AdaGrad with Relaxed Assumptions","created":"2024-02-21","cited_by_count":15,"area":null},{"id":"2604.16620","title":"Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance","created":"2026-04-17","cited_by_count":5,"area":null},{"id":"2401.13971","title":"Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity","created":"2024-01-25","cited_by_count":3,"area":null},{"id":"2303.05037","title":"Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets","created":"2023-03-09","cited_by_count":2,"area":null},{"id":"2305.14161","title":"Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity","created":"2023-05-23","cited_by_count":2,"area":null},{"id":"2308.16362","title":"A Unified Analysis on the Subgradient Upper Bounds for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions","created":"2023-08-30","cited_by_count":2,"area":null},{"id":"2506.12648","title":"Glocal Smoothness: Line search and adaptive step sizes can help in theory too!","created":"2025-06-14","cited_by_count":2,"area":null},{"id":"2206.14981","title":"Randomized Coordinate Subgradient Method for Nonsmooth Composite Optimization","created":"2022-06-30","cited_by_count":1,"area":null},{"id":"2403.16317","title":"Optimization on a Finer Scale: Bounded Local Subgradient Variation Perspective","created":"2024-03-24","cited_by_count":1,"area":null},{"id":"2405.04376","title":"Towards Stability of Parameter-Free Optimization","created":"2024-05-07","cited_by_count":1,"area":null},{"id":"2406.02296","title":"Learning-Rate-Free Stochastic Optimization over Riemannian Manifolds","created":"2024-06-04","cited_by_count":1,"area":null},{"id":"2601.20076","title":"Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes","created":"2026-01-27","cited_by_count":1,"area":null},{"id":"2305.17323","title":"Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization","created":"2023-05-27","cited_by_count":0,"area":null},{"id":"2610.06070","title":"Last-Iterate Convergence Rate of Normalized Gradient Descent under H\\\"older Smoothness","created":"2026-10-05","cited_by_count":0,"area":null}],"next_cursor":null}