arXiv Statistics ML

Memory-Conditioned Diffusion Model for Generalized Langevin Dynamics

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
Hugging Face Trending Papers
Aug 6

LC-GRPO: Bridging Train-Inference Gap for Flow-Based GRPO with Langevin Correction

Flow-based generative models are typically sampled by solving a deterministic ordinary differential equation (ODE), whereas online reinforcement learning requires stochastic rollouts for policy exploration and optimization. Existing GRPO methods for flow models therefore replace the inference-time ODE with a stochastic differential equation (SDE) during training.

arXiv AI
Aug 28

The Principles of Diffusion Models

The book "The Principles of Diffusion Models" outlines the foundational concepts behind diffusion models, tracing their evolution from a forward process that corrupts data into noise to a reverse process that reconstructs data. It presents three complementary perspectives—variational, score-based, and flow-based—each describing how a time-dependent velocity field transports a simple prior to the data distribution. The text also covers practical guidance for controllable generation, efficient solvers, and diffusion-inspired flow-map models, providing a mathematically grounded framework for readers with basic deep‑learning knowledge.

By Chieh-Hsin Lai, Yang Song, Dongjun Kim, Yuki Mitsufuji, Stefano Ermon
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