Surrogate-based quantification of policy uncertainty in generative flow networks
Ramón Nartallo-Kaluarachchi, Robert Manson-Sawko, Shashanka Ubaru, Dongsung Huh, Małgorzata J Zimoń, Lior Horesh, Yoshua Bengio
TL;DR
This paper tackles epistemic uncertainty in Generative Flow Networks (GFNs) arising when rewards are estimated from noisy data. It introduces a surrogate modeling framework based on Polynomial Chaos Expansions (PCE) trained on a small ensemble of GFNs to map low-dimensional reward representations to per-step policy distributions, enabling inexpensive Monte Carlo estimation of policy uncertainty along trajectories. The authors validate the approach across discrete and continuous grid-worlds, symbolic regression with additive noise, and Bayesian structure learning, showing the surrogate captures complex distributions (including bimodality) and agrees with empirical ensembles. This uncertainty-quantification framework enables uncertainty-aware generation with GFNs and holds promise for applications such as molecular design and causal-graph structure learning, while providing interpretable sensitivity analyses via Sobol indices.
Abstract
Generative flow networks are able to sample, via sequential construction, high-reward, complex objects according to a reward function. However, such reward functions are often estimated approximately from noisy data, leading to epistemic uncertainty in the learnt policy. We present an approach to quantify this uncertainty by constructing a surrogate model composed of a polynomial chaos expansion, fit on a small ensemble of trained flow networks. This model learns the relationship between reward functions, parametrised in a low-dimensional space, and the probability distributions over actions at each step along a trajectory of the flow network. The surrogate model can then be used for inexpensive Monte Carlo sampling to estimate the uncertainty in the policy given uncertain rewards. We illustrate the performance of our approach on a discrete and continuous grid-world, symbolic regression, and a Bayesian structure learning task.
