Paper recorded by Signals 4 on 2026-10-13 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-13 on arXiv · recorded by Signals 4 on 2026-10-14
Category: cs.LG · 机器学习 · first seen 2026-10-14
Persistent homology summarizes the topological evolution of a graph as persistence diagrams (PDs). Generating graphs whose topology matches a target descriptor is increasingly important, yet existing topology-aware generative models rely on soft regularization, producing graphs whose PDs may only be approximately similar. We initiate a principled investigation of the generation problem: produce gr