On the Hardness of Meaningful Local Guarantees in Nonsmooth Nonconvex Optimization

We study the oracle complexity of nonsmooth nonconvex optimization, with the algorithm assumed to have access only to local function information. It has been shown by Davis, Drusvyatskiy, and Jiang (2023) that for nonsmooth Lipschitz functions satisfying certain regularity and strictness conditions,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Kornowski, Guy, Padmanabhan, Swati, Shamir, Ohad
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Learning Mathematics - Optimization and Control
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!