{"total":16,"rows":[{"id":"2201.09046","title":"Differentially Private SGDA for Minimax Problems","created":"2022-01-22","cited_by_count":23,"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":"2210.08781","title":"Stochastic Differentially Private and Fair Learning","created":"2022-10-17","cited_by_count":16,"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":"2402.11173","title":"How to Make the Gradients Small Privately: Improved Rates for Differentially Private Non-Convex Optimization","created":"2024-02-17","cited_by_count":10,"area":null},{"id":"2407.09690","title":"Private Heterogeneous Federated Learning Without a Trusted Server Revisited: Error-Optimal and Communication-Efficient Algorithms for Convex Losses","created":"2024-07-12","cited_by_count":8,"area":null},{"id":"2201.10447","title":"Differentially Private Temporal Difference Learning with Stochastic Nonconvex-Strongly-Concave Optimization","created":"2022-01-25","cited_by_count":7,"area":null},{"id":"2205.14278","title":"Generalization Bounds of Nonconvex-(Strongly)-Concave Stochastic Minimax Optimization","created":"2022-05-28","cited_by_count":7,"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":"2503.18317","title":"Improved Rates of Differentially Private Nonconvex-Strongly-Concave Minimax Optimization","created":"2025-03-24","cited_by_count":5,"area":null},{"id":"2310.17759","title":"Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization","created":"2023-10-26","cited_by_count":3,"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.22703","title":"Private Rate-Constrained Optimization with Applications to Fair Learning","created":"2025-05-28","cited_by_count":1,"area":null},{"id":"2304.04778","title":"First-order methods for Stochastic Variational Inequality problems with Function Constraints","created":"2023-04-10","cited_by_count":0,"area":null},{"id":"2503.09538","title":"Differentially Private Equilibrium Finding in Polymatrix Games","created":"2025-03-12","cited_by_count":0,"area":null},{"id":"2508.07505","title":"Enhancing Privacy in Decentralized Min-Max Optimization: A Differentially Private Approach","created":"2025-08-10","cited_by_count":0,"area":null}],"next_cursor":null}