The quest for the GRAph Level autoEncoder (GRALE)
Although graph-based learning has attracted a lot of attention, graph representation learning is still a challenging task whose resolution may impact key application fields such as chemistry or biolog...
Our latest paper “The Quest for the GRAph Level autoEncoder (GRALE)” was accepted at NeurIPS 2025!
arxiv.org/abs/2505.22109
🏆 GRALE 🏆 can encode and decode graphs into and from a shared Euclidean space.
Training such a model should require solving the graph matching problem but...
16.10.2025 13:10 — 👍 7 🔁 2 💬 1 📌 1
ULOT predicts FUGW plans conditioned on the FUGW hyperparameters.
Trained in a fully unsupervised way by minimizing the FUGW loss, it ensures the near optimality of its predictions and diminishes the complexity of finding optimal FUGW plans from cubic to quadratic in the number of nodes.
(4/5)
29.09.2025 08:54 — 👍 3 🔁 0 💬 1 📌 0
Matching graphs can be achieved with the optimal transport distance Fused Unbalanced Gromov Wasserstein (FUGW). It produces meaningful plans but requires solving an optimization problem with cubic complexity in the number of nodes, which limits its applications.
(3/5)
29.09.2025 08:54 — 👍 3 🔁 0 💬 1 📌 0
We developed ULOT, a neural network designed to predict optimal transport plans between graphs. It achieves accurate predictions up to 100× faster than solvers, both on synthetic graphs and on brain data.
(2/5)
29.09.2025 08:54 — 👍 3 🔁 0 💬 1 📌 0