Search Results for author:
Found 1 papers, 0 papers with code
Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles
Designing efficient algorithms for bilevel optimization is challenging because the lower-level problem defines a feasibility set implicitly via another optimization problem.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
