arXiv Machine Learning By Stanislas Strasman, Gabriel Cardoso, Sylvain Le Corff, Vincent Lemaire, Antonio Ocello

On Forgetting and Stability of Score-based Generative models

Read the original on arXiv Machine Learning →

arXiv:2601. 21868v2 Announce Type: replace-cross Abstract: Understanding the stability and long-time behavior of generative models is a fundamental problem in modern machine learning.

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 7

Non-Asymptotic Error Bounds for SMC with Biased Proposals: Application to Conditional Diffusion Sampling

arXiv:2607. 04780v1 Announce Type: cross Abstract: Sequential Monte Carlo (SMC) methods are a natural tool for post-hoc conditioning of pretrained generative models, but in many applications the mutation kernels used by the particle system are biased approximations of an ideal Feynman--Kac flow.

By Stanislas Strasman (SU, LPSM), Gabriel Victorino Cardoso (LPSM), Sylvain Le Corff (LPSM), Vincent Lemaire (LPSM), Antonio Ocello
arXiv AI
Jun 17

Volterra Generative Models

arXiv:2606. 18071v1 Announce Type: cross Abstract: Score-based diffusion models typically use Brownian perturbations, which provide tractable reverse-time dynamics but impose memoryless noising.

By Yusen Jia, Bingyan Han
arXiv Machine Learning
Sep 11

Particle GFlowNets: Rethinking Generative Marginalization Models

The paper introduces Particle GFlowNets, showing that Generative Marginalization Models (MaMs) are equivalent to Generative Flow Networks. It extends MaMs to non‑autoregressive sampling and proposes an automatic full‑state rejuvenation criterion based on the Gelman‑Rubin statistic to accelerate learning. Experiments demonstrate significant training speedups in large combinatorial spaces.

By Tiago da Silva, Diego Mesquita, Salem Lahlou