arXiv:2607. 01746v1 Announce Type: new Abstract: Recurrent representations are trajectories, but representation geometry is often measured from static snapshots.
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.
The paper introduces FREESIA, a training‑free, covariance‑aware posterior transport method for data assimilation that embeds forecast cross‑covariance into a flow‑based transport to recover unobserved states while preserving non‑Gaussian posterior structure. It combines an observation‑adaptive proposal with posterior correction, providing an asymptotically exact approximation of nonlinear posteriors and a Wasserstein error bound. Experiments on Double‑Well, Lorenz‑96, and Kolmogorov flow demonstrate that FREESIA captures complex posterior structures and achieves up to a 56% reduction in RMSE compared to the best baseline in sparse, nonlinear, non‑injective observation scenarios.
Kalman Delta Networks (KDNs) extend linear attention models by treating associative memory as a linear–Gaussian state‑space system, enabling the Kalman filter to optimally estimate both memory state and its uncertainty. Two GPU‑friendly approximations—Diagonal KDN and Isotropic KDN—use mean‑field variational inference or a single scalar uncertainty per head, respectively, to maintain tractable uncertainty recurrences during linear‑attention scans. Experiments on 750 M and 1.3 B‑parameter models show that KDN variants consistently lower perplexity and raise downstream accuracy compared to existing linear‑attention baselines.
arXiv:2607. 03349v1 Announce Type: cross Abstract: The accuracy of consumer-grade inertial navigation is bottlenecked by the stochastic noise of Micro-Electro-Mechanical Systems (MEMS).
arXiv:2608. 04531v1 Announce Type: new Abstract: Functional flow matching is posed on distributions of functions but implemented from finitely many coefficients or point values.
arXiv:2605. 01107v2 Announce Type: replace Abstract: Feedforward neural networks transform data through learned representations whose geometry shapes how classes separate and relate across successive layers.
arXiv:2610.01408v1 Announce Type: new Abstract: Trajectory crossing remains a critical bottleneck in Flow Matching (FM), and previous works typically view these crossings from a theoretical optimizat...