In cyclic discrete environments, GFlowNet flows are expected visit counts, and training a non-acyclic GFlowNet with the smallest expected trajectory length is equivalent to minimizing total flow.
Advanced Combinatorics: The Art of Finite and Infinite Expansions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
ACCEPT 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Revisiting Non-Acyclic GFlowNets in Discrete Environments
In cyclic discrete environments, GFlowNet flows are expected visit counts, and training a non-acyclic GFlowNet with the smallest expected trajectory length is equivalent to minimizing total flow.