arXiv:2608.29867v1 Announce Type: new Abstract: Autoencoders are widely used for nonlinear dimensionality reduction and manifold learning. While most common implementations rely on both nonlinear enc...
The paper introduces function‑space versions of autoencoders (FAE) and variational autoencoders (FVAE), analysing their theoretical properties and practical deployment. It highlights that the FVAE objective is well‑defined only when the data distribution aligns with the generative model, a restriction often met when data come from stochastic differential equations. In contrast, the FAE objective remains well‑defined in many cases where FVAE fails, and both can be paired with neural operator architectures to enable tasks such as inpainting, super‑resolution, and generative modelling of scientific data.
arXiv:2606. 19562v1 Announce Type: new Abstract: This chapter reviews recent advances in Scientific Machine Learning (SciML) for modeling coupled fluid flow and transport phenomena governed by the incompressible Navier-Stokes and scalar transport equations.
arXiv:2608. 11435v1 Announce Type: new Abstract: Forward and inverse modeling of parametric dynamical systems requires surrogate models that are not only accurate for state prediction, but also informative for parameter calibration.
arXiv:2605. 27756v2 Announce Type: replace-cross Abstract: Linear dimensionality reduction methods such as proper orthogonal decomposition (POD) make high-dimensional data amenable to analysis by identifying the principal components, or modes, that capture the most variance, or energy, in the data and constructing a low-dimensional representation in the subspace they span.
arXiv:2602. 03082v2 Announce Type: replace Abstract: A growing number of neural architectures have been proposed to enforce geometric constraints, including projection-based networks, exponential-map updates, constrained output layers, and manifold neural ODEs.
arXiv:2410. 10137v5 Announce Type: replace Abstract: We develop Riemannian approaches to variational autoencoders (VAEs) for PDE-type ambient data with regularizing geometric latent dynamics, which we refer to as VAE-DLM, or VAEs with dynamical latent manifolds.
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.
arXiv:2509. 16395v2 Announce Type: replace-cross Abstract: Evolutionary deep neural networks (EDNNs) solve time-dependent partial differential equations by evolving the neural-network parameters sequentially in time through a local least-squares problem.
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.
This chapter reviews recent advances in Scientific Machine Learning (SciML) for modeling coupled fluid flow and transport phenomena governed by the incompressible Navier-Stokes and scalar transport equations. Such systems, found in applications like turbidity currents and thermal convection, feature strong nonlinear coupling and multiscale behavior that make high-fidelity simulations computationally expensive.
arXiv:2605. 28983v2 Announce Type: replace-cross Abstract: In this paper, training a neural network is identified, exactly, as a search through Hamilton--Jacobi initial-value problems: each gradient step selects the initial data of a viscous Hamilton--Jacobi equation whose Hopf--Cole propagator best fits the observations; at inference, the input is the spatial point at which that solution is evaluated and the initial condition is already encoded in the weights.