GFlowNet Foundations
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2021
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909999225110528 |
|---|---|
| author | Bengio, Yoshua Lahlou, Salem Deleu, Tristan Hu, Edward J. Tiwari, Mo Bengio, Emmanuel |
| author_facet | Bengio, Yoshua Lahlou, Salem Deleu, Tristan Hu, Edward J. Tiwari, Mo Bengio, Emmanuel |
| contents | Generative Flow Networks (GFlowNets) have been introduced as a method to sample a diverse set of candidates in an active learning context, with a training objective that makes them approximately sample in proportion to a given reward function. In this paper, we show a number of additional theoretical properties of GFlowNets. They can be used to estimate joint probability distributions and the corresponding marginal distributions where some variables are unspecified and, of particular interest, can represent distributions over composite objects like sets and graphs. GFlowNets amortize the work typically done by computationally expensive MCMC methods in a single but trained generative pass. They could also be used to estimate partition functions and free energies, conditional probabilities of supersets (supergraphs) given a subset (subgraph), as well as marginal distributions over all supersets (supergraphs) of a given set (graph). We introduce variations enabling the estimation of entropy and mutual information, sampling from a Pareto frontier, connections to reward-maximizing policies, and extensions to stochastic environments, continuous actions and modular energy functions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2111_09266 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | GFlowNet Foundations Bengio, Yoshua Lahlou, Salem Deleu, Tristan Hu, Edward J. Tiwari, Mo Bengio, Emmanuel Machine Learning Artificial Intelligence Generative Flow Networks (GFlowNets) have been introduced as a method to sample a diverse set of candidates in an active learning context, with a training objective that makes them approximately sample in proportion to a given reward function. In this paper, we show a number of additional theoretical properties of GFlowNets. They can be used to estimate joint probability distributions and the corresponding marginal distributions where some variables are unspecified and, of particular interest, can represent distributions over composite objects like sets and graphs. GFlowNets amortize the work typically done by computationally expensive MCMC methods in a single but trained generative pass. They could also be used to estimate partition functions and free energies, conditional probabilities of supersets (supergraphs) given a subset (subgraph), as well as marginal distributions over all supersets (supergraphs) of a given set (graph). We introduce variations enabling the estimation of entropy and mutual information, sampling from a Pareto frontier, connections to reward-maximizing policies, and extensions to stochastic environments, continuous actions and modular energy functions. |
| title | GFlowNet Foundations |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2111.09266 |