Accelerating Black-Box Bilevel Optimization with Rank-Based Upper-Level Value Function Approximation
Marc Ong, Youhei Akimoto

TL;DR
This paper introduces a rank-based approximation framework for black-box bilevel optimization that significantly reduces computational costs and improves performance on complex, multimodal problems.
Contribution
It proposes a novel method that directly approximates upper-level value function rankings, bypassing costly lower-level optimizations, especially effective for challenging landscapes.
Findings
Achieves competitive results on standard benchmarks.
Solves problems intractable for previous methods.
Reduces computational burden of bilevel optimization.
Abstract
Bilevel optimization is a field of significant theoretical and practical interest, yet solving such optimization problems remains challenging. Evolutionary methods have been employed to address these problems in the black-box setting; however, they incur high computational cost due to the nested nature of bilevel optimization. Although previous methods have attempted to reduce this cost through various heuristic techniques, such approaches limit versatility on challenging optimization landscapes, such as those with multimodality and significant interaction between upper- and lower-level decision variables. In this study, we propose an efficient framework that exploits the invariance of rank-based evolutionary algorithms to monotonic transformations, thereby reducing the computational burden of the lower-level optimization loop. Specifically, our method directly approximates the rankings…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
