AINeutralarXiv – CS AI · 7h ago6/10
🧠
On the Condition Number Dependency in Bilevel Optimization
Researchers establish new lower bounds on the computational complexity of bilevel optimization problems, proving that the condition number dependency requires at least Ω(κ_y^(5/2)) oracle calls rather than the previously assumed Ω(κ_y^4), revealing a fundamental gap between bilevel and minimax optimization.