convex-concave optimization

On Corruption-Robustness in Performative Reinforcement Learning AAAI 2025 Efficient Stochastic Approximation of Minimax Excess Risk Optimization ICML 2024 Mirror Descent Algorithms with Nearly Dimension-Independent Rates for Differentially-Private Stochastic Saddle-Point Problems extended abstract COLT 2024 Sharper Rates for Separable Minimax and Finite Sum Optimization via Primal-Dual Extragradient Methods COLT 2022 Zeroth-Order Methods for Convex-Concave Min-max Problems: Applications to Decision-Dependent Risk Minimization AISTATS 2022 Convex-Concave Min-Max Stackelberg Games NeurIPS 2021 Stability and Generalization of Stochastic Gradient Methods for Minimax Problems ICML 2021 GradientDICE: Rethinking Generalized Offline Estimation of Stationary Values ICML 2020 Improved Algorithms for Convex-Concave Minimax Optimization NeurIPS 2020 Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems COLT 2020 Lower Complexity Bounds for Finite-Sum Convex-Concave Minimax Optimization Problems ICML 2020 Partial Label Learning with Self-Guided Retraining AAAI 2019 Stochastic Variance Reduction Methods for Saddle-Point Problems NeurIPS 2016 An Extended Level Method for Efficient Multiple Kernel Learning NeurIPS 2008