Co-occurring keywords · papers mentioning both
Papers
Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization
NeurIPS 2024
Stochastic Extragradient with Flip-Flop Shuffling & Anchoring: Provable Improvements
NeurIPS 2024
Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements
AISTATS 2024
Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
AISTATS 2024
Submodular Minimax Optimization: Finding Effective Sets
AISTATS 2024
Symmetric Mean-field Langevin Dynamics for Distributional Minimax Problems
ICLR 2024
Two-timescale Extragradient for Finding Local Minimax Points
ICLR 2024
Wasserstein Distributionally Robust Optimization through the Lens of Structural Causal Models and Individual Fairness
NeurIPS 2024
AdaGDA: Faster Adaptive Gradient Descent Ascent Methods for Minimax Optimization
AISTATS 2023
A Single-Loop Accelerated Extra-Gradient Difference Algorithm with Improved Complexity Bounds for Constrained Minimax Optimization
NeurIPS 2023
Balance, Imbalance, and Rebalance: Understanding Robust Overfitting from a Minimax Game Perspective
NeurIPS 2023
Breaking Correlation Shift via Conditional Invariant Regularizer
ICLR 2023
Causal Balancing for Domain Generalization
ICLR 2023
Certified Minimax Unlearning with Generalization Rates and Deletion Capacity
NeurIPS 2023
Communication-Efficient Stochastic Gradient Descent Ascent with Momentum Algorithms
IJCAI 2023
Continuous-time Analysis of Anchor Acceleration
NeurIPS 2023
Decentralized Riemannian Algorithm for Nonconvex Minimax Problems
AAAI 2023
Differentially Private Algorithms for the Stochastic Saddle Point Problem with Optimal Rates for the Strong Gap
COLT 2023
Low-rank matrix recovery with unknown correspondence
UAI 2023
Minimax-Bayes Reinforcement Learning
AISTATS 2023
Multi-armed Bandit Experimental Design: Online Decision-making and Adaptive Inference
AISTATS 2023
Nesterov Meets Optimism: Rate-Optimal Separable Minimax Optimization
ICML 2023
Offline Minimax Soft-Q-learning Under Realizability and Partial Coverage
NeurIPS 2023
Open Problem: Is There a First-Order Method that Only Converges to Local Minimax Optima?
COLT 2023
Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
NeurIPS 2023