Online Graph Dictionary Learning
C\'edric Vincent-Cuaz, Titouan Vayer, R\'emi Flamary, Marco Corneli,, Nicolas Courty

TL;DR
This paper introduces an online graph dictionary learning method using Gromov Wasserstein divergence, enabling efficient unsupervised embedding and subspace estimation of diverse, unregistered graphs in a unified framework.
Contribution
It proposes a novel online graph dictionary learning approach that handles unregistered graphs with different sizes using Gromov Wasserstein divergence.
Findings
Effective for unsupervised graph embedding
Enables online graph subspace estimation and tracking
Provides a fast approximation of Gromov Wasserstein divergence
Abstract
Dictionary learning is a key tool for representation learning, that explains the data as linear combination of few basic elements. Yet, this analysis is not amenable in the context of graph learning, as graphs usually belong to different metric spaces. We fill this gap by proposing a new online Graph Dictionary Learning approach, which uses the Gromov Wasserstein divergence for the data fitting term. In our work, graphs are encoded through their nodes' pairwise relations and modeled as convex combination of graph atoms, i.e. dictionary elements, estimated thanks to an online stochastic algorithm, which operates on a dataset of unregistered graphs with potentially different number of nodes. Our approach naturally extends to labeled graphs, and is completed by a novel upper bound that can be used as a fast approximation of Gromov Wasserstein in the embedding space. We provide numerical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsAdvanced Graph Neural Networks · Anomaly Detection Techniques and Applications · Automated Road and Building Extraction
