{"total":23,"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":"2102.11845","title":"Learning with User-Level Privacy","created":"2021-02-23","cited_by_count":72,"area":null},{"id":"2302.08300","title":"Deterministic Nonsmooth Nonconvex Optimization","created":"2023-02-16","cited_by_count":26,"area":null},{"id":"2105.01778","title":"Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss","created":"2021-05-04","cited_by_count":17,"area":null},{"id":"2508.04860","title":"Can SGD Handle Heavy-Tailed Noise?","created":"2025-08-06","cited_by_count":17,"area":null},{"id":"2107.00469","title":"Never Go Full Batch (in Stochastic Convex Optimization)","created":"2021-06-29","cited_by_count":14,"area":null},{"id":"2101.11041","title":"Complementary Composite Minimization, Small Gradients in General Norms, and Applications","created":"2021-01-26","cited_by_count":9,"area":null},{"id":"2112.01118","title":"Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness","created":"2021-12-02","cited_by_count":6,"area":null},{"id":"2511.20584","title":"A Tale of Two Geometries: Adaptive Optimizers and Non-Euclidean Descent","created":"2025-11-25","cited_by_count":5,"area":null},{"id":"2510.11676","title":"Accelerated stochastic first-order method for convex optimization under heavy-tailed noise","created":"2025-10-13","cited_by_count":4,"area":null},{"id":"2103.00299","title":"Primal-Dual Stochastic Mirror Descent for MDPs","created":"2021-02-27","cited_by_count":3,"area":null},{"id":"2409.10773","title":"Tight Lower Bounds under Asymmetric High-Order H\\\"older Smoothness and Uniform Convexity","created":"2024-09-16","cited_by_count":3,"area":null},{"id":"2506.06606","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","created":"2025-06-07","cited_by_count":3,"area":null},{"id":"2302.12808","title":"Linearization Algorithms for Fully Composite Optimization","created":"2023-02-24","cited_by_count":2,"area":null},{"id":"2404.02511","title":"Stochastic Constrained Decentralized Optimization for Machine Learning with Fewer Data Oracles: a Gradient Sliding Approach","created":"2024-04-03","cited_by_count":2,"area":null},{"id":"2606.15268","title":"When to use what Schatten-$p$ norm in deep learning?","created":"2026-06-13","cited_by_count":2,"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":"2409.19200","title":"Faster Acceleration for Steepest Descent","created":"2024-09-28","cited_by_count":1,"area":null},{"id":"2506.19752","title":"On the necessity of adaptive regularisation:Optimal anytime online learning on $\\boldsymbol{\\ell_p}$-balls","created":"2025-06-24","cited_by_count":1,"area":null},{"id":"2609.20701","title":"Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle Rates","created":"2026-09-17","cited_by_count":1,"area":null},{"id":"2512.10825","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","created":"2025-12-11","cited_by_count":0,"area":null},{"id":"2607.27476","title":"Entropy-Smooth Convex Optimization Cannot Be Accelerated","created":"2026-07-29","cited_by_count":0,"area":null},{"id":"2609.21880","title":"Near-Optimal Acceleration for Smooth $\\ell_p$ / $\\ell_q$ Nondual Convex First-Order Oracle Optimization","created":"2026-09-18","cited_by_count":0,"area":null}],"next_cursor":null}