On Generalization for Generative Flow Networks
<|reference_start|>On Generalization for Generative Flow Networks: Generative Flow Networks (GFlowNets) have emerged as an innovative learning paradigm designed to address the challenge of sampling from an unnormalized probability distribution, called the reward function. This framework learns a policy on a constructed graph, which enables sampling from an approximation of the target probability distribution through successive steps of sampling from the learned policy. To achieve this, GFlowNets can be trained with various objectives, each of which can lead to the model s ultimate goal. The aspirational strength of GFlowNets lies in their potential to discern intricate patterns within the reward function and their capacity to generalize effectively to novel, unseen parts of the reward function. This paper attempts to formalize generalization in the context of GFlowNets, to link generalization with stability, and also to design experiments that assess the capacity of these models to uncover unseen parts of the reward function. The experiments will focus on length generalization meaning generalization to states that can be constructed only by longer trajectories than those seen in training.<|reference_end|>
@article{krichel2024on,
    title={On Generalization for Generative Flow Networks},
    author={Anas Krichel, Nikolay Malkin, Salem Lahlou, Yoshua Bengio},
    journal={arXiv preprint arXiv:2407.03105},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.03105},
    primaryClass={cs.LG}
}