{"total":45,"rows":[{"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":"2205.02160","title":"Making SGD Parameter-Free","created":"2022-05-04","cited_by_count":50,"area":null},{"id":"2305.07583","title":"MoMo: Momentum Models for Adaptive Learning Rates","created":"2023-05-12","cited_by_count":24,"area":null},{"id":"2308.06058","title":"Adaptive SGD with Polyak stepsize and Line-search: Robust Convergence and Variance Reduction","created":"2023-08-11","cited_by_count":23,"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":"2106.11851","title":"Stochastic Polyak Stepsize with a Moving Target","created":"2021-06-22","cited_by_count":19,"area":null},{"id":"2202.12328","title":"Cutting Some Slack for SGD with Adaptive Polyak Stepsizes","created":"2022-02-24","cited_by_count":18,"area":null},{"id":"2307.07849","title":"Variational Inference with Gaussian Score Matching","created":"2023-07-15","cited_by_count":17,"area":null},{"id":"2110.11442","title":"Towards Noise-adaptive, Problem-adaptive (Accelerated) Stochastic Gradient Descent","created":"2021-10-21","cited_by_count":16,"area":null},{"id":"2301.04935","title":"A Stochastic Proximal Polyak Step Size","created":"2023-01-12","cited_by_count":15,"area":null},{"id":"2306.12747","title":"Don't be so Monotone: Relaxing Stochastic Line Search in Over-Parameterized Models","created":"2023-06-22","cited_by_count":15,"area":null},{"id":"2207.08171","title":"SP2: A Second Order Stochastic Polyak Method","created":"2022-07-17","cited_by_count":13,"area":null},{"id":"2406.04142","title":"Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance","created":"2024-06-06","cited_by_count":13,"area":null},{"id":"2505.20154","title":"UORA: Uniform Orthogonal Reinitialization Adaptation in Parameter-Efficient Fine-Tuning of Large Models","created":"2025-05-26","cited_by_count":11,"area":null},{"id":"2407.04358","title":"An Adaptive Stochastic Gradient Method with Non-negative Gauss-Newton Stepsizes","created":"2024-07-05","cited_by_count":10,"area":null},{"id":"2307.14528","title":"Function Value Learning: Adaptive Learning Rates Based on the Polyak Stepsize and Function Splitting in ERM","created":"2023-07-26","cited_by_count":8,"area":null},{"id":"2407.06183","title":"Stepping on the Edge: Curvature Aware Learning Rate Tuners","created":"2024-07-08","cited_by_count":8,"area":null},{"id":"2208.05287","title":"Adaptive Learning Rates for Faster Stochastic Gradient Methods","created":"2022-08-10","cited_by_count":7,"area":null},{"id":"2310.02093","title":"Stochastic Gradient Descent with Preconditioned Polyak Step-size","created":"2023-10-03","cited_by_count":7,"area":null},{"id":"2505.20219","title":"New Perspectives on the Polyak Stepsize: Surrogate Functions and Negative Results","created":"2025-05-26","cited_by_count":6,"area":null},{"id":"2305.08540","title":"SRRM: Semantic Region Relation Model for Indoor Scene Recognition","created":"2023-05-15","cited_by_count":5,"area":null},{"id":"2312.17369","title":"SANIA: Polyak-type Optimization Framework Leads to Scale Invariant Stochastic Algorithms","created":"2023-12-28","cited_by_count":5,"area":null},{"id":"2402.02342","title":"MetaOptimize: A Framework for Optimizing Step Sizes and Other Meta-parameters","created":"2024-02-04","cited_by_count":5,"area":null},{"id":"2504.01898","title":"Analysis of an Idealized Stochastic Polyak Method and its Application to Black-Box Model Distillation","created":"2025-04-02","cited_by_count":5,"area":null},{"id":"2312.00209","title":"On the Interplay Between Stepsize Tuning and Progressive Sharpening","created":"2023-11-30","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":"2405.15010","title":"Parameter-free Clipped Gradient Descent Meets Polyak","created":"2024-05-23","cited_by_count":3,"area":null},{"id":"2405.19585","title":"The High Line: Exact Risk and Learning Rate Curves of Stochastic Adaptive Learning Rate Algorithms","created":"2024-05-30","cited_by_count":3,"area":null},{"id":"2103.17132","title":"Empirically explaining SGD from a line search perspective","created":"2021-03-31","cited_by_count":2,"area":null},{"id":"2105.10011","title":"Comment on Stochastic Polyak Step-Size: Performance of ALI-G","created":"2021-05-20","cited_by_count":2,"area":null},{"id":"2407.16466","title":"Sobolev neural network with residual weighting as a surrogate in linear and non-linear mechanics","created":"2024-07-23","cited_by_count":2,"area":null},{"id":"2412.19444","title":"Towards Simple and Provable Parameter-Free Adaptive Gradient Methods","created":"2024-12-27","cited_by_count":2,"area":null},{"id":"2505.24005","title":"How far away are truly hyperparameter-free learning algorithms?","created":"2025-05-29","cited_by_count":2,"area":null},{"id":"2511.07767","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","created":"2025-11-11","cited_by_count":2,"area":null},{"id":"2102.10880","title":"A Probabilistically Motivated Learning Rate Adaptation for Stochastic Optimization","created":"2021-02-22","cited_by_count":0,"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":"2106.11548","title":"Adaptive Learning Rate and Momentum for Training Deep Neural Networks","created":"2021-06-22","cited_by_count":0,"area":null},{"id":"2108.13880","title":"Using a one dimensional parabolic model of the full-batch loss to estimate learning rates during training","created":"2021-08-31","cited_by_count":0,"area":null},{"id":"2305.12661","title":"Semantic-guided modeling of spatial relation and object co-occurrence for indoor scene recognition","created":"2023-05-22","cited_by_count":0,"area":null},{"id":"2404.02378","title":"Faster Convergence of Stochastic Accelerated Gradient Descent under Interpolation","created":"2024-04-03","cited_by_count":0,"area":null},{"id":"2511.20207","title":"Adaptive SGD with Line-Search and Polyak Stepsizes: Nonconvex Convergence and Accelerated Rates","created":"2025-11-25","cited_by_count":0,"area":null},{"id":"2601.15212","title":"ZENITH: Automated Gradient Norm Informed Stochastic Optimization","created":"2026-01-21","cited_by_count":0,"area":null},{"id":"2602.09842","title":"Step-Size Stability in Stochastic Optimization: A Theoretical Perspective","created":"2026-02-10","cited_by_count":0,"area":null},{"id":"2606.07841","title":"Large-scale empirical tuning and comparison of default optimizers for variational inference","created":"2026-06-05","cited_by_count":0,"area":null},{"id":"2609.36668","title":"Stochastic Heavy Ball with Polyak Step Size and Armijo Line Search: A General Convergence Analysis","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}