Co-occurring keywords · papers mentioning both
Papers
Efficiently Escaping Saddle Points in Bilevel Optimization
JMLR 2025
Stochastic Compositional Minimax Optimization with Provable Convergence Guarantees
AISTATS 2025
Design a Win-Win Strategy That Is Fair to Both Service Providers and Tasks When Rejection Is Not an Option
IJCAI 2024
One-Shot Strategic Classification Under Unknown Costs
ICML 2024
Towards Sharper Risk Bounds for Minimax Problems
IJCAI 2024
A Fast Optimistic Method for Monotone Variational Inequalities
ICML 2023
CDMA: A Practical Cross-Device Federated Learning Algorithm for General Minimax Problems
AAAI 2023
Zeroth-Order Alternating Gradient Descent Ascent Algorithms for A Class of Nonconvex-Nonconcave Minimax Problems
JMLR 2023
Clipped Stochastic Methods for Variational Inequalities with Heavy-Tailed Noise
NeurIPS 2022
Differentially private SGDA for minimax problems
UAI 2022
Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems
ICLR 2022
High Probability Generalization Bounds with Fast Rates for Minimax Problems
ICLR 2022
Stability and Generalization for Markov Chain Stochastic Gradient Methods
NeurIPS 2022
Differentiating the Value Function by using Convex Duality
AISTATS 2021
Stability and Generalization of Stochastic Gradient Methods for Minimax Problems
ICML 2021
Adversarial Machine Learning with Double Oracle
IJCAI 2019
Stochastic Gradient Methods for Distributionally Robust Optimization with f-divergences
NeurIPS 2016
Learning Non-Linear Combinations of Kernels
NeurIPS 2009