Escaping Saddle Point Efficiently in Minimax and Bilevel Optimizations | NSF Public Access Repository

skip to main content

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.

Citation Details

Escaping Saddle Point Efficiently in Minimax and Bilevel Optimizations

Award ID(s):: 2347617

PAR ID:: 10683799

Author(s) / Creator(s):: Xian, Wenhan; Huang, Feihu; Huang, Heng

Publisher / Repository:: The 34th International Joint Conference on Artificial Intelligence (IJCAI 2025)

Date Published:: 2025-07-01

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript
Conference Proceeding:
The DOI is not currently available.