mLaSDI: Multi-stage latent space dynamics identification

• URL: http://arxiv.org/abs/2506.09207v2
• Date: Thu, 12 Jun 2025 16:31:29 GMT
• Title: mLaSDI: Multi-stage latent space dynamics identification
• Authors: William Anderson, Seung Whan Chung, Youngsoo Choi,
• Abstract summary: Recently, Latent Space Dynamics Identification was proposed as a data-driven, non-intrusive ROM framework.<n>We propose multi-stage Latent Space Dynamics Identification (mLa)<n>We find that applying mLa with small autoencoders results in lower prediction and reconstruction errors, while also reducing training time compared to La.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Determining accurate numerical solutions of partial differential equations (PDEs) is an important task in many scientific disciplines. However, solvers can be computationally expensive, leading to the development of reduced-order models (ROMs). Recently, Latent Space Dynamics Identification (LaSDI) was proposed as a data-driven, non-intrusive ROM framework. LaSDI compresses the training data using an autoencoder and learns a system of user-chosen ordinary differential equations (ODEs), which govern the latent space dynamics. This allows for rapid predictions by interpolating and evolving the low-dimensional ODEs in the latent space. While LaSDI has produced effective ROMs for numerous problems, the autoencoder can have difficulty accurately reconstructing training data while also satisfying the imposed dynamics in the latent space, particularly in complex or high-frequency regimes. To address this, we propose multi-stage Latent Space Dynamics Identification (mLaSDI). With mLaSDI, several autoencoders are trained sequentially in stages, where each autoencoder learns to correct the error of the previous stages. We find that applying mLaSDI with small autoencoders results in lower prediction and reconstruction errors, while also reducing training time compared to LaSDI.

Related papers

• Parametric Taylor series based latent dynamics identification neural networks [0.3139093405260182]
  A new latent identification of nonlinear dynamics, P-TLDINets, is introduced. It relies on a novel neural network structure based on Taylor series expansion and ResNets.
  arXiv  Detail & Related papers  (2024-10-05T15:10:32Z)
• A Comprehensive Review of Latent Space Dynamics Identification Algorithms for Intrusive and Non-Intrusive Reduced-Order-Modeling [0.20742830443146304]
  We focus on a framework known as Latent Space Dynamics Identification (La), which transforms the high-fidelity data, governed by a PDE, to simpler and low-dimensional data, governed by ordinary differential equations (ODEs) Each building block of La can be easily modulated depending on the application, which makes the La framework highly flexible. We demonstrate the performance of different La approaches on Burgers equation, a non-linear heat conduction problem, and a plasma physics problem, showing that La algorithms can achieve relative errors of less than a few percent and up to thousands of times speed-ups.
  arXiv  Detail & Related papers  (2024-03-16T00:45:06Z)
• Random resistive memory-based deep extreme point learning machine for unified visual processing [67.51600474104171]
  We propose a novel hardware-software co-design, random resistive memory-based deep extreme point learning machine (DEPLM) Our co-design system achieves huge energy efficiency improvements and training cost reduction when compared to conventional systems.
  arXiv  Detail & Related papers  (2023-12-14T09:46:16Z)
• Data-Driven Autoencoder Numerical Solver with Uncertainty Quantification for Fast Physical Simulations [0.0]
  We present Traditional, a hybrid deep-learning and Bayesian ROM.a. We trains an autoencoder on full-order-model (FOM) data and simultaneously learns simpler equations governing the latent space. Our framework is able to achieve up to 100,000 times speed-up and less than 7% relative error on fluid mechanics problems.
  arXiv  Detail & Related papers  (2023-12-02T04:03:32Z)
• Weak-Form Latent Space Dynamics Identification [0.2999888908665658]
  Recent work in data-driven modeling has demonstrated that a weak formulation of model equations enhances the noise robustness of computational methods. We demonstrate the power of the weak form to enhance the La (Latent Space Dynamics Identification) algorithm, a recently developed data-driven reduced order modeling technique.
  arXiv  Detail & Related papers  (2023-11-20T18:42:14Z)
• GPLaSDI: Gaussian Process-based Interpretable Latent Space Dynamics Identification through Deep Autoencoder [0.0]
  We introduce a novel La Gaussian-based framework that relies on latent space ODEs. We demonstrate the effectiveness of our approach on the Burgers equation, the Vlasov equation for plasma physics, and a rising thermal bubble problem. Our proposed method achieves between 200 and 100,000 times speed-up, with up to 7% up relative error.
  arXiv  Detail & Related papers  (2023-08-10T23:54:12Z)
• Solving High-Dimensional PDEs with Latent Spectral Models [74.1011309005488]
  We present Latent Spectral Models (LSM) toward an efficient and precise solver for high-dimensional PDEs. Inspired by classical spectral methods in numerical analysis, we design a neural spectral block to solve PDEs in the latent space. LSM achieves consistent state-of-the-art and yields a relative gain of 11.5% averaged on seven benchmarks.
  arXiv  Detail & Related papers  (2023-01-30T04:58:40Z)
• Dynamic Network-Assisted D2D-Aided Coded Distributed Learning [59.29409589861241]
  We propose a novel device-to-device (D2D)-aided coded federated learning method (D2D-CFL) for load balancing across devices. We derive an optimal compression rate for achieving minimum processing time and establish its connection with the convergence time. Our proposed method is beneficial for real-time collaborative applications, where the users continuously generate training data.
  arXiv  Detail & Related papers  (2021-11-26T18:44:59Z)
• Coupled and Uncoupled Dynamic Mode Decomposition in Multi-Compartmental Systems with Applications to Epidemiological and Additive Manufacturing Problems [58.720142291102135]
  We show that Dynamic Decomposition (DMD) may be a powerful tool when applied to nonlinear problems. In particular, we show interesting numerical applications to a continuous delayed-SIRD model for Covid-19.
  arXiv  Detail & Related papers  (2021-10-12T21:42:14Z)
• Adaptive Machine Learning for Time-Varying Systems: Low Dimensional Latent Space Tuning [91.3755431537592]
  We present a recently developed method of adaptive machine learning for time-varying systems. Our approach is to map very high (N>100k) dimensional inputs into the low dimensional (N2) latent space at the output of the encoder section of an encoder-decoder CNN. This method allows us to learn correlations within and to track their evolution in real time based on feedback without interrupts.
  arXiv  Detail & Related papers  (2021-07-13T16:05:28Z)
• Evidential Sparsification of Multimodal Latent Spaces in Conditional Variational Autoencoders [63.46738617561255]
  We consider the problem of sparsifying the discrete latent space of a trained conditional variational autoencoder. We use evidential theory to identify the latent classes that receive direct evidence from a particular input condition and filter out those that do not. Experiments on diverse tasks, such as image generation and human behavior prediction, demonstrate the effectiveness of our proposed technique.
  arXiv  Detail & Related papers  (2020-10-19T01:27:21Z)

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.