The study introduces RegimeShift‑Surrogates, a streaming benchmark that tests surrogate models across eight tasks and multiple regimes. It compares revalidation—choosing the model with lowest current‑window validation loss—to stateful adaptive controllers and finds that revalidation consistently outperforms stateful methods, achieving lower mean log regret in most task‑scenario combinations. The results suggest that fresh validation evidence is more valuable than carrying over past evidence when dealing with distribution shifts.
By Harshil Lodhiya
arXiv:2604. 18194v2 Announce Type: replace Abstract: Single-step generators promise high-fidelity synthesis at a fraction of the inference and training cost of ordinary differential equation (ODE)-based flow models, a central concern when compute is limited.
By Arkadii Kazanskii, Tatiana Petrova, Andrey Ustyuzhanin, Konstantin Bagrianskii, Aleksandr Puzikov, Radu State
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
The paper introduces the Latent Generative Solver (LGS), a neural PDE solver that combines a Physics VAE, a Pyramidal Flow-Forcing Transformer, and input noising to achieve generalization across twelve PDE families and stable long-term rollouts. LGS matches or surpasses deterministic baselines on one-step predictions, outperforms them on 5- and 10-step rollouts, and significantly reduces long-horizon error while cutting compute costs. It also adapts efficiently to unseen higher-resolution systems, demonstrating strong empirical performance on 2D regular-grid PDE simulations.
By Zituo Chen, Sili Deng
ChannelFlow-Tools is an open‑source, configuration‑driven pipeline that generates machine‑learning‑ready datasets for three‑dimensional obstructed channel flows. It combines procedural obstacle geometry generation across six shape families, signed‑distance‑field voxelisation, lattice‑Boltzmann simulation, and packaging into ML‑ready tensors, all driven by reproducible configuration files. The pipeline is validated through mesh‑integrity audits, SDF representation checks, solver benchmarks, and data‑integrity audits, and it has been used to train surrogate models (3D U‑Net, FNO, U‑FNO) that learn geometry‑to‑flow mappings and exhibit physically interpretable behaviour on out‑of‑distribution splits.
By Shubham Kavane, Lukas Schr\"oder, Kajol Kulkarni, Fernando Gonzalez, Harald Koestler
arXiv:2606. 09949v1 Announce Type: cross Abstract: Data-driven PDE surrogates are trained with data produced by numerical PDE solvers.
By Pierre Cesar (DATAMOVE), Sofya Dymchenko (DATAMOVE), Abhishek Purandare (DATAMOVE), Bruno Raffin (DATAMOVE)
arXiv:2607. 24569v1 Announce Type: cross Abstract: Model-based active flow control requires predictive models that are accurate, stable, and fast enough for real-time optimisation.
By Alberto Solera-Rico, Patricia Garc\'ia-Caspue\~nas, Carlos Sanmiguel Vila, Stefano Discetti
arXiv:2607. 10203v2 Announce Type: replace-cross Abstract: Adaptive-compute world models -- early-exit or mixture-of-depths predictors that spend variable depth per step -- assume depth buys better predictions and can be routed adaptively.
By Achyuthan Sivasankar
arXiv:2608. 13096v1 Announce Type: new Abstract: Limit order book (LOB) simulators are most useful to practitioners when they combine realistic market dynamics, computationally efficient sampling, controllable scenario generation, and the ability to generalize beyond the instruments seen during training---properties that existing agent-based and deep generative simulators provide only partially.
By Zhuohan Wang, Andreea Bacalum, Ollie Olby, Carmine Ventre, Namid Stillman
arXiv:2608. 00675v1 Announce Type: cross Abstract: Autoregressive models accumulate error over long rollouts, yet at deployment there is no ground truth to measure it against.
By Alexander Scheinker
The paper introduces a sparse, residual world model that focuses on predicting only the changes in a scene by using a per-object change gate and a residual delta head. On a MuJoCo tabletop pushing benchmark, this approach outperforms a dense multilayer perceptron, achieving 2.5 to 4.6 times better next‑state pose accuracy with 8.6 to 11.1 times fewer parameters, maintaining high change‑detection F1 scores, and showing strong transfer across object counts. In autoregressive rollout and sampling‑based planning, the sparse model accumulates less error and enables successful planning where dense models fail.
By Param Thakkar, Parsika Paresh Shah, Manisha Sushant Gote
arXiv:2607. 10203v1 Announce Type: cross Abstract: Adaptive-compute world models -- early-exit or mixture-of-depths predictors that spend variable depth per step -- assume depth buys better predictions and can be routed adaptively.
By Achyuthan Sivasankar