A rank-based approximation of upper-level value function rankings accelerates black-box bilevel optimization by reducing inner-loop computations while maintaining performance on multimodal problems.
InProceedings of the IEEE/CVF International Conference on Computer Vision
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.NE 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Accelerating Black-Box Bilevel Optimization with Rank-Based Upper-Level Value Function Approximation
A rank-based approximation of upper-level value function rankings accelerates black-box bilevel optimization by reducing inner-loop computations while maintaining performance on multimodal problems.