{"total":25,"rows":[{"id":"2202.04428","title":"Adapting to Mixing Time in Stochastic Optimization with Markovian Data","created":"2022-02-09","cited_by_count":36,"area":null},{"id":"2206.00363","title":"Bring Your Own Algorithm for Optimal Differentially Private Stochastic Minimax Optimization","created":"2022-06-01","cited_by_count":22,"area":null},{"id":"2208.05925","title":"Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization","created":"2022-08-11","cited_by_count":20,"area":null},{"id":"2301.00457","title":"ReSQueing Parallel and Private Stochastic Convex Optimization","created":"2023-01-01","cited_by_count":17,"area":null},{"id":"2203.13225","title":"Distributionally Robust Optimization via Ball Oracle Acceleration","created":"2022-03-24","cited_by_count":14,"area":null},{"id":"2310.18535","title":"Contextual Stochastic Bilevel Optimization","created":"2023-10-27","cited_by_count":14,"area":null},{"id":"2312.05134","title":"Optimal Multi-Distribution Learning","created":"2023-12-08","cited_by_count":13,"area":null},{"id":"2206.08627","title":"RECAPP: Crafting a More Efficient Catalyst for Convex Optimization","created":"2022-06-17","cited_by_count":8,"area":null},{"id":"2403.02912","title":"Mirror Descent Algorithms with Nearly Dimension-Independent Rates for Differentially-Private Stochastic Saddle-Point Problems","created":"2024-03-05","cited_by_count":7,"area":null},{"id":"2406.02789","title":"Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple Reductions","created":"2024-06-04","cited_by_count":6,"area":null},{"id":"2402.02951","title":"Dynamic Byzantine-Robust Learning: Adapting to Switching Byzantine Workers","created":"2024-02-05","cited_by_count":5,"area":null},{"id":"2408.11084","title":"Multi-level Monte-Carlo Gradient Methods for Stochastic Optimization with Biased Oracles","created":"2024-08-20","cited_by_count":5,"area":null},{"id":"2502.02002","title":"The Ball-Proximal (=\"Broximal\") Point Method: a New Algorithm, Convergence Theory, and Applications","created":"2025-02-04","cited_by_count":5,"area":null},{"id":"2506.06087","title":"Multilevel neural simulation-based inference","created":"2025-06-06","cited_by_count":5,"area":null},{"id":"2602.05531","title":"Solving Stochastic Variational Inequalities without the Bounded Variance Assumption","created":"2026-02-05","cited_by_count":5,"area":null},{"id":"2402.05071","title":"Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity","created":"2024-02-07","cited_by_count":4,"area":null},{"id":"2406.03006","title":"Quantum Algorithms and Lower Bounds for Finite-Sum Optimization","created":"2024-06-05","cited_by_count":4,"area":null},{"id":"2510.00823","title":"Non-Euclidean Broximal Point Method: A Blueprint for Geometry-Aware Optimization","created":"2025-10-01","cited_by_count":4,"area":null},{"id":"2311.10886","title":"A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions","created":"2023-11-17","cited_by_count":3,"area":null},{"id":"2406.07373","title":"Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization","created":"2024-06-11","cited_by_count":3,"area":null},{"id":"2404.10881","title":"Differentially Private Optimization with Sparse Gradients","created":"2024-04-16","cited_by_count":2,"area":null},{"id":"2602.24007","title":"Inference-time optimization for experiment-grounded protein ensemble generation","created":"2026-02-27","cited_by_count":2,"area":null},{"id":"2406.18623","title":"Unbiased least squares regression via averaged stochastic gradient descent","created":"2024-06-26","cited_by_count":1,"area":null},{"id":"2211.07774","title":"Interpreting Bias in the Neural Networks: A Peek Into Representational Similarity","created":"2022-11-14","cited_by_count":0,"area":null},{"id":"2607.04062","title":"Fast, Parallel, Query-Efficient Binary Classification","created":"2026-07-05","cited_by_count":0,"area":null}],"next_cursor":null}