Your Discrete Graph Diffusion Model is Secretly Memorizing
This work shows for the first time that graph diffusion models indeed exhibit memorization, and identifies a strong train-data bias that coincides with a growing generalization gap.
2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
This work shows for the first time that graph diffusion models indeed exhibit memorization, and identifies a strong train-data bias that coincides with a growing generalization gap.
Discrete graph diffusion models corrupt graph structure through independent edge updates with a Markovian noise model. Combined with the exchangeability requirement on the output distribution, the terminal prior is necessarily an Erd\H{o}s--R\'enyi (E-R) random graph. This has a fundamental consequence for unconditiona...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.