Fetching the paper…
Reading the bibliography…
We propose a novel method for comparing non-aligned graphs of different sizes, based on the Wasserstein distance between graph signal distributions induced by the respective graph Laplacian matrices.
A relationship between arbitrary positive matrices and doubly stochastic matrices
Sinkhorn, R · 1964
Earlier work this paper cites.
Covariance selection
Dempster, A. P · 1972
Earlier work this paper cites.
An algorithm for restricted least squares regression
Dykstra, R. L · 1983
Earlier work this paper cites.
A graduated assignment algorithm for graph matching
Gold, S. and Rangarajan, A · 1996
Earlier work this paper cites.
Dykstras algorithm with bregman projections: A convergence proof
Bauschke, H. H. and Lewis, A. S · 2000
Earlier work this paper cites.
Semi-supervised learning using gaussian fields and harmonic functions
Zhu, X., Ghahramani, Z., and Lafferty, J. D · 2003
Earlier work this paper cites.
An eigenspace projection clustering method for inexact graph matching
Caelli, T. and Kosinov, S · 2004
Earlier work this paper cites.
Gaussian Markov random fields: theory and applications
Rue, H. and Held, L · 2005
Earlier work this paper cites.
Probabilistic subgraph matching based on convex relaxation
Schellewald, C. and Schnörr, C · 2005
Earlier work this paper cites.
Fast suboptimal algorithms for the computation of graph edit distance
Neuhaus, M., Riesen, K., and Bunke, H · 2006
Earlier work this paper cites.
Balanced graph matching
Srinivasan, P., Cour, T., and Shi, J · 2007
Earlier work this paper cites.
Sparse inverse covariance estimation with the graphical lasso
Friedman, J., Hastie, T., and Tibshirani, R · 2008
Earlier work this paper cites.
An integer projected fixed point method for graph matching and map inference
Leordeanu, M., Hebert, M., and Sukthankar, R · 2009
Earlier work this paper cites.
Reweighted random walks for graph matching
Cho, M., Lee, J., and Lee, K. M · 2010
Earlier work this paper cites.
Many-to-many graph matching: a continuous relaxation approach
Zaslavskiy, M., Bach, F., and Vert, J.-P · 2010
Earlier work this paper cites.
Gromov–wasserstein distances and the metric approach to object matching
Mémoli, F · 2011
Earlier work this paper cites.
Wasserstein geometry of gaussian measures
Takatsu, A. et al · 2011
Cited alongside, same era.
Sinkhorn distances: Lightspeed computation of optimal transport
Cuturi, M · 2013
Cited alongside, same era.
Optimal transport with Laplacian regularization
Flamary, R., Courty, N., Rakotomamonjy, A., and Tuia, D · 2014
Cited alongside, same era.
Auto-encoding variational bayes
Kingma, D. P. and Welling, M · 2014
Cited alongside, same era.
On convex relaxation of graph isomorphism
Aflalo, Y., Bronstein, A., and Kimmel, R · 2015
Cited alongside, same era.
Iterative bregman projections for regularized transportation problems
Benamou, J.-D., Carlier, G., Cuturi, M., Nenna, L., and Peyré, G · 2015
Cited alongside, same era.
Graph matching via multiplicative update algorithm
Jiang, B., Tang, J., Ding, C., Gong, Y., and Luo, B · 2017
Later among the works it cites.
Variational adaptive-newton method for explorative learning
Khan, M. E., Lin, W., Tangkaratt, V., Liu, Z., and Nielsen, D · 2017
Later among the works it cites.
Improved bilinear pooling with CNNs
Lin, T.-Y. and Maji, S · 2017
Later among the works it cites.
Matching node embeddings for graph similarity
Nikolentzos, G., Meladianos, P., and Vazirgiannis, M · 2017
Later among the works it cites.
Learning graphs from data: A signal representation perspective
Dong, X., Thanou, D., Rabbat, M., and Frossard, P · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On spectral properties for graph matching and graph isomorphism problems
Fiori, M. and Sapiro, G · 2015
Cited alongside, same era.
Spectral distances on graphs
Gu, J., Hua, B., and Liu, S · 2015
Cited alongside, same era.
Robust principal component analysis on graphs
Shahid, N., Kalofolias, V., Bresson, X., Bronstein, M., and Vandergheynst, P · 2015
Cited alongside, same era.
Deep graph kernels
Yanardag, P. and Vishwanathan, S · 2015
Cited alongside, same era.
Learning laplacian matrix in smooth graph signal representations
Dong, X., Thanou, D., Frossard, P., and Vandergheynst, P · 2016
Cited alongside, same era.
On valid optimal assignment kernels and applications to graph classification
Kriege, N. M., Giscard, P.-L., and Wilson, R · 2016
Cited alongside, same era.
Emami, P. and Ranka, S · 2018
Later among the works it cites.
Implicit reparameterization gradients
Figurnov, M., Mohamed, S., and Mnih, A · 2018
Later among the works it cites.
Learning generative models with sinkhorn divergences
Genevay, A., Peyré, G., and Cuturi, M · 2018
Later among the works it cites.
Differential properties of sinkhorn approximation for learning with wasserstein distance
Luise, G., Rudi, A., Pontil, M., and Ciliberto, C · 2018
Later among the works it cites.
Learning latent permutations with gumbel-sinkhorn networks
Mena, G., Belanger, D., Linderman, S., and Snoek, J · 2018
Later among the works it cites.
On the convergence of adam and beyond
Reddi, S. J., Kale, S., and Kumar, S · 2018
Later among the works it cites.
Netlsd: hearing the shape of a graph
Tsitsulin, A., Mottin, D., Karras, P., Bronstein, A., and Müller, E · 2018
Later among the works it cites.
Optimal transport for structured data
Vayer, T., Chapel, L., Flamary, R., Tavenard, R., and Courty, N · 2018
Later among the works it cites.
Generalizing graph matching beyond quadratic assignment model
Yu, T., Yan, J., Wang, Y., Liu, W., and Li, B · 2018
Later among the works it cites.
Got: An optimal transport framework for graph comparison
Petric Maretic, H., El Gheche, M., Chierchia, G., and Frossard, P · 2019
Later among the works it cites.
Scalable gromov-wasserstein learning for graph partitioning and matching
Xu, H., Luo, D., and Carin, L · 2019
Later among the works it cites.