Algebraic geometry of discrete interventional models

12/07/2020
by   Eliana Duarte, et al.
0

We investigate the algebra and geometry of general interventions in discrete DAG models. To this end, we develop the formalism to study these models as subvarieties of multiprojective space and introduce a theory for modeling soft interventions in the more general family of staged tree models. We then consider the problem of finding their defining equations, and we derive a combinatorial criterion for identifying interventional staged tree models for which the defining ideal is toric. This criterion, when combined with a new characterization of decomposable DAG models in terms of their associated staged trees, specializes to a graphical criterion in the case of discrete interventional DAG models.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

10/07/2019

Gröbner bases for staged trees

In this article we consider the problem of finding generators of the tor...
01/22/2021

Representation and Learning of Context-Specific Causal Models with Observational and Interventional Data

We consider the problem of representation and learning of causal models ...
05/12/2021

A new characterization of discrete decomposable models

Decomposable graphical models, also known as perfect DAG models, play a ...
06/13/2012

Identifying Optimal Sequential Decisions

We consider conditions that allow us to find an optimal strategy for seq...
02/13/2018

Equations defining probability tree models

Coloured probability tree models are statistical models coding condition...
03/15/2021

Combinatorial Resultants in the Algebraic Rigidity Matroid

Motivated by a rigidity-theoretic perspective on the Localization Proble...
01/01/2022

A new criterion for ℳ, 𝒩-adhesivity, with an application to hierarchical graphs

Adhesive categories provide an abstract framework for the algebraic appr...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.