Generative Adversarial Learning from Deterministic Processes

• URL: http://arxiv.org/abs/2605.18425v1
• Date: Mon, 18 May 2026 13:57:49 GMT
• Title: Generative Adversarial Learning from Deterministic Processes
• Abstract summary: Physical AI is being successfully applied to data which does not follow the traditional paradigm of independent and identically distributed (i.i.d.) samples.<n>In fact, physical AI is often trained on data which is not random at all, and is instead derived from chaotic dynamical systems like turbulence.
• Score: 2.915947686247852
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Physical AI is being successfully applied to data which does not follow the traditional paradigm of independent and identically distributed (i.i.d.) samples. In fact, physical AI is often trained on data which is not random at all, and is instead derived from chaotic dynamical systems like turbulence. We aim to explain the empirical success of these methods using the example of generative adversarial networks (GANs), whose statistical learning theory under the i.i.d. assumption is generally well understood. We prove that it is possible, using an infinite-dimensional model of generative adversarial learning (GAL), to learn the invariant distribution of a sufficiently chaotic dynamical system from a single deterministically evolving time series of its states or measurements thereof, and give explicit rates for the convergence to the solution in terms of the Jensen-Shannon divergence.

Related papers

• pADAM: A Plug-and-Play All-in-One Diffusion Architecture for Multi-Physics Learning [7.782045150068569]
  pADAM is a unified generative framework that learns a shared probabilistic prior across heterogeneous partial differential equation families.<n>It supports forward prediction and inverse inference within a single architecture without retraining.
  arXiv  Detail & Related papers  (2026-03-17T16:37:11Z)
• Disordered Dynamics in High Dimensions: Connections to Random Matrices and Machine Learning [52.26396748560348]
  We provide an overview of high dimensional dynamical systems driven by random matrices.<n>We focus on applications to simple models of learning and generalization in machine learning theory.
  arXiv  Detail & Related papers  (2026-01-03T00:12:32Z)
• Universal Learning of Stochastic Dynamics for Exact Belief Propagation using Bernstein Normalizing Flows [10.143540866021542]
  This paper establishes the theoretical foundations for a class of models that satisfy both properties.<n>The proposed approach combines the expressiveness of normalizing density estimation with the analytical tractability of Bernsteins flows.
  arXiv  Detail & Related papers  (2025-09-19T02:36:35Z)
• Identifiability Challenges in Sparse Linear Ordinary Differential Equations [4.895067344504143]
  We show that sparse systems are unidentifiable with a positive probability in practically relevant sparsity regimes.<n>We further study empirically how this theoretical unidentifiability manifests in state-of-the-art methods to estimate linear ODEs from data.
  arXiv  Detail & Related papers  (2025-06-11T14:55:36Z)
• Learning Divergence Fields for Shift-Robust Graph Representations [73.11818515795761]
  In this work, we propose a geometric diffusion model with learnable divergence fields for the challenging problem with interdependent data. We derive a new learning objective through causal inference, which can guide the model to learn generalizable patterns of interdependence that are insensitive across domains.
  arXiv  Detail & Related papers  (2024-06-07T14:29:21Z)
• Training Implicit Generative Models via an Invariant Statistical Loss [3.139474253994318]
  Implicit generative models have the capability to learn arbitrary complex data distributions. On the downside, training requires telling apart real data from artificially-generated ones using adversarial discriminators. We develop a discriminator-free method for training one-dimensional (1D) generative implicit models.
  arXiv  Detail & Related papers  (2024-02-26T09:32:28Z)
• Identifiability and Asymptotics in Learning Homogeneous Linear ODE Systems from Discrete Observations [114.17826109037048]
  Ordinary Differential Equations (ODEs) have recently gained a lot of attention in machine learning. theoretical aspects, e.g., identifiability and properties of statistical estimation are still obscure. This paper derives a sufficient condition for the identifiability of homogeneous linear ODE systems from a sequence of equally-spaced error-free observations sampled from a single trajectory.
  arXiv  Detail & Related papers  (2022-10-12T06:46:38Z)
• Principled Knowledge Extrapolation with GANs [92.62635018136476]
  We study counterfactual synthesis from a new perspective of knowledge extrapolation. We show that an adversarial game with a closed-form discriminator can be used to address the knowledge extrapolation problem. Our method enjoys both elegant theoretical guarantees and superior performance in many scenarios.
  arXiv  Detail & Related papers  (2022-05-21T08:39:42Z)
• Learning continuous models for continuous physics [94.42705784823997]
  We develop a test based on numerical analysis theory to validate machine learning models for science and engineering applications. Our results illustrate how principled numerical analysis methods can be coupled with existing ML training/testing methodologies to validate models for science and engineering applications.
  arXiv  Detail & Related papers  (2022-02-17T07:56:46Z)
• Generative Adversarial Network for Probabilistic Forecast of Random Dynamical System [19.742888499307178]
  We present a deep learning model for data-driven simulations of random dynamical systems without a distributional assumption. We propose a regularization strategy for a generative adversarial network based on consistency conditions for the sequential inference problems. The behavior of the proposed model is studied by using three processes with complex noise structures.
  arXiv  Detail & Related papers  (2021-11-04T19:50:56Z)
• Learning Stochastic Behaviour from Aggregate Data [52.012857267317784]
  Learning nonlinear dynamics from aggregate data is a challenging problem because the full trajectory of each individual is not available. We propose a novel method using the weak form of Fokker Planck Equation (FPE) to describe the density evolution of data in a sampled form. In such a sample-based framework we are able to learn the nonlinear dynamics from aggregate data without explicitly solving the partial differential equation (PDE) FPE.
  arXiv  Detail & Related papers  (2020-02-10T03:20:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.