Building symmetries into data-driven manifold dynamics models for
complex flows
- URL: http://arxiv.org/abs/2312.10235v1
- Date: Fri, 15 Dec 2023 22:05:21 GMT
- Title: Building symmetries into data-driven manifold dynamics models for
complex flows
- Authors: Carlos E. P\'erez De Jes\'us, Alec J. Linot, Michael D. Graham
- Abstract summary: We exploit the symmetries of the Navier-Stokes equations to find the manifold where the long-time dynamics live.
We apply this framework to two-dimensional Kolmogorov flow in a chaotic bursting regime.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Symmetries in a dynamical system provide an opportunity to dramatically
improve the performance of data-driven models. For fluid flows, such models are
needed for tasks related to design, understanding, prediction, and control. In
this work we exploit the symmetries of the Navier-Stokes equations (NSE) and
use simulation data to find the manifold where the long-time dynamics live,
which has many fewer degrees of freedom than the full state representation, and
the evolution equation for the dynamics on that manifold. We call this method
''symmetry charting''. The first step is to map to a ''fundamental chart'',
which is a region in the state space of the flow to which all other regions can
be mapped by a symmetry operation. To map to the fundamental chart we identify
a set of indicators from the Fourier transform that uniquely identify the
symmetries of the system. We then find a low-dimensional coordinate
representation of the data in the fundamental chart with the use of an
autoencoder. We use a variation called an implicit rank minimizing autoencoder
with weight decay, which in addition to compressing the dimension of the data,
also gives estimates of how many dimensions are needed to represent the data:
i.e. the dimension of the invariant manifold of the long-time dynamics.
Finally, we learn dynamics on this manifold with the use of neural ordinary
differential equations. We apply symmetry charting to two-dimensional
Kolmogorov flow in a chaotic bursting regime. This system has a continuous
translation symmetry, and discrete rotation and shift-reflect symmetries. With
this framework we observe that less data is needed to learn accurate
data-driven models, more robust estimates of the manifold dimension are
obtained, equivariance of the NSE is satisfied, better short-time tracking with
respect to the true data is observed, and long-time statistics are correctly
captured.
Related papers
- Learning Infinitesimal Generators of Continuous Symmetries from Data [15.42275880523356]
We propose a novel symmetry learning algorithm based on transformations defined with one- parameter groups.
Our method is built upon minimal inductive biases, encompassing not only commonly utilized symmetries rooted in Lie groups but also extending to symmetries derived from nonlinear generators.
arXiv Detail & Related papers (2024-10-29T08:28:23Z) - A Generative Model of Symmetry Transformations [44.87295754993983]
We build a generative model that explicitly aims to capture the data's approximate symmetries.
We empirically demonstrate its ability to capture symmetries under affine and color transformations.
arXiv Detail & Related papers (2024-03-04T11:32:18Z) - Dynamical Regimes of Diffusion Models [14.797301819675454]
We study generative diffusion models in the regime where the dimension of space and the number of data are large.
Our analysis reveals three distinct dynamical regimes during the backward generative diffusion process.
The dependence of the collapse time on the dimension and number of data provides a thorough characterization of the curse of dimensionality for diffusion models.
arXiv Detail & Related papers (2024-02-28T17:19:26Z) - Automatic Parameterization for Aerodynamic Shape Optimization via Deep
Geometric Learning [60.69217130006758]
We propose two deep learning models that fully automate shape parameterization for aerodynamic shape optimization.
Both models are optimized to parameterize via deep geometric learning to embed human prior knowledge into learned geometric patterns.
We perform shape optimization experiments on 2D airfoils and discuss the applicable scenarios for the two models.
arXiv Detail & Related papers (2023-05-03T13:45:40Z) - Capturing dynamical correlations using implicit neural representations [85.66456606776552]
We develop an artificial intelligence framework which combines a neural network trained to mimic simulated data from a model Hamiltonian with automatic differentiation to recover unknown parameters from experimental data.
In doing so, we illustrate the ability to build and train a differentiable model only once, which then can be applied in real-time to multi-dimensional scattering data.
arXiv Detail & Related papers (2023-04-08T07:55:36Z) - VTAE: Variational Transformer Autoencoder with Manifolds Learning [144.0546653941249]
Deep generative models have demonstrated successful applications in learning non-linear data distributions through a number of latent variables.
The nonlinearity of the generator implies that the latent space shows an unsatisfactory projection of the data space, which results in poor representation learning.
We show that geodesics and accurate computation can substantially improve the performance of deep generative models.
arXiv Detail & Related papers (2023-04-03T13:13:19Z) - Oracle-Preserving Latent Flows [58.720142291102135]
We develop a methodology for the simultaneous discovery of multiple nontrivial continuous symmetries across an entire labelled dataset.
The symmetry transformations and the corresponding generators are modeled with fully connected neural networks trained with a specially constructed loss function.
The two new elements in this work are the use of a reduced-dimensionality latent space and the generalization to transformations invariant with respect to high-dimensional oracles.
arXiv Detail & Related papers (2023-02-02T00:13:32Z) - Dynamics of a data-driven low-dimensional model of turbulent minimal
Couette flow [0.0]
We show that a description of turbulent Couette flow is possible using a data-driven manifold dynamics modeling method.
We build models with fewer than $20$ degrees of freedom that quantitatively capture key characteristics of the flow.
For comparison, we show that the models outperform POD-Galerkin models with $sim$2000 degrees of freedom.
arXiv Detail & Related papers (2023-01-11T18:50:08Z) - Data-driven low-dimensional dynamic model of Kolmogorov flow [0.0]
Reduced order models (ROMs) that capture flow dynamics are of interest for decreasing computational costs for simulation.
This work presents a data-driven framework for minimal-dimensional models that effectively capture the dynamics and properties of the flow.
We apply this to Kolmogorov flow in a regime consisting of chaotic and intermittent behavior.
arXiv Detail & Related papers (2022-10-29T23:05:39Z) - Predicting traffic signals on transportation networks using
spatio-temporal correlations on graphs [56.48498624951417]
This paper proposes a traffic propagation model that merges multiple heat diffusion kernels into a data-driven prediction model to forecast traffic signals.
We optimize the model parameters using Bayesian inference to minimize the prediction errors and, consequently, determine the mixing ratio of the two approaches.
The proposed model demonstrates prediction accuracy comparable to that of the state-of-the-art deep neural networks with lower computational effort.
arXiv Detail & Related papers (2021-04-27T18:17:42Z) - Assignment Flows for Data Labeling on Graphs: Convergence and Stability [69.68068088508505]
This paper establishes conditions on the weight parameters that guarantee convergence of the continuous-time assignment flow to integral assignments (labelings)
Several counter-examples illustrate that violating the conditions may entail unfavorable behavior of the assignment flow regarding contextual data classification.
arXiv Detail & Related papers (2020-02-26T15:45:38Z)
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.