A Primal-Dual-Assisted Penalty Approach to Bilevel Optimization with Coupled Constraints
Abstract
Interest in bilevel optimization has grown in recent years, partially due to its applications to tackle challenging machine-learning problems. Several exciting recent works have been centered around developing efficient gradient-based algorithms that can solve bilevel optimization problems with provable guarantees. However, the existing literature mainly focuses on bilevel problems either without constraints, or featuring only simple constraints that do not couple variables across the upper and lower levels, excluding a range of complex applications. Our paper studies this challenging but less explored scenario and develops a (fully) first-order algorithm, which we term BLOCC, to tackle BiLevel Optimization problems with Coupled Constraints. We establish rigorous convergence theory for the proposed algorithm and demonstrate its effectiveness on two well-known real-world applications - hyperparameter selection in support vector machine (SVM) and infrastructure planning in transportation networks using the real data from the city of Seville.
Keywords
Cite
@article{arxiv.2406.10148,
title = {A Primal-Dual-Assisted Penalty Approach to Bilevel Optimization with Coupled Constraints},
author = {Liuyuan Jiang and Quan Xiao and Victor M. Tenorio and Fernando Real-Rojas and Antonio G. Marques and Tianyi Chen},
journal= {arXiv preprint arXiv:2406.10148},
year = {2024}
}
Comments
In this version, we have made the following updates: (1) Added a sensitivity analysis of the algorithm's hyperparameters (stepsize and penalty constant) in Appendix G. (2) Included a computational complexity analysis and comparison in Appendix H. (3) Explicitly stated the inner-loop stepsizes in Remarks 2 and 3