{"total":19,"rows":[{"id":"2109.11926","title":"Sinkhorn Distributionally Robust Optimization","created":"2021-09-24","cited_by_count":38,"area":null},{"id":"2106.09082","title":"Zeroth-Order Methods for Convex-Concave Minmax Problems: Applications to Decision-Dependent Risk Minimization","created":"2021-06-16","cited_by_count":18,"area":null},{"id":"2302.14043","title":"Single-Call Stochastic Extragradient Methods for Structured Non-monotone Variational Inequalities: Improved Analysis under Weaker Conditions","created":"2023-02-27","cited_by_count":14,"area":null},{"id":"2308.05414","title":"Unifying Distributionally Robust Optimization via Optimal Transport Theory","created":"2023-08-10","cited_by_count":13,"area":null},{"id":"2302.12909","title":"Differentially Private Algorithms for the Stochastic Saddle Point Problem with Optimal Rates for the Strong Gap","created":"2023-02-24","cited_by_count":12,"area":null},{"id":"2111.01842","title":"Coordinate Linear Variance Reduction for Generalized Linear Programming","created":"2021-11-02","cited_by_count":10,"area":null},{"id":"2206.02953","title":"Sampling without Replacement Leads to Faster Rates in Finite-Sum Minimax Optimization","created":"2022-06-07","cited_by_count":10,"area":null},{"id":"2210.05995","title":"SGDA with shuffling: faster convergence for nonconvex-P{\\L} minimax optimization","created":"2022-10-12","cited_by_count":8,"area":null},{"id":"2310.14085","title":"Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback","created":"2023-10-21","cited_by_count":6,"area":null},{"id":"2203.09607","title":"Learning Distributionally Robust Models at Scale via Composite Optimization","created":"2022-03-17","cited_by_count":5,"area":null},{"id":"2306.05100","title":"Communication-Efficient Gradient Descent-Accent Methods for Distributed Variational Inequalities: Unified Analysis and Local Updates","created":"2023-06-08","cited_by_count":4,"area":null},{"id":"2203.12136","title":"Wasserstein Distributionally Robust Optimization with Wasserstein Barycenters","created":"2022-03-23","cited_by_count":3,"area":null},{"id":"2406.02413","title":"Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems","created":"2024-06-04","cited_by_count":3,"area":null},{"id":"2603.15576","title":"Unbiased and Biased Variance-Reduced Forward-Reflected-Backward Splitting Methods for Stochastic Composite Inclusions","created":"2026-03-16","cited_by_count":3,"area":null},{"id":"2402.06033","title":"An Inexact Halpern Iteration with Application to Distributionally Robust Optimization","created":"2024-02-08","cited_by_count":2,"area":null},{"id":"2411.05198","title":"Private Algorithms for Stochastic Saddle Points and Variational Inequalities: Beyond Euclidean Geometry","created":"2024-11-07","cited_by_count":2,"area":null},{"id":"2505.22829","title":"Bridging Distribution Shift and AI Safety: Conceptual and Methodological Synergies","created":"2025-05-28","cited_by_count":2,"area":null},{"id":"2510.25956","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","created":"2025-10-29","cited_by_count":2,"area":null},{"id":"2106.13067","title":"Stochastic Projective Splitting: Solving Saddle-Point Problems with Multiple Regularizers","created":"2021-06-24","cited_by_count":1,"area":null}],"next_cursor":null}