Most commented posts

  1. Mokameeting, mini-course, Didier Henrion, Oct. 18th — 1 comment

Author's posts

Mokameeting, June 26th, 10:30, Sebastian Claici

Mokameeting, June 26th 10:30, Room A415 Sebastian Claici (MIT) Title: Transportation Techniques for Constrained Learning Problems Abstract: Optimal transport (OT) is a method of measuring distances between probability distributions that has found numerous applications in machine learning, computer graphics, image processing, and others. However, research has focused largely on computing transport distances quickly in great generality, …

Continue reading

MOKAMEETING September 19th 2018, 10h-12h, Room A415

Room A415, 10:00 – 12:00 Joseph Budin, Wasserstein Barycenters for Persistence Diagrams Jean Alaux, Optimal Transport Geometry and Text Analysis Thibault Séjourné, Sinkhorn Entropies and Divergences

MOKAMEETING 22 Aout 2018

Lucas Martinet (INRIA) – Sinkhorn and parallelism Vincent Duval (INRIA) – tightness of Lasserre relaxations on the multi-dimensional torus.

Mokameeting, Soledad Villar (New York University), Wed. April 4th 2018, 10:00-11:00, room A215

Soledad Villar (New York University) Wed. April 4th 2018, INRIA Paris, 10:00-11:00, room A215 Title:  Quadratic assignment, semidefinite programming, and graph neural networks. Abstract: Quadratic assignment is a very general problem in theoretical computer science. It includes graph matching, the traveling salesman problem, and the Gromov-Hausdorff distance between finite metric spaces as particular cases. Quadratic assignment …

Continue reading

Mokameeting, Giovanni Conforti (École Polytechnique), Jan. 10th 2018, 11:00-12:00, room A415

Giovanni Conforti (École Polytechnique): Title: The dynamics of Schrodinger bridges Schroedinger bridges (SB) allow to lift from the point to the mesure setting the concept of Brownian bridge. On the other hand, they arise naturally as the critical curve for the dynamic formulation of the regularized Monge-Kantorovich problem. In this talk I will present some …

Continue reading

Mokameeting – Lasserre Hierarchy for Optimal Transport – Wed. Oct. 4th, Room A315

Mokameeting – Lasserre Hierarchy for Optimal Transport Didier Henrion, CNRS and LAAS (Toulouse) Wed. Oct. 4th, Room A315 10:30-12:00 and 14:00-15:30 Abstract: We will discuss known result and open problems about SDP methods for Optimal Transport.

Mokameeting, Raja Giryes (Tel Aviv University), Oct. 11th, 11:00-12:00, room A415

Mokameeting, Oct. 11th, 11:00-12:00, room A415 (4th floor, INRIA Paris building #2, in front of the welcome desk — ask for Mokaplan’s team) Raja Giryes, Tel Aviv University Title: On the relationship between the structure in the data and what deep learning can learn Abstract: The past five years have seen a dramatic increase in the performance of recognition systems …

Continue reading

Mokameeting, mini-course, Didier Henrion, Oct. 18th

Special Mokameeting – Mini-course Didier Henrion, CNRS and LAAS (Toulouse) Wed. Oct. 18th, Room A315 Part 1: 10:30-12:00 Part 2: 14:00-15:30 Title: An introduction to the Lasserre hierarchy in polynomial optimization Abstract: We survey a mathematical technology introduced in 2000 by Jean Bernard Lasserre to solve globally non-convex optimization problems on multivariate polynomials with the help of a …

Continue reading

Mokameeting, Summer Session, August 23rd

Mokameeting, Open Moka-Problems Session, August 23rd 2017, 11:00-12:00, room A415 This summer session is a followup open problems session. Everyone will have the unique opportunity to present his latest results and/or his open questions (preferably in a compressed format).

Mokameeting, Open Moka-Problems Session, Tuesday July 11h

Mokameeting, Open Moka-Problems Session, Tuesday July 11h, 11:00-12:00, room A415 Everyone will have the unique opportunity to present his latest results and/or his open questions (preferably in a compressed format).