{"total":23,"rows":[{"id":"2310.03234","title":"Non-Smooth Weakly-Convex Finite-sum Coupled Compositional Optimization","created":"2023-10-05","cited_by_count":10,"area":null},{"id":"2310.03613","title":"Solving a Class of Non-Convex Minimax Optimization in Federated Learning","created":"2023-10-05","cited_by_count":10,"area":null},{"id":"2210.17478","title":"TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization","created":"2022-10-31","cited_by_count":8,"area":null},{"id":"2302.04249","title":"Federated Minimax Optimization with Client Heterogeneity","created":"2023-02-08","cited_by_count":8,"area":null},{"id":"2212.02387","title":"An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization","created":"2022-12-05","cited_by_count":6,"area":null},{"id":"2304.02441","title":"Decentralized gradient descent maximization method for composite nonconvex strongly-concave minimax problems","created":"2023-04-05","cited_by_count":6,"area":null},{"id":"2307.13381","title":"Scaff-PD: Communication Efficient Fair and Robust Federated Learning","created":"2023-07-25","cited_by_count":6,"area":null},{"id":"2410.09568","title":"Second-Order Min-Max Optimization with Lazy Hessians","created":"2024-10-12","cited_by_count":5,"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":"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":"2311.00944","title":"Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization","created":"2023-11-02","cited_by_count":4,"area":null},{"id":"2312.03259","title":"f-FERM: A Scalable Framework for Robust Fair Empirical Risk Minimization","created":"2023-12-06","cited_by_count":4,"area":null},{"id":"2405.18577","title":"Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions","created":"2024-05-28","cited_by_count":4,"area":null},{"id":"2509.19455","title":"Anchored Langevin Algorithms","created":"2025-09-23","cited_by_count":3,"area":null},{"id":"2511.22331","title":"On the Condition Number Dependency in Bilevel Optimization","created":"2025-11-27","cited_by_count":3,"area":null},{"id":"2307.07113","title":"Variance-reduced accelerated methods for decentralized stochastic double-regularized nonconvex strongly-concave minimax problems","created":"2023-07-14","cited_by_count":2,"area":null},{"id":"2310.15448","title":"An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems","created":"2023-10-24","cited_by_count":1,"area":null},{"id":"2509.13628","title":"Accelerated Gradient Methods with Biased Gradient Estimates: Risk Sensitivity, High-Probability Guarantees, and Large Deviation Bounds","created":"2025-09-17","cited_by_count":1,"area":null},{"id":"2605.08006","title":"Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems","created":"2026-05-08","cited_by_count":1,"area":null},{"id":"2609.21747","title":"Single-Loop Stochastic Projected Damped Extragradient Methods for Nonconvex--(Strongly) Concave Minimax Optimization","created":"2026-09-18","cited_by_count":1,"area":null},{"id":"2609.30877","title":"Tight Stochastic Condition-Number Dependence in Nonconvex-Strongly-Concave Minimax Optimization","created":"2026-09-25","cited_by_count":1,"area":null},{"id":"2512.01213","title":"Closing the Approximation Gap of Partial AUC Optimization: A Tale of Two Formulations","created":"2025-12-01","cited_by_count":0,"area":null},{"id":"2609.35541","title":"Learning the Robustness Mechanism with Bilevel Optimization","created":"2026-09-28","cited_by_count":0,"area":null}],"next_cursor":null}