The paper introduces JSP-GFN, a Generative Flow Network that jointly infers the structure and parameters of a Bayesian Network. It sequentially generates a directed acyclic graph edge by edge and then samples the corresponding conditional probability parameters once the full structure is known. Experiments on simulated and real data show that JSP‑GFN accurately approximates the joint posterior and outperforms existing methods.
By Tristan Deleu, Mizu Nishikawa-Toomey, Jithendaraa Subramanian, Esmeralda S. Whitammer, Laurent Charlin, Yoshua Bengio
arXiv:2310.04363v3 Announce Type: replace
Abstract: Autoregressive large language models (LLMs) compress knowledge from their training data through next-token conditional distributions. This limits t...
By Edward J. Hu, Moksh Jain, Eric Elmoznino, Younesse Kaddar, Guillaume Lajoie, Yoshua Bengio, Esmeralda S. Whitammer
arXiv:2503. 07154v3 Announce Type: replace-cross Abstract: Generative pre-training is often framed through a false dichotomy between autoregressive models for discrete signals and diffusion models for continuous signals.
By Jiaming Song, Linqi Zhou
arXiv:2606. 16073v1 Announce Type: new Abstract: Sampling from complex, unnormalized probability densities is a fundamental challenge in Bayesian inference and probabilistic modeling.
By Kirill Korolev, Nikita Morozov, Stepan Pavlenko, Esmeralda S. Whitammer, Sergey Samsonov
Conditional Mean Flows introduce a new approach for simulation-based inference that replaces the costly numerical integration of traditional flow matching with few-step sampling and tractable density evaluation. By identifying conditional flow maps through a mean flow objective and using independent masking, the method allows direct estimation of marginal likelihoods. Experiments demonstrate that single-step conditional mean flow density evaluation achieves error comparable to 200-step flow matching while accelerating downstream MCMC sampling by roughly 200‑fold.
By Jonas Arruda, Jan Hasenauer, Stefan T. Radev
arXiv:2502. 07580v4 Announce Type: replace Abstract: We present a novel view of diffusion-like generative modeling from the perspective of iterative Gaussian posterior inference.
By Marten Lienen, Marcel Kollovieh, Stephan G\"unnemann
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:2310.02423v3 Announce Type: replace
Abstract: We present a new algorithm for amortized inference in sparse probabilistic graphical models (PGMs), which we call $\Delta$-amortized inference ($\D...
By Jean-Pierre Falet, Hae Beom Lee, Esmeralda S. Whitammer, Chen Sun, Dragos Secrieru, Thomas Jiralerspong, Dinghuai Zhang, Guillaume Lajoie, Yoshua Bengio
arXiv:2606. 15793v1 Announce Type: cross Abstract: This paper explores policy gradient algorithms for training stochastic policies to sample from structured discrete probability distributions under the Generative Flow Network (GFlowNet) framework.
By Anna Zykova-Myzina, Timofei Gritsaev, Daniil Tiapkin, Nikita Morozov
arXiv:2609.37227v1 Announce Type: new
Abstract: Inference-time steering adapts pretrained diffusion and flow-based models to new tasks, e.g., to generate samples from a conditional distribution or sa...
By Adhithyan Kalaivanan, Zheng Zhao, Jens Sj\"olund, Fredrik Lindsten
The paper introduces MM‑SOLD, a training‑free sampling method that uses moment‑matched score‑smoothed overdamped Langevin dynamics to generate samples without training a neural diffusion model. It enforces target moments during sampling, proving convergence to a Gibbs–Boltzmann density that matches the mean and covariance of a training Gaussian mixture model, even for rank‑deficient data. Experiments demonstrate fast, robust latent‑space image generation on CPUs with fidelity and diversity comparable to neural diffusion baselines.
By Zhenyu Yao, Daniel Paulin
arXiv:2610.22763v1 Announce Type: new
Abstract: Bayesian optimization (BO) over discrete spaces is challenging due to missing gradients and the sparsity of valid solutions. Latent-space BO sidesteps...
By Tommaso Ancilli, Thomas Wedenig, Henry Moss, Robert Peharz