arXiv Machine Learning By Gabriele Bocchi

Triangular-Reference Schr\"odinger Bridges for Time Series Generation

Read the original on arXiv Machine Learning →

arXiv:2605. 27478v3 Announce Type: replace-cross Abstract: Schr\"odinger bridges for time series (SBTS) generate synthetic paths by projecting, in relative entropy, a Brownian reference onto the path laws that match the joint distribution of the data on the observation grid.

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 Machine Learning
Jul 13

Solving Stochastic Fixed-Point Equations with High Probability

arXiv:2607. 09097v1 Announce Type: cross Abstract: We study stochastic fixed-point equations $\mathbf{T}(\mathbf{x}) = \mathbf{x}$ over normed spaces $(\mathcal{E}, \|\cdot\|)$, where the operator $\mathbf{T}$ is nonexpansive or contractive and is accessed only through unbiased stochastic evaluations with bounded second central moment.

By Jelena Diakonikolas
arXiv Machine Learning
Sep 1

Quantitative Target Convergence and Uniform-in-Time Propagation of Chaos for Langevin-Regularized SVGD

The paper proves quantitative convergence to the target distribution and uniform‑in‑time propagation of chaos for Langevin‑regularized Stein variational gradient descent (SVGD). It shows that both the Stein interaction and the Langevin drift dissipate the same relative entropy, yielding exponential convergence under a log‑Sobolev inequality and providing finite‑particle entropy identities for empirical measures. Two finite‑time approaches—synchronous coupling and moving‑product entropy—are developed to give explicit Wasserstein, kernel Stein discrepancy, and total variation bounds, leading to polynomial uniform‑in‑time propagation of chaos rates.

By Sayan Banerjee, Dohyeon Kim
Hugging Face Trending Papers
Jul 5

Asymptotic-Preserving A Posteriori Analysis of Diffusion and Flow-Matching Samplers

Diffusion and flow-matching samplers integrate a learned probability-flow ODE from a large noise scale down to a small terminal floor $σ_{\min}$, at which the score is stiff and the flow develops a boundary layer. We treat $σ_{\min}$ as a singular-perturbation parameter and determine which fixed-step samplers are asymptotic-preserving (AP), that is, stable and uniformly accurate as $σ_{\min}\to0$, casting the criteria as an a posteriori audit: residual functionals with $σ_{\min}$-uniform coefficients, computable on a pretrained checkpoint without ground-truth scores or exact trajectories.