{"total":19,"rows":[{"id":"2302.14428","title":"Stochastic Gradient Descent under Markovian Sampling Schemes","created":"2023-02-28","cited_by_count":38,"area":null},{"id":"2302.08982","title":"(S)GD over Diagonal Linear Networks: Implicit Regularisation, Large Stepsizes and Edge of Stability","created":"2023-02-17","cited_by_count":36,"area":null},{"id":"2110.15412","title":"Stochastic Mirror Descent: Convergence Analysis and Adaptive Variants via the Mirror Stochastic Polyak Stepsize","created":"2021-10-28","cited_by_count":22,"area":null},{"id":"2209.02257","title":"Faster federated optimization under second-order similarity","created":"2022-09-06","cited_by_count":18,"area":null},{"id":"2105.04319","title":"A Bregman Learning Framework for Sparse Neural Networks","created":"2021-05-10","cited_by_count":15,"area":null},{"id":"2106.11428","title":"Local convexity of the TAP free energy and AMP convergence for Z2-synchronization","created":"2021-06-21","cited_by_count":15,"area":null},{"id":"2109.07455","title":"Deep Bregman Divergence for Contrastive Learning of Visual Representations","created":"2021-09-15","cited_by_count":13,"area":null},{"id":"2304.07504","title":"Stochastic Distributed Optimization under Average Second-order Similarity: Algorithms and Analysis","created":"2023-04-15","cited_by_count":11,"area":null},{"id":"2302.03542","title":"Two Losses Are Better Than One: Faster Optimization Using a Cheaper Proxy","created":"2023-02-07","cited_by_count":7,"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":"2302.01581","title":"Learning to Decouple Complex Systems","created":"2023-02-03","cited_by_count":3,"area":null},{"id":"2305.15249","title":"Decision-Aware Actor-Critic with Function Approximation and Theoretical Guarantees","created":"2023-05-24","cited_by_count":3,"area":null},{"id":"2507.15264","title":"On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem","created":"2025-07-21","cited_by_count":3,"area":null},{"id":"2403.06677","title":"Streamlining in the Riemannian Realm: Efficient Riemannian Optimization with Loopless Variance Reduction","created":"2024-03-11","cited_by_count":2,"area":null},{"id":"2311.16706","title":"Sinkhorn Flow: A Continuous-Time Framework for Understanding and Generalizing the Sinkhorn Algorithm","created":"2023-11-28","cited_by_count":1,"area":null},{"id":"2604.00683","title":"Convergence of projected stochastic natural gradient variational inference for various step size and sample or batch size schedules","created":"2026-04-01","cited_by_count":1,"area":null},{"id":"2111.06826","title":"Convergence Rates for the MAP of an Exponential Family and Stochastic Mirror Descent -- an Open Problem","created":"2021-11-12","cited_by_count":0,"area":null},{"id":"2207.08195","title":"SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization","created":"2022-07-17","cited_by_count":0,"area":null},{"id":"2306.17470","title":"Oblivious Stochastic Composite Optimization","created":"2023-06-30","cited_by_count":0,"area":null}],"next_cursor":null}