arXiv Machine Learning

Seismic Site Response Prediction from Sparse Observations Using Finite-Element-Pretrained Latent Dynamics

The paper introduces FLARE‑T, a Transfer‑Enabled Forced Latent Autoencoder for Response Equations, which learns low‑dimensional latent dynamics from dense finite‑element simulations and calibrates them with sparse field observations. By mapping simulated sensor responses into a learned coordinate system, FLARE‑T improves multi‑depth acceleration predictions and pseudo‑acceleration spectra, reducing errors across various sensor locations and motion intensities. Evaluation on a layered‑soil centrifuge test and the Lotung field array demonstrates that FLARE‑T achieves comparable accuracy with different source models, indicating less reliance on precise prior calibration.

arXiv AI
Jul 7

Generative wave propagator

arXiv:2607. 04440v1 Announce Type: cross Abstract: Seismic wavefield simulation is fundamental to seismology, but conventional finite-difference (FD) methods remain limited by numerical dispersion and stability constraints, which often require dense spatial grids and small time steps and thereby severely limit the effectiveness of iterative inversion workflows.

By Shijun Cheng, Tariq Alkhalifah
arXiv Machine Learning
Sep 23

Parameter-Efficient Adaptation of Pre-Trained Vision Foundation Models for Active and Passive Seismic Data Denoising

The paper presents a framework that adapts general-purpose Vision Foundation Models (VFMs) to seismic data denoising using Parameter‑Efficient Fine‑Tuning with Low‑Rank Adaptation (LoRA). It introduces a kurtosis‑guided unsupervised test‑time adaptation module that updates only LoRA parameters to self‑calibrate for site‑specific noise without ground truth. Experiments on exploration seismic images and DAS data demonstrate that the approach matches or surpasses domain‑specific models and generalizes well to unseen cross‑site data.

By Jiahua Zhao, Umair bin Waheed, Jing Sun, Yang Cui, Nikos Savva, Eric Verschuur
arXiv Machine Learning
Sep 1

Sensitivity-Constrained Neural Operators for Data-Efficient Forward and Inverse Modeling of Partial Differential Equation Systems

The paper introduces Sensitivity‑Constrained Neural Operators (SC‑NOs), which augment standard neural operator training with sampled Jacobian supervision from differentiable solvers or discrete adjoints. By matching selected sensitivities during training, SC‑NOs improve forward prediction accuracy and significantly enhance gradient‑based inverse reconstruction for distributed fields. Experiments on advection–diffusion, RANS–Spalart–Allmaras, high‑dimensional gridded inputs, and a shallow‑water tsunami source‑inversion case demonstrate that SC‑NOs achieve a better accuracy–cost trade‑off and enable near‑real‑time wave‑propagation forecasting from sparse observations.

By Abdolmehdi Behroozi, Chaopeng Shen, Daniel Kifer, Kathryn Lawson
arXiv Machine Learning
Sep 4

Observation-Aligned Two-Stage Domain Decomposition for Physics-Informed Traffic State Estimation with Sparse Fixed Sensors

The paper introduces Observation‑Aligned Two‑Stage Domain Decomposition Physics‑Informed Neural Networks (TSDD‑PINN) for reconstructing traffic speed fields from sparse fixed sensors. It first trains a global PINN, then uses its residuals to partition the domain and warm‑start child networks, allowing spatial, temporal, or space‑time refinement. Experiments on the I‑24 MOTION dataset show that TSDD‑PINN achieves lower relative L2 error in most configurations and trains faster than the XPINN baseline, with performance depending on sensing density.

By Eunhan Ka, Ludovic Leclercq, Satish V. Ukkusuri
arXiv AI
Aug 20

SeisEvo: Evolution of Seismic Data Reconstruction Algorithms by Agents

SeisEvo is a method that uses a large language model (LLM) and multi‑agent search to evolve seismic data reconstruction algorithms rather than optimize a single result. Starting from a classical algorithm, the agents modify only user‑opened components, rejecting candidates that violate physical constraints and scoring the rest by execution. The resulting white‑box algorithms—such as a residual‑gated, phase‑aligned dip‑consistency projection for interpolation and a reliability‑grouped singular‑value shrinkage for simultaneous interpolation and denoising—outperform classic methods by several decibels and generalize to unseen data.

By Yingjie Xu, Siwei Yu, Jianwei Ma
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