2024
Near-Optimal Convex Simple Bilevel Optimization with a Bisection Method
AISTATS 2024poster
This paper studies a class of simple bilevel optimization problems where we minimize a composite convex function at the upper-level subject to a composite convex lower-level problem. Existing methods either provide asymptotic guarantees for the upper-level objective or attain slow sublinear converge…