Paper recorded by Signals 4 on 2026-09-04 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-09-04 on arXiv · recorded by Signals 4 on 2026-09-07
Category: cs.LG · 机器学习 · first seen 2026-09-07
Generating categorical graphs requires choosing node and edge types that form a coherent structure without depending on node order. Many graph generators encode categories as fixed one-hot vectors, which can impose an artificial geometry in which categories are equidistant. We propose Embedded Graph Flows (EGF), a generative model that learns continuous embeddings for node and unordered-edge categ