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.
The paper presents a theoretical framework linking balance objectives in Generative Flow Networks (GFlowNets) to sampling accuracy. It establishes bounds on terminal symmetric KL divergence in terms of expected balance loss and shows how approximate stationarity controls distribution error, accounting for parameterization incompleteness. The authors prove finite‑time convergence rates under various sampling and backward‑policy regimes, clarifying the roles of coverage, parameterization, and moving components in GFlowNet training.
arXiv:2605. 01729v2 Announce Type: replace Abstract: Generative Flow Networks (GFlowNets) learn to sample states proportional to an unnormalized reward.
The paper studies generative flows that sample from an unnormalized target by training a flow to satisfy a balance condition. It shows that the training loss can certify sampler accuracy, can be driven to zero, and quantifies how fast gradient descent converges, with explicit bounds depending on the backward policy and graph structure. The authors provide theoretical guarantees, test them on finite graphs, and certify each theorem using a Lean 4 development.
arXiv:2408. 05885v3 Announce Type: replace Abstract: Generative Flow Networks (GFlowNets) have been shown effective to generate combinatorial objects with desired properties.
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:2606. 06272v1 Announce Type: new Abstract: Generative Flow Networks (GFlowNets) are a framework for sampling structured objects via stochastic trajectories in a directed graph.
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.
arXiv:2410. 02596v2 Announce Type: replace-cross Abstract: Generative Flow Networks (GFlowNets) are a novel class of generative models designed to sample from unnormalized distributions and have found applications in various important tasks, attracting great research interest in their training algorithms.
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.
arXiv:2606. 16073v1 Announce Type: new Abstract: Sampling from complex, unnormalized probability densities is a fundamental challenge in Bayesian inference and probabilistic modeling.
arXiv:2610.07562v1 Announce Type: cross Abstract: Learning an ensemble of GFlowNets to sample from a discrete target distribution has become a common approach for achieving better state space explora...
arXiv:2601. 22495v2 Announce Type: replace Abstract: Fine-tuning flow matching models is a central challenge in settings with limited data, evolving distributions, or computational constraints.
The paper examines the common practice in diffusion and flow matching of predicting the clean signal, converting it to a velocity, and training with a velocity-space loss. It shows that this conversion can cause unstable optimization due to singular endpoint amplification, but that prediction–loss alignment removes this source of non‑integrability and ensures a finite second moment for all timesteps, even with uniform sampling. Experiments confirm that aligned objectives remain trainable across different samplers, reconciling theoretical concerns with empirical success.