A Hölderian backtracking method for min-max and min-min problems - Argumentation, Décision, Raisonnement, Incertitude et Apprentissage Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2020

A Hölderian backtracking method for min-max and min-min problems

Résumé

We present a new algorithm to solve min-max or min-min problems out of the convex world. We use rigidity assumptions, ubiquitous in learning, making our method applicable to many optimization problems. Our approach takes advantage of hidden regularity properties and allows us to devise a simple algorithm of ridge type. An original feature of our method is to come with automatic step size adaptation which departs from the usual overly cautious backtracking methods. In a general framework, we provide convergence theoretical guarantees and rates. We apply our findings on simple GAN problems obtaining promising numerical results.
Fichier principal
Vignette du fichier
ridgeMethod.pdf (499.54 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02900875 , version 1 (16-07-2020)

Identifiants

  • HAL Id : hal-02900875 , version 1

Citer

Jérôme Bolte, Lilian Glaudin, Edouard Pauwels, Mathieu Serrurier. A Hölderian backtracking method for min-max and min-min problems. 2020. ⟨hal-02900875⟩
151 Consultations
174 Téléchargements

Partager

Gmail Facebook X LinkedIn More