Disciplined Bilevel Programming

arXiv:2609.00644 · math.OC, cs.CE, cs.LG, cs.MS · Submitted 2026-09-01 · Read on arXiv

math.OC, cs.CE, cs.LG, cs.MS

Submitted: 2026-09-01

Updated: 2026-09-22

Code: https://github.com/dxogrp/blvpy

Terminology

• Regularization — 16× in this paper · explained in 3 episodes
• alpha — 7× in this paper · explained in 1 episode
• Consistency — 4× in this paper · explained in 3 episodes
• Accuracy — 2× in this paper · explained in 1 episode
• Objective Function — 2× in this paper · explained in 2 episodes
• Robustness — 2× in this paper · explained in 5 episodes
• Verification — 2× in this paper · explained in 2 episodes
• Adam — 1× in this paper · explained in 2 episodes
• Meta-learning — 1× in this paper · explained in 2 episodes
• Model Predictive Control (MPC) — 1× in this paper · explained in 5 episodes

Sources

• Disciplined Nonlinear Programming
• Clarabel: An interior-point solver for conic programs with quadratic objectives
• On Differentiating Parameterized Argmin and Argmax Problems with Application to Bi-level Optimization
• CVXPY 1.9: Recent Advances in Optimization Modeling Software

Related papers

• Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
• Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
• Incremental Learning in Mirror Flows
• Online Control via Counterfactual Tracking
• Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability
• Petrov-Galerkin operator inference with application to stability-encouraging identification