arXiv Machine Learning

In-span learning: adapting reduced-order models using their own predictions

arXiv:2607. 02937v1 Announce Type: new Abstract: Reduced-order models compress high-dimensional dynamics into low-dimensional representations that can be evaluated rapidly, but they lose accuracy when online dynamics drift beyond the training data.

arXiv Machine Learning
Sep 22

In-context learning from self-generated trajectories for adaptive model reduction

The paper introduces an in‑span adaptation technique for reduced‑order models, where the reduced subspace is continually updated using the model’s own predictions via an incremental singular‑value decomposition with a forgetting factor. This creates a trajectory‑informed spectral preconditioner that reweights and realigns the basis without changing the subspace, enabling the model to better absorb future out‑of‑span corrections. The authors demonstrate the method on a 3‑D spiral example and nonlinear PDEs such as viscous Burgers and Fisher–KPP, and relate the approach to in‑context learning in dynamical systems.

By Amirpasha Hedayat, Laura Balzano, Karthik Duraisamy
arXiv AI
Aug 25

FreKoo++: Learning Continuous Spectral Dynamics for Temporal Domain Generalization

FreKoo++ is a continuous spectral-dynamical framework designed for Temporal Domain Generalization (TDG). It unifies continuous Koopman modal dynamics with adaptive spectral disentanglement, mapping source-domain parameters into a latent space and modeling their evolution as a superposition of learnable continuous modes. The method handles irregular timestamps, supports arbitrary horizon extrapolation, and introduces an adaptive soft spectral weighting mechanism that isolates persistent dynamics from transient noise, achieving state‑of‑the‑art performance on discrete and continuous TDG benchmarks.

By En Yu, Xiaoyu Yang, Wei Duan, Guangquan Zhang, Jie Lu
arXiv Machine Learning
Sep 2

Efficient Adaptation of ROMs for Unsteady Flows Using Data Assimilation

The paper presents a lightweight retraining strategy for a parameterized Reduced Order Model (ROM) that achieves full‑model accuracy using only a fraction of the computational effort and sparse observations. The ROM architecture combines a Variational Autoencoder for dimensionality reduction with a transformer network that evolves latent states while accounting for the Reynolds number as an external control variable. By leveraging the probabilistic VAE, the method generates trajectory ensembles and uncertainty estimates, and adapts to out‑of‑sample parameters through sparse data assimilation with an ensemble Kalman filter, focusing retraining on the autoencoder to correct latent manifold distortions.

By Isma\"el Zighed, Andrea N\'ovoa, Luca Magri, Taraneh Sayadi
arXiv AI
4d ago

Transolver-$\sigma$: Joint Spectral-Physical Subspace Modeling for Neural PDE Solving

Transolver‑σ is a neural PDE solver that jointly models spectral and physical subspaces to improve accuracy in both one‑step and autoregressive rollouts. The method uses adaptive physical-state interactions, Slice‑Residual Physics‑Attention, and an axis‑factorized Fourier operator to enable information exchange between representations. Across five standard PDE benchmarks, Transolver‑σ reduces benchmark‑averaged relative error by 33.4% compared to the strongest baseline and shows strong performance on coupled multiphysics systems and real‑world fluid and combustion data.

By Haonan Shangguan, Hang Zhou, Haixu Wu, Yuezhou Ma, Jianmin Wang, Mingsheng Long
arXiv Machine Learning
Sep 25

Beyond Compression: Training Latent Representations for Stable Long-Horizon Rollout in Neural Surrogate Solvers

The paper investigates why latent neural surrogate solvers, which compress physical system dynamics into a lower‑dimensional space, often fail during long‑horizon autoregressive rollouts. It demonstrates that training the latent representation only for reconstruction leads to instability, and proposes a set of training interventions—Koopman operator learning, Hamming noise injection, and multi‑step rollout fine‑tuning—that align the latent space with long‑horizon forecasting. These interventions reduce long‑rollout error by about 40 % and achieve accuracy comparable to full‑resolution models while using far fewer floating‑point operations and GPU memory, enabling stable extrapolation in mesoscale crystal‑plasticity simulations of high‑cycle fatigue.

By Andreas E. Robertson, Ashley T. Lenau, John D. Shimanek, Benjamin A. Jasperson, Vivek Oommen, David L. Damm, Krishna Garikipati, Remi Dingreville