Y. Aflalo, A. Bronstein, and R. Kimmel, On convex relaxation of graph isomorphism, Proceedings of the National Academy of Sciences, vol.112, issue.10, pp.2942-2947, 2015.
DOI : 10.1073/pnas.1401651112

M. Agueh and G. Carlier, Barycenters in the Wasserstein Space, SIAM Journal on Mathematical Analysis, vol.43, issue.2, pp.904-924, 2011.
DOI : 10.1137/100805741
URL : https://hal.archives-ouvertes.fr/hal-00637399

D. Arthur and S. Vassilvitskii, K-means++: The advantages of careful seeding, Proc. SODA, pp.1027-1035, 2007.

J. Benamou, . Carlier, . Guillaume, . Cuturi, . Marco et al., Iterative Bregman Projections for Regularized Transportation Problems, SIAM Journal on Scientific Computing, vol.37, issue.2, pp.1111-1138, 2015.
DOI : 10.1137/141000439
URL : https://hal.archives-ouvertes.fr/hal-01096124

. Bot¸, R. Bot¸, . Ioan, E. Csetnek, . Robert et al., An inertial forward?backward algorithm for the minimization of the sum of two nonconvex functions, EURO J. Comp. Optim, pp.1-23, 2015.

N. Courty, . Flamary, . Rémi, and D. Tuia, Domain Adaptation with Regularized Optimal Transport, Machine Learning and Knowledge Discovery in Databases, pp.274-289
DOI : 10.1007/978-3-662-44848-9_18
URL : https://hal.archives-ouvertes.fr/hal-01018698

M. Cuturi, Sinkhorn distances: Lightspeed computation of optimal transportation, Proc. NIPS, pp.2292-2300

M. Cuturi and A. Doucet, Fast computation of Wasserstein barycenters, Proc. ICML, 2014.

I. L. Dryden, A. Koloydenko, and D. Zhou, Non- Euclidean statistics for covariance matrices, with applications to diffusion tensor imaging. The Annals of Applied Statistics, pp.1102-1123, 2009.

A. Elad and R. Kimmel, On bending invariant signatures for surfaces, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.25, issue.10, pp.1285-1295, 2003.
DOI : 10.1109/TPAMI.2003.1233902

C. Frogner, . Zhang, . Chiyuan, . Mobahi, . Hossein et al., Learning with a Wasserstein loss, Advances in Neural Information Processing Systems, pp.2044-2052

S. Gold and A. Rangarajan, A graduated assignment algorithm for graph matching, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.18, issue.4, pp.377-388, 1996.
DOI : 10.1109/34.491619

M. Gromov, Metric Structures for Riemannian and Non- Riemannian Spaces, Progress in Math. Birkhäuser, 2001.

K. Hansen, . Montavon, . Grégoire, . Biegler, . Franziska et al., Assessment and Validation of Machine Learning Methods for Predicting Molecular Atomization Energies, Journal of Chemical Theory and Computation, vol.9, issue.8, pp.93404-3419, 2013.
DOI : 10.1021/ct400195d

R. Hendrikson, Using Gromov-Wasserstein distance to explore sets of networks, 2016.

Y. Lecun, . Bottou, . Léon, . Bengio, . Yoshua et al., Gradient-based learning applied to document recognition, Proceedings of the IEEE, pp.2278-2324, 1998.
DOI : 10.1109/5.726791

E. Loiola, . Maria, . De-abreu, . Nair-maria-maia, P. Boaventura-netto et al., A survey for the quadratic assignment problem, European Journal of Operational Research, vol.176, issue.2, pp.657-690, 2007.
DOI : 10.1016/j.ejor.2005.09.032

C. D. Manning, . Raghavan, . Prabhakar, and H. Schütze, Introduction to Information Retrieval, 2008.
DOI : 10.1017/CBO9780511809071

F. Mémoli, On the use of Gromov?Hausdorff distances for shape comparison, Symposium on Point Based Graphics, pp.81-90, 2007.

F. Mémoli, Gromov???Wasserstein Distances and the Metric Approach to Object Matching, Foundations of Computational Mathematics, vol.13, issue.2, pp.417-487, 2011.
DOI : 10.1007/s10208-011-9093-5

A. Rangarajan, A. Yuille, and E. Mjolsness, Convergence Properties of the Softassign Quadratic Assignment Algorithm, Neural Computation, vol.2, issue.4, pp.1455-1474, 1999.
DOI : 10.1162/neco.1994.6.3.341

A. Rolet, . Cuturi, . Marco, and G. Peyré, Fast dictionary learning with a smoothed Wasserstein loss, Proc. AIS- TATS'16, 2016.

M. Rupp, . Tkatchenko, . Alexandre, . Müller, V. Klaus-robert et al., Fast and accurate modeling of molecular atomization energies with machine learning. Physical review letters, p.58301, 2012.

V. Seguy and M. Cuturi, Principal geodesic analysis for probability measures under the optimal transport metric, Advances in Neural Information Processing Systems, pp.3294-3302, 2015.

J. Solomon, . Rustamov, . Raif, L. Guibas, and A. Butscher, Earth mover's distances on discrete surfaces, ACM Transactions on Graphics, vol.33, issue.4, pp.1-6712, 2014.
DOI : 10.1145/2601097.2601175

J. Solomon, . Peyré, . Gabriel, . Kim, . Vladimir et al., Entropic metric alignment for correspondence problems, ACM Transactions on Graphics, vol.35, issue.4, p.2016
DOI : 10.1145/2897824.2925903
URL : https://hal.archives-ouvertes.fr/hal-01305808

S. Sra, Positive definite matrices and the S-divergence. arXiv preprint, 2011.

K. Sturm, The space of spaces: curvature bounds and gradient flows on the space of metric measure spaces, 2012.

. Thakoor, . Ninad, . Gao, . Jean, and S. Jung, Hidden Markov Model-Based Weighted Likelihood Discriminant for 2-D Shape Classification, IEEE Transactions on Image Processing, vol.16, issue.11, pp.2707-2719, 2007.
DOI : 10.1109/TIP.2007.908076

C. Villani, Topics in Optimal Transportation, Graduate studies in Math. AMS, vol.58, 2003.
DOI : 10.1090/gsm/058