arXiv Machine Learning
Unsupervised Multi-Scale Gromov-Wasserstein Hypergraph Alignment
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Jul 9
Diffusion enabled Optimal Transport distances for graph matching
arXiv:2607. 06646v1 Announce Type: cross Abstract: This paper introduces Diffusion Semi-Relaxed Fused Gromov-Wasserstein (DsrFGW), a novel method for graph comparison that unifies node features and structural connectivity through optimal transport.
arXiv Machine Learning
Aug 28
Gromov-Monge Flow Matching for Equivariant Graph Generation
The paper introduces Gromov-Monge Flow Matching, a method that incorporates permutation-equivariance into generative graph models by aligning graph pairs up to node relabeling using the Gromov–Monge distance. It shows theoretically that quotient couplings can be lifted to aligned representatives without extra cost and that symmetrization yields equivariant flow-matching minimizers, even for categorical endpoints. Practically, the authors build minibatch couplings with Gromov–Wasserstein relaxations and optional outer assignments, improving sample quality in continuous graph and categorical molecular generation while remaining compatible with standard equivariant architectures.
arXiv Machine Learning
Jul 28
Unsupervised Graph Representation Learning with Complementary View Alignment
arXiv:2607. 24338v1 Announce Type: new Abstract: Unsupervised graph representation learning aims to derive meaningful node embeddings by capturing both structural and attribute information without relying on labeled data.
arXiv Machine Learning
Jul 28
On a linear fused Gromov-Wasserstein distance for graph structured data
arXiv:2203. 04711v2 Announce Type: replace Abstract: We present a framework for embedding graph structured data into a vector space, taking into account node features and topology of a graph into the optimal transport (OT) problem.
arXiv Machine Learning
Jun 2
Chaining 2-FWL GNNs for Combinatorial Graph Alignment
arXiv:2510. 03086v2 Announce Type: replace Abstract: For the combinatorial graph alignment problem (GAP) -- finding the node correspondence that maximizes the number of common edges (nce) between two unlabeled graphs -- properly initialized FAQ remains a strong classical baseline, while existing GNN approaches struggle in the purely structural setting.
arXiv Machine Learning
Jun 9
Beyond Convolution: Advancing Hypergraph Neural Networks with Hypergraph U-Nets
arXiv:2606. 09051v1 Announce Type: new Abstract: Convolutions have successfully transitioned from image processing to the complex realm of non-Euclidean higher-order domains, particularly in hypergraphs.