Table of Contents
Fetching ...

Generative Adversarial Neural Operators

Md Ashiqur Rahman, Manuel A. Florez, Anima Anandkumar, Zachary E. Ross, Kamyar Azizzadenesheli

TL;DR

This work introduces Generative Adversarial Neural Operator (GANO), a framework that extends GANs to infinite-dimensional function spaces by using a generator neural operator and a discriminator neural functional. The method learns push-forward measures from input function spaces (e.g., Gaussian random fields) to output function spaces, optimizing a Wasserstein objective with a gradient penalty tailored to infinite dimensions. It leverages discretization-invariant neural operators (e.g., Fourier and U-shaped architectures) to produce function-valued outputs that can be queried at arbitrary resolutions, and it demonstrates superior capability over classical GANs on both synthetic GRF data and real-world InSAR volcano deformation data. These contributions enable robust generative modeling for functional data in physics, geoscience, and engineering, where observations are intrinsically infinite-dimensional. The work also provides practical guidance on architecture choices and training strategies, along with code and datasets for reproducibility.

Abstract

We propose the generative adversarial neural operator (GANO), a generative model paradigm for learning probabilities on infinite-dimensional function spaces. The natural sciences and engineering are known to have many types of data that are sampled from infinite-dimensional function spaces, where classical finite-dimensional deep generative adversarial networks (GANs) may not be directly applicable. GANO generalizes the GAN framework and allows for the sampling of functions by learning push-forward operator maps in infinite-dimensional spaces. GANO consists of two main components, a generator neural operator and a discriminator neural functional. The inputs to the generator are samples of functions from a user-specified probability measure, e.g., Gaussian random field (GRF), and the generator outputs are synthetic data functions. The input to the discriminator is either a real or synthetic data function. In this work, we instantiate GANO using the Wasserstein criterion and show how the Wasserstein loss can be computed in infinite-dimensional spaces. We empirically study GANO in controlled cases where both input and output functions are samples from GRFs and compare its performance to the finite-dimensional counterpart GAN. We empirically study the efficacy of GANO on real-world function data of volcanic activities and show its superior performance over GAN.

Generative Adversarial Neural Operators

TL;DR

This work introduces Generative Adversarial Neural Operator (GANO), a framework that extends GANs to infinite-dimensional function spaces by using a generator neural operator and a discriminator neural functional. The method learns push-forward measures from input function spaces (e.g., Gaussian random fields) to output function spaces, optimizing a Wasserstein objective with a gradient penalty tailored to infinite dimensions. It leverages discretization-invariant neural operators (e.g., Fourier and U-shaped architectures) to produce function-valued outputs that can be queried at arbitrary resolutions, and it demonstrates superior capability over classical GANs on both synthetic GRF data and real-world InSAR volcano deformation data. These contributions enable robust generative modeling for functional data in physics, geoscience, and engineering, where observations are intrinsically infinite-dimensional. The work also provides practical guidance on architecture choices and training strategies, along with code and datasets for reproducibility.

Abstract

We propose the generative adversarial neural operator (GANO), a generative model paradigm for learning probabilities on infinite-dimensional function spaces. The natural sciences and engineering are known to have many types of data that are sampled from infinite-dimensional function spaces, where classical finite-dimensional deep generative adversarial networks (GANs) may not be directly applicable. GANO generalizes the GAN framework and allows for the sampling of functions by learning push-forward operator maps in infinite-dimensional spaces. GANO consists of two main components, a generator neural operator and a discriminator neural functional. The inputs to the generator are samples of functions from a user-specified probability measure, e.g., Gaussian random field (GRF), and the generator outputs are synthetic data functions. The input to the discriminator is either a real or synthetic data function. In this work, we instantiate GANO using the Wasserstein criterion and show how the Wasserstein loss can be computed in infinite-dimensional spaces. We empirically study GANO in controlled cases where both input and output functions are samples from GRFs and compare its performance to the finite-dimensional counterpart GAN. We empirically study the efficacy of GANO on real-world function data of volcanic activities and show its superior performance over GAN.
Paper Structure (13 sections, 9 equations, 10 figures, 1 table, 1 algorithm)

This paper contains 13 sections, 9 equations, 10 figures, 1 table, 1 algorithm.

Figures (10)

  • Figure 1: Generative adversarial neural operator (GANO)
  • Figure 2: The input function sample is GRF and the data is generated from another GRF. (a) The samples of data GRF. (b) The samples of generated data from GAN model. (c) The samples of generated data from GANO model. (d) GAN Auto correlation. (e) GAN histogram. (f) GANO auto correlation. (g) GANO histogram
  • Figure 3: The input function sample is GRF and the data is generated from a mixture of GRFs. (a) The samples of data from a mixture of GRFs. (b) The samples of generated data from GAN model. (c) The samples of generated data from GANO model. (d) GAN Auto correlation. (e) GAN histogram. (f) GANO Auto correlation. (g) GANO histogram
  • Figure 4: GANO trained on smooth data ($\tau=5$) with rougher input GRF ($\tau=7$)
  • Figure 5: GANO trained on same GRF as input and data ($\tau =5$)
  • ...and 5 more figures

Theorems & Definitions (1)

  • Definition 3.1: Discretization Insurance