arXiv Machine Learning By Tiago da Silva, Diego Mesquita, Salem Lahlou

Particle GFlowNets: Rethinking Generative Marginalization Models

Read the original on arXiv Machine Learning →

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.

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
Aug 31

Joint Bayesian Inference of Graphical Structure and Parameters with a Single Generative Flow Network

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 Machine Learning
Oct 16

Conditional Mean Flows: Few-Step Densities for Simulation-Based Inference

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