Skip to content
conftrace_

min-max optimization

115 papers

MMO

Papers

Balancing Sample Efficiency and Suboptimality in Inverse Reinforcement Learning ICML 2022 Convergence Rates of Two-Time-Scale Gradient Descent-Ascent Dynamics for Solving Nonconvex Min-Max Problems L4DC 2022 Detecting Incorrect Visual Demonstrations for Improved Policy Learning CoRL 2022 Fairness Reprogramming NeurIPS 2022 Fast Distributionally Robust Learning with Variance-Reduced Min-Max Optimization AISTATS 2022 First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces NeurIPS 2022 Generative Modeling with Optimal Transport Maps ICLR 2022 Gradient and Projection Free Distributed Online Min-Max Resource Optimization L4DC 2022 Multi-block Min-max Bilevel Optimization with Applications in Multi-task Deep AUC Maximization NeurIPS 2022 Novel Min-Max Reformulations of Linear Inverse Problems JMLR 2022 One-shot Neural Backdoor Erasing via Adversarial Weight Masking NeurIPS 2022 On the Initialization for Convex-Concave Min-max Problems ALT 2022 Revisiting and Advancing Fast Adversarial Training Through The Lens of Bi-Level Optimization ICML 2022 Robust Graph-Based Multi-View Clustering AAAI 2022 SAGDA: Achieving O(ε^-2) Communication Complexity in Federated Min-Max Learning NeurIPS 2022 Stochastic Extragradient: General Analysis and Improved Rates AISTATS 2022 Stochastic Variance Reduction for Variational Inequality Methods COLT 2022 Training Robust Deep Models for Time-Series Domain: Novel Algorithms and Theoretical Analysis AAAI 2022 Zeroth-Order Methods for Convex-Concave Min-max Problems: Applications to Decision-Dependent Risk Minimization AISTATS 2022 Adaptive Extra-Gradient Methods for Min-Max Optimization and Games ICLR 2021 Adversarial Attack Generation Empowered by Min-Max Optimization NeurIPS 2021 Attribute-Guided Adversarial Training for Robustness to Natural Perturbations AAAI 2021 Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization NeurIPS 2021 Convex-Concave Min-Max Stackelberg Games NeurIPS 2021 Direct-Search for a Class of Stochastic Min-Max Problems AISTATS 2021