{"total":25,"rows":[{"id":"2210.14355","title":"Parameter-free Regret in High Probability with Heavy Tails","created":"2022-10-25","cited_by_count":28,"area":null},{"id":"2303.15740","title":"Concentration of Contractive Stochastic Approximation: Additive and Multiplicative Noise","created":"2023-03-28","cited_by_count":26,"area":null},{"id":"2102.09393","title":"On the Convergence of Step Decay Step-Size for Stochastic Optimization","created":"2021-02-18","cited_by_count":21,"area":null},{"id":"2206.00743","title":"Nest Your Adaptive Algorithm for Parameter-Agnostic Nonconvex Minimax Optimization","created":"2022-06-01","cited_by_count":16,"area":null},{"id":"2110.11271","title":"Analyzing and Improving the Optimization Landscape of Noise-Contrastive Estimation","created":"2021-10-21","cited_by_count":15,"area":null},{"id":"2305.13209","title":"Faster Differentially Private Convex Optimization via Second-Order Methods","created":"2023-05-22","cited_by_count":13,"area":null},{"id":"2306.11497","title":"Convergence and concentration properties of constant step-size SGD through Markov chains","created":"2023-06-20","cited_by_count":11,"area":null},{"id":"2108.11483","title":"Heavy-tailed Streaming Statistical Estimation","created":"2021-08-25","cited_by_count":10,"area":null},{"id":"2208.08567","title":"High Probability Bounds for Stochastic Subgradient Schemes with Heavy Tailed Noise","created":"2022-08-17","cited_by_count":9,"area":null},{"id":"2106.01488","title":"Minimax Optimization with Smooth Algorithmic Adversaries","created":"2021-06-02","cited_by_count":8,"area":null},{"id":"2106.09815","title":"Escaping strict saddle points of the Moreau envelope in nonsmooth optimization","created":"2021-06-17","cited_by_count":7,"area":null},{"id":"2110.07098","title":"A Cubic Regularization Approach for Finding Local Minimax Points in Nonconvex Minimax Optimization","created":"2021-10-14","cited_by_count":5,"area":null},{"id":"2605.20999","title":"Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise","created":"2026-05-20","cited_by_count":5,"area":null},{"id":"2311.13447","title":"Differentially Private Non-Convex Optimization under the KL Condition with Optimal Rates","created":"2023-11-22","cited_by_count":4,"area":null},{"id":"2512.13123","title":"Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequences","created":"2025-12-15","cited_by_count":4,"area":null},{"id":"2209.10866","title":"A One-shot Framework for Distributed Clustered Learning in Heterogeneous Environments","created":"2022-09-22","cited_by_count":3,"area":null},{"id":"2402.07588","title":"Understanding Model Selection For Learning In Strategic Environments","created":"2024-02-12","cited_by_count":3,"area":null},{"id":"2310.12969","title":"Demystifying the Myths and Legends of Nonconvex Convergence of SGD","created":"2023-10-19","cited_by_count":2,"area":null},{"id":"2401.15890","title":"Probabilistic Guarantees of Stochastic Recursive Gradient in Non-Convex Finite Sum Problems","created":"2024-01-29","cited_by_count":2,"area":null},{"id":"2608.25551","title":"Beyond Optimal Rates in Stochastic Optimization: Trajectory-Adaptive Stopping Rules","created":"2026-08-26","cited_by_count":1,"area":null},{"id":"2208.00502","title":"Formal guarantees for heuristic optimization algorithms used in machine learning","created":"2022-07-31","cited_by_count":0,"area":null},{"id":"2303.11937","title":"High Probability Bounds for Stochastic Continuous Submodular Maximization","created":"2023-03-20","cited_by_count":0,"area":null},{"id":"2305.00254","title":"Semi-Infinitely Constrained Markov Decision Processes and Efficient Reinforcement Learning","created":"2023-04-29","cited_by_count":0,"area":null},{"id":"2605.07239","title":"Sample Complexity of Stochastic Optimization with Integer Variables","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2609.12765","title":"High-Probability Convergence of SGD via Batched Updates","created":"2026-09-11","cited_by_count":0,"area":null}],"next_cursor":null}