Skip to main navigation Skip to search Skip to main content

A gradient sampling algorithm for stratified maps with applications to topological data analysis

  • Jacob Leygonie
  • , Mathieu Carrière
  • , Théo Lacombe
  • , Steve Oudot
  • University of Oxford
  • Université Côte D’Azur
  • Université Gustave Eiffel

Research output: Contribution to journalArticlepeer-review

Abstract

We introduce a novel gradient descent algorithm refining the well-known Gradient Sampling algorithm on the class of stratifiably smooth objective functions, which are defined as locally Lipschitz functions that are smooth on some regular pieces—called the strata—of the ambient Euclidean space. On this class of functions, our algorithm achieves a sub-linear convergence rate. We then apply our method to objective functions based on the (extended) persistent homology map computed over lower-star filters, which is a central tool of Topological Data Analysis. For this, we propose an efficient exploration of the corresponding stratification by using the Cayley graph of the permutation group. Finally, we provide benchmarks and novel topological optimization problems that demonstrate the utility and applicability of our framework.

Original languageEnglish
Pages (from-to)199-239
Number of pages41
JournalMathematical Programming
Volume202
Issue number1-2
DOIs
Publication statusPublished - 1 Nov 2023

Keywords

  • Nonsmooth analysis
  • Optimization
  • Persistent homology

Fingerprint

Dive into the research topics of 'A gradient sampling algorithm for stratified maps with applications to topological data analysis'. Together they form a unique fingerprint.

Cite this