{"total":22,"rows":[{"id":"2104.12761","title":"Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium","created":"2021-04-26","cited_by_count":51,"area":null},{"id":"2506.04192","title":"Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise","created":"2025-06-04","cited_by_count":41,"area":null},{"id":"2402.13903","title":"Dealing with unbounded gradients in stochastic saddle-point optimization","created":"2024-02-21","cited_by_count":16,"area":null},{"id":"2202.04640","title":"Sharper Rates for Separable Minimax and Finite Sum Optimization via Primal-Dual Extragradient Methods","created":"2022-02-09","cited_by_count":15,"area":null},{"id":"2205.11470","title":"Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning","created":"2022-05-23","cited_by_count":10,"area":null},{"id":"2302.02931","title":"Bitrate-Constrained DRO: Beyond Worst Case Robustness To Unknown Group Shifts","created":"2023-02-06","cited_by_count":9,"area":null},{"id":"2101.05248","title":"Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent","created":"2021-01-13","cited_by_count":8,"area":null},{"id":"2404.13891","title":"Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent","created":"2024-04-22","cited_by_count":7,"area":null},{"id":"2210.09371","title":"On Accelerated Perceptrons and Beyond","created":"2022-10-17","cited_by_count":6,"area":null},{"id":"2102.05134","title":"Local and Global Uniform Convexity Conditions","created":"2021-02-09","cited_by_count":4,"area":null},{"id":"2103.00284","title":"On the Initialization for Convex-Concave Min-max Problems","created":"2021-02-27","cited_by_count":4,"area":null},{"id":"2306.11121","title":"Projection-Free Online Convex Optimization via Efficient Newton Iterations","created":"2023-06-19","cited_by_count":4,"area":null},{"id":"2407.04591","title":"Proximal Point Method for Online Saddle Point Problem","created":"2024-07-05","cited_by_count":3,"area":null},{"id":"2105.13939","title":"Efficient Online-Bandit Strategies for Minimax Learning Problems","created":"2021-05-28","cited_by_count":2,"area":null},{"id":"2303.05037","title":"Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets","created":"2023-03-09","cited_by_count":2,"area":null},{"id":"2506.16736","title":"Optimism Without Regularization: Constant Regret in Zero-Sum Games","created":"2025-06-20","cited_by_count":2,"area":null},{"id":"2509.19901","title":"Pure Exploration via Frank-Wolfe Self-Play","created":"2025-09-24","cited_by_count":1,"area":null},{"id":"2511.06597","title":"Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality","created":"2025-11-10","cited_by_count":1,"area":null},{"id":"2305.15643","title":"Federated Composite Saddle Point Optimization","created":"2023-05-25","cited_by_count":0,"area":null},{"id":"2305.17544","title":"Faster Margin Maximization Rates for Generic and Adversarially Robust Optimization Methods","created":"2023-05-27","cited_by_count":0,"area":null},{"id":"2312.06957","title":"Online Saddle Point Problem and Online Convex-Concave Optimization","created":"2023-12-12","cited_by_count":0,"area":null},{"id":"2411.01720","title":"Barriers to Welfare Maximization with No-Regret Learning","created":"2024-11-04","cited_by_count":0,"area":null}],"next_cursor":null}