arXiv:2604. 24196v3 Announce Type: replace-cross Abstract: This paper studies the identifiability and stability of drifting fields in the framework of Generative Modeling via Drifting.
arXiv:2604. 24196v4 Announce Type: replace-cross Abstract: A drifting model is a one-step generator trained by moving each sample along a field of kernel-weighted attraction toward data samples and repulsion between model samples; training halts once this field vanishes.
arXiv:2608. 01547v1 Announce Type: cross Abstract: Drifting objectives compare a target and model distribution through a vector field observed noisily at finitely many locations.
arXiv:2605.22795v3 Announce Type: replace-cross Abstract: We analyze finite-particle drifting models for one-step generative modeling. For a conservative velocity given by the difference of the kerne...
arXiv:2608. 01268v1 Announce Type: cross Abstract: Detecting that a stream of high-dimensional embeddings has changed is usually framed as a choice of statistic.
arXiv:2603. 15384v2 Announce Type: replace-cross Abstract: We improve and extend persistence spheres, introduced in~\cite{pegoraro2025persistence}.
arXiv:2607. 24662v1 Announce Type: new Abstract: Generative models of temporal graphs are trained on one stretch of an evolving network and deployed on the next, and they degrade badly in the gap.
arXiv:2310. 09149v3 Announce Type: replace-cross Abstract: We study the approximation of probability measures in the Wasserstein-$p$ distance by structured classes of approximators, motivated by applications in imaging, machine learning, and physical measurement under sensor constraints.
Generative models of temporal graphs are trained on one stretch of an evolving network and deployed on the next, and they degrade badly in the gap. We show this degradation is derivable, general, and not fixable from observations.
arXiv:2410. 01244v2 Announce Type: replace-cross Abstract: We introduce a novel Wasserstein-1 ($W_1$) path-space divergence for stochastic and deterministic dynamics and establish a Wasserstein Uncertainty Propagation (WUP) theorem that bounds the $W_1$ distance between terminal distributions by the proposed divergence, equivalently characterized by a weighted $L^2$ discrepancy between the underlying drifts and the $W_1$ distance between their initial measures.
arXiv:2609.15048v1 Announce Type: cross Abstract: Let $Y_s=\sqrt{s}X+Z$, where $Z$ is standard Gaussian and independent of the real random variable $X$. We prove that, under the square-exponential mo...
arXiv:2606. 18778v1 Announce Type: new Abstract: Online learning in non-stationary streams is often formulated as tracking a point estimate, but many applications require predicting the full data-generating distribution.
arXiv:2609.23163v1 Announce Type: cross Abstract: Comparing probability measures in machine learning trades transport geometry against computational cost: Wasserstein distances encode the geometry of...