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ń +2 more
10/24/2025
cs.LGstat.ML

No confident code implementation found for this paper. 2 possible matches can be shown below.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{nartallokaluarachchi2025surrogatebased,
  title  = {Surrogate-based quantification of policy uncertainty in generative flow networks},
  author = {Ramón Nartallo-Kaluarachchi and Robert Manson-Sawko and Shashanka Ubaru and Dongsung Huh and Małgorzata J Zimoń and Lior Horesh and Yoshua Bengio},
  year   = {2025},
  eprint = {2510.21523},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.21523v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2510.21523.svg)](https://codeofpaper.com/paper/2510.21523)

Discussion