On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization

An official website of the United States government Here's how you know

Official websites use .gov

A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS

A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

This content will become publicly available on December 1, 2026

On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization

Author(s) / Creator(s):: Cao, Jincheng; Jiang, Ruichen; YazdandoostHamedani, Erfan; Mokhtari, Aryan

Publisher / Repository:: NeurIPS (Conference on Neural Information Processing Systems)