arXiv:2607. 01746v1 Announce Type: new Abstract: Recurrent representations are trajectories, but representation geometry is often measured from static snapshots.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.
arXiv:2606. 03820v1 Announce Type: cross Abstract: We develop a quantitative approximation framework for diffusion distillation, viewing few-step sampling as error propagation under compositions of learned flow maps.
arXiv:2605. 05540v2 Announce Type: replace Abstract: Fast surrogate modeling for high-dimensional physical dynamics requires more than low short-term error: useful models must roll out efficiently while preserving the statistical structure of long trajectories.
The paper introduces flux‑form spatiotemporal neural operators for predicting coarse‑grained dynamics of multiscale PDEs without relying on closure models. It learns a surrogate evolution operator from filtered high‑fidelity data, using Fourier convolution for spatial mixing and a causal kernel with time‑lag attention for temporal mixing. The method incorporates a flux‑form inductive bias to maintain conservation and provides a data‑driven rule for selecting memory length, achieving stable, accurate long‑horizon rollouts on benchmark equations and turbulent flow simulations.
The paper introduces the Variational Incompressible Optimal Transport (VIOT) operator, a generative neural operator that predicts divergence‑free velocity fields for incompressible density transport. VIOT combines a stream‑function representation, a regularized transport objective, and a Fourier Neural Operator backbone to amortize the solve across new source‑target pairs and grid resolutions. Experiments on 2D and 3D benchmarks show that VIOT produces full transport trajectories in seconds, achieving roughly a $10^4 imes$ speedup over per‑instance baselines that require hours of optimization.
arXiv:2607. 12616v1 Announce Type: new Abstract: Continuous-time generative frameworks construct probability paths between base and target domains by optimizing time-dependent velocity fields.
Continuous-time generative frameworks construct probability paths between base and target domains by optimizing time-dependent velocity fields. While theoretical targets favor straight trajectories, empirical networks develop complex path deformations.