• Corpus ID: 225103125

Staged trees are curved exponential families.

  title={Staged trees are curved exponential families.},
  author={Christiane G{\"o}rgen and Manuele Leonelli and Orlando Marigliano},
  journal={arXiv: Statistics Theory},
Staged tree models are a discrete generalization of Bayesian networks. We show that these form curved exponential families and derive their natural parameters, sufficient statistic, and cumulant-generating function as functions of their graphical representation. We give necessary graphical criteria for classifying regular subfamilies and discuss implications for model selection. 
1 Citations

Figures from this paper

Representation of Context-Specific Causal Models with Observational and Interventional Data
It is shown that the context-specific information encoded by a CStree can be equivalently expressed via a collection of DAGs, and a global Markov property for CStrees is obtained which leads to a graphical criterion of model equivalence for C Strees generalizing that of Verma and Pearl for DAG models.


Equivalence classes of staged trees
A complete characterization of the statistical equivalence classes of CEGs and of staged trees is given and it is shown that all graphical representations of the same model share a common polynomial description.
On the toric algebra of graphical models
We formulate necessary and sufficient conditions for an arbitrary discrete probability distribution to factor according to an undirected graphical model, or a log-linear model, or other more general
Stratified exponential families: Graphical models and model selection
This work describes a hierarchy of exponential families which is useful for distinguishing types of graphical models and shows how to compute the dimension of a stratified exponential family.
Equations defining probability tree models
Causal discovery through MAP selection of stratified chain event graphs
A dynamic programming algorithm is presented for the optimal selection of such chain event graphs that maximizes a decomposable score derived from a complete independent sample and it is shown that the algorithm is suitable for small problems.
A New Family of Non-Local Priors for Chain Event Graph Model Selection
Three different types of NLP are defined and explored that are customised to search CEG spaces and it is demonstrated how one of these candidate NLPs provides a framework for search which is both robust and computationally efficient.
A Dynamic Programming Algorithm for Learning Chain Event Graphs
This paper describes a dynamic programming algorithm for exact learning of chain event graphs from multivariate data that allows reasonably fast approximations and provides clues for implementing more scalable heuristic algorithms.
Geometrical Foundations of Asymptotic Inference
Overview and Preliminaries. ONE-PARAMETER CURVED EXPONENTIAL FAMILIES. First-Order Asymptotics. Second-Order Asymptotics. MULTIPARAMETER CURVED EXPONENTIAL FAMILIES. Extensions of Results from the