Journal article
A generalization of hierarchical exchangeability on trees to directed acyclic graphs
- Abstract:
- Motivated by the problem of designing inference-friendly Bayesian nonparametric models in probabilistic programming languages, we introduce a general class of partially exchangeable random arrays which generalizes the notion of hierarchical exchangeability introduced in Austin and Panchenko (2014). We say that our partially exchangeable arrays are DAG-exchangeable since their partially exchangeable structure is governed by a collection of Directed Acyclic Graphs. More specifically, such a random array is indexed by ℕ|𝑉| for some DAG 𝐺=(𝑉,𝐸), and its exchangeability structure is governed by the edge set 𝐸. We prove a representation theorem for such arrays which generalizes the Aldous-Hoover and Austin–Panchenko representation theorems.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, 844.6KB, Terms of use)
-
- Publisher copy:
- 10.5802/ahl.74
Authors
- Publisher:
- ENS Rennes
- Journal:
- Annales Henri Lebesgue More from this journal
- Volume:
- 4
- Pages:
- 325-368
- Publication date:
- 2021-01-18
- Acceptance date:
- 2020-04-15
- DOI:
- EISSN:
-
2644-9463
- Language:
-
English
- Keywords:
- Pubs id:
-
1102319
- Local pid:
-
pubs:1102319
- Deposit date:
-
2020-04-29
Terms of use
- Copyright holder:
- Jung et al
- Copyright date:
- 2020
- Rights statement:
- Published under license CC BY 4.0.
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record