{"total":15,"rows":[{"id":"2402.17722","title":"Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence","created":"2024-02-27","cited_by_count":11,"area":null},{"id":"2306.14522","title":"Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning","created":"2023-06-26","cited_by_count":7,"area":null},{"id":"2104.14562","title":"Stochastic Mirror Descent for Low-Rank Tensor Decomposition Under Non-Euclidean Losses","created":"2021-04-29","cited_by_count":4,"area":null},{"id":"2107.08011","title":"Adaptive first-order methods revisited: Convex optimization without Lipschitz requirements","created":"2021-07-16","cited_by_count":4,"area":null},{"id":"2112.11928","title":"A Stochastic Bregman Primal-Dual Splitting Algorithm for Composite Optimization","created":"2021-12-22","cited_by_count":4,"area":null},{"id":"2401.13971","title":"Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity","created":"2024-01-25","cited_by_count":3,"area":null},{"id":"2402.13530","title":"Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model","created":"2024-02-21","cited_by_count":3,"area":null},{"id":"2606.00520","title":"In-Expectation Convergence of Stochastic Gradient Methods under Heavy-Tailed Noise","created":"2026-05-30","cited_by_count":3,"area":null},{"id":"2202.12843","title":"Dynamic Regret of Online Mirror Descent for Relatively Smooth Convex Cost Functions","created":"2022-02-25","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":"2206.14981","title":"Randomized Coordinate Subgradient Method for Nonsmooth Composite Optimization","created":"2022-06-30","cited_by_count":1,"area":null},{"id":"2308.10767","title":"GBM-based Bregman Proximal Algorithms for Constrained Learning","created":"2023-08-21","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":"2305.17323","title":"Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization","created":"2023-05-27","cited_by_count":0,"area":null}],"next_cursor":null}