The computational complexity of finding second-order stationary points - Université Grenoble Alpes
Communication Dans Un Congrès Année : 2024

The computational complexity of finding second-order stationary points

Résumé

Non-convex minimization problems are universally considered hard, and even guaranteeing that a computed solution is locally minimizing is known to be NP-hard. In this general context, our paper focuses on the problem of finding stationary points that satisfy an approximate second-order optimality condition, which serves to exclude strict saddles and other non-minimizing stationary points. Our main result is that the problem of finding approximate second-order stationary points (SOSPs) is PLS-complete, i.e., of the same complexity as the problem of finding first-order stationary points (FOSPs), thus resolving an open question in the field. In particular, our results imply that, under the widely believed complexity conjecture that PLS $\neq$ FNP, finding approximate SOSPs in unconstrained domains is easier than in constrained domains, which is known to be NP-hard. This comes in stark contrast with earlier results which implied that, unless PLS = CLS, finding approximate FOSPs in unconstrained domains is harder than in constrained domains.
Fichier principal
Vignette du fichier
Main.pdf (5 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04629307 , version 1 (29-06-2024)

Licence

Identifiants

  • HAL Id : hal-04629307 , version 1

Citer

Andreas Kontogiannis, Vasilis Pollatos, Sotiris Kanellopoulos, Panayotis Mertikopoulos, Aris Pagourtzis, et al.. The computational complexity of finding second-order stationary points. ICML 2024 - 41st International Conference on Machine Learning, Jul 2024, Vienna, Austria. ⟨hal-04629307⟩
141 Consultations
150 Téléchargements

Partager

More