Journal article icon

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 ran...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.5802/ahl.74

Authors


More by this author
Division:
MPLS
Department:
Computer Science
Role:
Author
Publisher:
ENS Rennes Publisher's website
Journal:
Annales Henri Lebesgue Journal website
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


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP