Characterizing and Identifying Separable Graphical Models
We study a broad class of graphical models whose independencies correspond to vertex separation in mixed graphs with directed, undirected, and bidirected edges, that are capable of encoding independence structures arising from feedback, latent and selection mechanisms. In particular, we introduce separable graphs, in which each missing edge implies the existence of a separating set for its endpoints, and essentially separable graphs, those graphs separation equivalent to a separable graph. We show that these models include many existing graph families used to define graphical models an provide several characterizations of separable graphs and essentially separable graphs. We also provide multiple characterizations of separation equivalence for separable graphs. One is a graphical characterization in terms of ordinary graph properties, extending earlier results for specific subfamilies Another is a separational characterization depending only on graph separation properties. Finally, we provide a canonical representation for the equivalence classes of essentially separable graphs and develop an algorithm that, under suitable assumptions, identifies the equivalence class of any essentially separable graph.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Scalable Gaussian Processes for Characterizing Multidimensional Change Surfaces
We present a scalable Gaussian process model for identifying and characterizing smooth multidimensional changepoints, and automatically learning changes in expressive covariance structure. We use Random Kitchen Sink feat…
Gaussian ProcessesGraphical Models for Recovering Probabilistic and Causal Queries from Missing Data
We address the problem of deciding whether a causal or probabilistic query is estimable from data corrupted by missing entries, given a model of missingness process. We extend the results of Mohan et al, 2013 by presenti…
FormCharacterizing Distribution Equivalence and Structure Learning for Cyclic and Acyclic Directed Graphs
The main approach to defining equivalence among acyclic directed causal graphical models is based on the conditional independence relationships in the distributions that the causal models can generate, in terms of the Ma…
Identifying Conduct Parameters with Separable Demand: A Counterexample to Lau (1982)
We provide a counterexample to the conduct parameter identification result established in the foundational work of Lau (1982), which generalizes the identification theorem of Bresnahan (1982) by relaxing the linearity as…
One-Class Semi-Supervised Learning: Detecting Linearly Separable Class by its Mean
In this paper, we presented a novel semi-supervised one-class classification algorithm which assumes that class is linearly separable from other elements. We proved theoretically that class is linearly separable if and o…
General ClassificationOne-Class Classification