Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems
math.OC, cs.LG, stat.ML
Submitted: 2026-05-08
Updated: 2026-11-12
Code: https://github.com/weiranwang19/minimax
Terminology
Sources
- A Fast and Convergent Proximal Algorithm for Regularized Nonconvex and Nonsmooth Bi-level Optimization
- Stochastic variance reduced extragradient methods for solving hierarchical variational inequalities
- Approximation Methods for Bilevel Programming
- Randomized Stochastic Variance-Reduced Methods for Multi-Task Stochastic Bilevel Optimization
- Adaptive Mirror Descent Bilevel Optimization
- On Momentum-Based Gradient Methods for Bilevel Optimization with Nonconvex Lower-Level
- Regularized Operator Extrapolation Method For Stochastic Bilevel Variational Inequality Problems
- Learning Reward and Policy Jointly from Demonstration and Preference Improves Alignment
- A novel approach for bilevel programs based on Wolfe duality
- An Augmented Lagrangian Value Function Method for Lower-level Constrained Stochastic Bilevel Optimization
- A Primal-Dual Approach to Bilevel Optimization with Multiple Inner Minima
- Alternating Implicit Projected SGD and Its Efficient Variants for Equality-constrained Bilevel Optimization
- Bilevel reinforcement learning via the development of hyper-gradient without lower-level convexity
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise