Stable GFlowNets with TV Monitoring and Probabilistic Guarantees
arXiv:2605. 01729v2 Announce Type: replace Abstract: Generative Flow Networks (GFlowNets) learn to sample states proportional to an unnormalized reward.
arXiv:2408. 05885v3 Announce Type: replace Abstract: Generative Flow Networks (GFlowNets) have been shown effective to generate combinatorial objects with desired properties.
arXiv:2605. 01729v2 Announce Type: replace Abstract: Generative Flow Networks (GFlowNets) learn to sample states proportional to an unnormalized reward.
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.
The paper introduces a new learning objective called trajectory balance for Generative Flow Networks (GFlowNets), aiming to improve credit assignment across long action sequences. It demonstrates that minimizing this objective yields a policy that samples exactly from the target distribution. Experiments on four domains show that trajectory balance enhances convergence, sample diversity, and robustness to long sequences and large action spaces.
arXiv:2602. 21565v3 Announce Type: replace Abstract: Generative Flow Networks (GFlowNets) learn to sample diverse candidates in proportion to a reward function, making them well-suited for scientific discovery, where exploring multiple promising solutions is crucial.
arXiv:2607. 13394v1 Announce Type: cross Abstract: Generative Flow Networks (GFlowNets) offer a promising alternative to reward-maximizing reinforcement learning (RL) for large reasoning models, encouraging diverse reasoning paths by matching reward distributions rather than collapsing to dominant modes.
arXiv:2606. 06272v1 Announce Type: new Abstract: Generative Flow Networks (GFlowNets) are a framework for sampling structured objects via stochastic trajectories in a directed graph.
The paper introduces Partial GFlowNet, a method that partitions a large state space into overlapping partial state spaces to accelerate convergence of Generative Flow Networks. By restricting the actor’s exploration to these smaller regions and using a heuristic to switch between them, the approach enables efficient identification of high‑reward subregions. Experiments on popular datasets show that Partial GFlowNet converges faster, produces higher‑reward candidates, and improves diversity compared to existing methods.
arXiv:2606. 24679v1 Announce Type: cross Abstract: Data preparation pipelines improve data quality in machine learning by transforming raw tables into learning-ready data through sequential cleaning and feature transformation operators.
arXiv:2604. 14698v2 Announce Type: replace Abstract: Diffusion models have recently emerged as expressive policy representations for online reinforcement learning (RL).
arXiv:2107. 08183v2 Announce Type: replace Abstract: High-dimensional state and action spaces combined with sparse reward structures in reinforcement learning (RL) environments typically require advanced control architectures.
arXiv:2608. 03967v1 Announce Type: cross Abstract: Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density specified through a reward.
The paper introduces Wasserstein‑Tilted Flow Maps (WTF), a simulation‑free reinforcement learning method that fine‑tunes pre‑trained flow‑based generative models by adding an optimal transport regularizer derived from the model’s drift. Unlike traditional KL‑reward tilting, WTF transports individual samples toward higher reward, framing the problem as a deterministic optimal control task on the flow map. Experiments on ImageNet‑256 and text‑to‑image demonstrate that WTF achieves higher reward and comparable or better diversity while reducing training compute by up to 280×.