paper-with-me

홈 › Papers

Better Training of GFlowNets with Local Credit and Incomplete Trajectories

2023-02-03 · Ling Pan, Nikolay Malkin, Dinghuai Zhang, Yoshua Bengio

Generative Flow Networks or GFlowNets are related to Monte-Carlo Markov chain methods (as they sample from a distribution specified by an energy function), reinforcement learning (as they learn a policy to sample composed objects through a sequence of steps), generative models (as they learn to represent and sample from a distribution) and amortized variational methods (as they can be used to learn to approximate and sample from an otherwise intractable posterior, given a prior and a likelihood). They are trained to generate an object $x$ through a sequence of steps with probability proportional to some reward function $R(x)$ (or $\exp(-\mathcal{E}(x))$ with $\mathcal{E}(x)$ denoting the energy function), given at the end of the generative trajectory. Like for other RL settings where the reward is only given at the end, the efficiency of training and credit assignment may suffer when those trajectories are longer. With previous GFlowNet work, no learning was possible from incomplete trajectories (lacking a terminal state and the computation of the associated reward). In this paper, we consider the case where the energy function can be applied not just to terminal states but also to intermediate states. This is for example achieved when the energy function is additive, with terms available along the trajectory. We show how to reparameterize the GFlowNet state flow function to take advantage of the partial reward already accrued at each state. This enables a training objective that can be applied to update parameters even with incomplete trajectories. Even when complete trajectories are available, being able to obtain more localized credit and gradients is found to speed up training convergence, as demonstrated across many simulations.

📄 PDF Abstract BibTeX arXiv:2302.01687

Code (2)

ling-pan/fl-gfn 공식 구현 pytorch
tristandeleu/gfn-maxent-rl jax

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

Trajectory balance: Improved credit assignment in GFlowNets

2022-01-31 · Nikolay Malkin, Moksh Jain, Emmanuel Bengio, Chen Sun 외

Generative flow networks (GFlowNets) are a method for learning a stochastic policy for generating compositional objects, such as graphs or strings, from a given unnormalized density by sequences of actions, where many po…

Diversity

Learning Energy Decompositions for Partial Inference of GFlowNets

2023-10-05 · Hyosoon Jang, Minsu Kim, Sungsoo Ahn

This paper studies generative flow networks (GFlowNets) to sample objects from the Boltzmann energy distribution via a sequence of actions. In particular, we focus on improving GFlowNet with partial inference: training f…

Global-Order GFlowNets

2025-04-03 · Lluís Pastor-Pérez, Javier Alonso-Garcia, Lukas Mauch

Order-Preserving (OP) GFlowNets have demonstrated remarkable success in tackling complex multi-objective (MOO) black-box optimization problems using stochastic optimization techniques. Specifically, they can be trained o…

Stochastic Optimization

Let the Flows Tell: Solving Graph Combinatorial Problems with GFlowNets

2023-09-21

Combinatorial optimization (CO) problems are often NP-hard and thus out of reach for exact algorithms, making them a tempting domain to apply machine learning methods. The highly structured constraints in these problems …

Combinatorial Optimization

Let the Flows Tell: Solving Graph Combinatorial Problems with GFlowNets

2023-09-21 · NeurIPS 2023 11

Combinatorial optimization (CO) problems are often NP-hard and thus out of reach for exact algorithms, making them a tempting domain to apply machine learning methods. The highly structured constraints in these problems …

Combinatorial Optimization