On PI Controllers for Updating Lagrange Multipliers in Constrained Optimization
Motahareh Sohrabi, Juan Ramirez, Tianyue H. Zhang, Simon Lacoste-Julien, Jose Gallego-Posada
Abstract
Constrained optimization offers a powerful framework to prescribe desired behaviors in neural network models. Typically, constrained problems are solved via their min-max Lagrangian formulations, which exhibit unstable oscillatory dynamics when optimized using gradient descent-ascent. The adoption of constrained optimization techniques in the machine learning community is currently limited by the lack of reliable, general-purpose update schemes for the Lagrange multipliers. This paper proposes the PI algorithm and contributes an optimization perspective on Lagrange multiplier updates based on PI controllers, extending the work of Stooke, Achiam and Abbeel (2020). We provide theoretical and empirical insights explaining the inability of momentum methods to address the shortcomings of gradient descent-ascent, and contrast this with the empirical success of our proposed PI controller. Moreover, we prove that PI generalizes popular momentum methods for single-objective minimization. Our experiments demonstrate that PI reliably stabilizes the multiplier dynamics and its hyperparameters enjoy robust and predictable behavior.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers5
- Composition and Alignment of Diffusion Models using Constrained LearningShervin Khalafi, Ignacio Hounie, Dongsheng Ding, Alejandro RibeiroNeurIPS 2025 · 10 citations
- Dual Optimistic Ascent (PI Control) is the Augmented Lagrangian Method in DisguiseJuan Ramirez, Simon Lacoste-JulienICLR 2026 · 5 citations
- Accelerated and Stable Convergence with Anchored Generalized Optimistic MethodMotahareh Sohrabi, Jianxin You, Simon Lacoste-Julien, Eduard Gorbunov et al.ICML 2026
- Embedding Safety into RL: A New Take on Trust Region MethodsNikola Milosevic, Johannes Müller, Nico ScherfICML 2025
- IEC: When Information-Driven Exploration Meets Spectral Consensus via Primal–Dual Reward Regularization in Decentralized Multi-Agent RLXuefeng Du, Jiajun Wu, Yuduo Zheng, Fengqi LiICML 2026
Builds on6
- On Gradient Descent Ascent for Nonconvex-Concave Minimax ProblemsTianyi Lin, Chi Jin, Michael I. JordanICML 2020 · 587 citations
- Responsive Safety in Reinforcement Learning by PID Lagrangian MethodsAdam Stooke, Joshua Achiam, Pieter AbbeelICML 2020 · 403 citations
- Controlled Sparsity via Constrained Optimization or: How I Learned to Stop Tuning Penalties and Love ConstraintsJose Gallego-Posada, Juan Ramirez, Akram Erraqabi, Yoshua Bengio et al.NeurIPS 2022 · 32 citations
- A Lagrangian Duality Approach to Active LearningJuan Elenter, Navid NaderiAlizadeh, Alejandro RibeiroNeurIPS 2022 · 31 citations
- PID Accelerated Value Iteration AlgorithmAmir Massoud Farahmand, Mohammad GhavamzadehICML 2021 · 16 citations
Related papers
- ReLOAD: Reinforcement Learning with Optimistic Ascent-Descent for Last-Iterate Convergence in Constrained MDPsTed Moskovitz, Brendan O'Donoghue, Vivek Veeriah, Sebastian Flennerhag et al.ICML 2023 · 24 citations
- Better Training using Weight-Constrained Stochastic DynamicsBenedict J. Leimkuhler, Tiffany J. Vlaar, Timothée Pouchon, Amos J. StorkeyICML 2021 · 11 citations
- ConFIG: Towards Conflict-free Training of Physics Informed Neural NetworksQiang Liu, Mengyu Chu, Nils ThuereyICLR 2025
- Conflict-Averse Gradient Aggregation for Constrained Multi-Objective Reinforcement LearningDohyeong Kim, Mineui Hong, Jeongho Park, Songhwai OhICLR 2025
- Convergence of a Stochastic Gradient Method with Momentum for Non-Smooth Non-Convex OptimizationVien V. Mai, Mikael JohanssonICML 2020 · 10 citations
