about
Generative Flow Networks: Theory and Applications to Structure Learning (arxiv.org)
2 points by lnyan on Jan 14, 2025 | hide | past | pdf | discuss on HN

In plain words: A new kind of model builds graphs piece by piece, letting it sample from a distribution of possible answers even when their overall scale is unknown. It keeps many plausible causal graphs at once instead of committing to one, using observational and experimental data.

Abstract

Without any assumptions about data generation, multiple causal models may explain our observations equally well. To avoid selecting a single arbitrary model that could result in unsafe decisions if it does not match reality, it is therefore essential to maintain a notion of epistemic uncertainty about our possible candidates. This thesis studies the problem of structure learning from a Bayesian perspective, approximating the posterior distribution over the structure of a causal model, represented as a directed acyclic graph (DAG), given data. It introduces Generative Flow Networks (GFlowNets), a novel class of probabilistic models designed for modeling distributions over discrete and compositional objects such as graphs. They treat generation as a sequential decision making problem, constructing samples of a target distribution defined up to a normalization constant piece by piece. In the first part of this thesis, we present the mathematical foundations of GFlowNets, their connections to existing domains of machine learning and statistics such as variational inference and reinforcement learning, and their extensions beyond discrete problems. In the second part of this thesis, we show how GFlowNets can approximate the posterior distribution over DAG structures of causal Bayesian Networks, along with the parameters of its causal mechanisms, given observational and experimental data.

Tristan Deleu
arXiv:2501.05498 · cs.LG · submitted Jan 9, 2025
abstract · pdf · html

add comment on HN