On the complexity of Iterative Bregman Projections

Dez 13, 2019

Sprecher:innen

Über

Iterative Bregman Projections algorithm (IBP) proposed by Benamou et. al. in 2015 is a generalization of the well-known Sinkhorn algorithm. It is used to solve a wide range of computational problems related to the optimal transport with the entropic regularisation. In this talk we discuss the convergence rates of IBP applied to computation of Wasserstein barycenters, and classical Monge-Kantorovich problem.

Organisator

Kategorien

Über NIPS 2019

Neural Information Processing Systems (NeurIPS) is a multi-track machine learning and computational neuroscience conference that includes invited talks, demonstrations, symposia and oral and poster presentations of refereed papers. Following the conference, there are workshops which provide a less formal setting.

Präsentation speichern

Soll diese Präsentation für 1000 Jahre gespeichert werden?

Wie speichern wir Präsentationen?

Ewigspeicher-Fortschrittswert: 1 = 0.1%

Freigeben

Empfohlene Videos

Präsentationen, deren Thema, Kategorie oder Sprecher:in ähnlich sind

Interessiert an Vorträgen wie diesem? NIPS 2019 folgen