Saved in:
Bibliographic Details
Main Authors: Pao-Huang, Peter, Black, Mitchell, Qiu, Xiaojie
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2507.09391
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911052841615360
author Pao-Huang, Peter
Black, Mitchell
Qiu, Xiaojie
author_facet Pao-Huang, Peter
Black, Mitchell
Qiu, Xiaojie
contents Generative modeling of graphs with spatial structure is essential across many applications from computer graphics to spatial genomics. Recent flow-based generative models have achieved impressive results by gradually adding and then learning to remove noise from these graphs. Existing models, however, use graph neural network architectures that are independent of the noise level, limiting their expressiveness. To address this issue, we introduce \textit{Noise-Conditioned Graph Networks} (NCGNs), a class of graph neural networks that dynamically modify their architecture according to the noise level during generation. Our theoretical and empirical analysis reveals that as noise increases, (1) graphs require information from increasingly distant neighbors and (2) graphs can be effectively represented at lower resolutions. Based on these insights, we develop Dynamic Message Passing (DMP), a specific instantiation of NCGNs that adapts both the range and resolution of message passing to the noise level. DMP consistently outperforms noise-independent architectures on a variety of domains including $3$D point clouds, spatiotemporal transcriptomics, and images. Code is available at https://github.com/peterpaohuang/ncgn.
format Preprint
id arxiv_https___arxiv_org_abs_2507_09391
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Geometric Generative Modeling with Noise-Conditioned Graph Networks
Pao-Huang, Peter
Black, Mitchell
Qiu, Xiaojie
Machine Learning
Generative modeling of graphs with spatial structure is essential across many applications from computer graphics to spatial genomics. Recent flow-based generative models have achieved impressive results by gradually adding and then learning to remove noise from these graphs. Existing models, however, use graph neural network architectures that are independent of the noise level, limiting their expressiveness. To address this issue, we introduce \textit{Noise-Conditioned Graph Networks} (NCGNs), a class of graph neural networks that dynamically modify their architecture according to the noise level during generation. Our theoretical and empirical analysis reveals that as noise increases, (1) graphs require information from increasingly distant neighbors and (2) graphs can be effectively represented at lower resolutions. Based on these insights, we develop Dynamic Message Passing (DMP), a specific instantiation of NCGNs that adapts both the range and resolution of message passing to the noise level. DMP consistently outperforms noise-independent architectures on a variety of domains including $3$D point clouds, spatiotemporal transcriptomics, and images. Code is available at https://github.com/peterpaohuang/ncgn.
title Geometric Generative Modeling with Noise-Conditioned Graph Networks
topic Machine Learning
url https://arxiv.org/abs/2507.09391