00:00:00 / 00:00:00

Optimal transport for graphs: definitions, applications to graph-signal processing

By Nicolas Courty

Appears in collection : Machine Learning and Signal Processing on Graphs / Apprentissage automatique et traitement du signal sur graphes

In this talk I will discuss how a variant of the classical optimal transport problem, known as the Gromov-Wasserstein distance, can help in designing learning tasks over graphs, and allow to transpose classical signal processing or data analysis tools such as dictionary learning or online change detection, for learning over those types of structured objects. Both theoretical and practical aspects will be discussed.

Information about the video

Citation data

  • DOI 10.24350/CIRM.V.19981603
  • Cite this video Courty, Nicolas (10/11/2022). Optimal transport for graphs: definitions, applications to graph-signal processing. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.19981603
  • URL https://dx.doi.org/10.24350/CIRM.V.19981603

Domain(s)

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback