Set Of Conditional Independencies Research Articles

Structural learning and estimation of joint causal effects among network-dependent variables

Bayesian networks in the form of Directed Acyclic Graphs (DAGs) represent an effective tool for modeling and inferring dependence relations among variables, a process known as structural learning. In addition, when equipped with the notion of intervention, a causal DAG model can be adopted to quantify the causal effect on a response due to a hypothetical intervention on some variable. Observational data cannot distinguish between DAGs encoding the same set of conditional independencies (Markov equivalent DAGs), which however can be different from a causal perspective. In addition, because causal effects depend on the underlying network structure, uncertainty around the DAG generating model crucially affects the causal estimation results. We propose a Bayesian methodology which combines structural learning of Gaussian DAG models and inference of causal effects as arising from simultaneous interventions on any given set of variables in the system. Our approach fully accounts for the uncertainty around both the network structure and causal relationships through a joint posterior distribution over DAGs, DAG parameters and then causal effects.

Exploiting Experts' Knowledge for Structure Learning of Bayesian Networks.

Learning Bayesian network structures from data is known to be hard, mainly because the number of candidate graphs is super-exponential in the number of variables. Furthermore, using observational data alone, the true causal graph is not discernible from other graphs that model the same set of conditional independencies. In this paper, it is investigated whether Bayesian network structure learning can be improved by exploiting the opinions of multiple domain experts regarding cause-effect relationships. In practice, experts have different individual probabilities of correctly labeling the inclusion or exclusion of edges in the structure. The accuracy of each expert is modeled by three parameters. Two new scoring functions are introduced that score each candidate graph based on the data and experts' opinions, taking into account their accuracy parameters. In the first scoring function, the experts' accuracies are estimated using an expectation-maximization-based algorithm and the estimated accuracies are explicitly used in the scoring process. The second function marginalizes out the accuracy parameters to obtain more robust scores when it is not possible to obtain a good estimate of experts' accuracies. The experimental results on simulated and real world datasets show that exploiting experts' knowledge can improve the structure learning if we take the experts' accuracies into account.

Marginal parameterizations of discrete models defined by a set of conditional independencies

It is well-known that a conditional independence statement for discrete variables is equivalent to constraining to zero a suitable set of log–linear interactions. In this paper we show that this is also equivalent to zero constraints on suitable sets of marginal log–linear interactions, that can be formulated within a class of smooth marginal log–linear models. This result allows much more flexibility than known until now in combining several conditional independencies into a smooth marginal model. This result is the basis for a procedure that can search for such a marginal parameterization, so that, if one exists, the model is smooth.

Empirical Implications of Information Structure in Finite Extensive Form Games

We analyze what can be inferred about a game's information structure solely from the probability distributions on action profiles generated during play; i.e., without reference to special behavioral assumptions or equilibrium concepts. Our analysis focuses on deriving payoff-independent conditions that must be met for one game form to be empirically distinguished from another. We define empirical equivalence and independence equivalence. The first describes when two game forms can never be distinguished based solely on the empirical distribution of player actions. As this turns out to be difficult to characterize, we introduce the latter, which describes two game forms that imply the same minimal sets of conditional independencies in every one of their empirical distributions. Our main contribution is to identify, for an arbitrary game form, the minimal set of conditional independencies that must arise in every one of its empirical distributions. We also introduce a new graphical device, the influence opportunity diagram of a game form which facilitates verifying independence equivalence, and hence provides a simple necessary condition for empirical equivalence.

10.1162/153244304773936045

Two or more Bayesian network structures are Markov equivalent when the corresponding acyclic digraphs encode the same set of conditional independencies. Therefore, the search space of Bayesian network structures may be organized in equivalence classes, where each of them represents a different set of conditional independencies. The collection of sets of conditional independencies obeys a partial order, the so-called order. This paper discusses in depth the role that the inclusion order plays in learning the structure of Bayesian networks. In particular, this role involves the way a learning algorithm traverses the search space. We introduce a condition for traversal operators, the inclusion boundary condition, which, when it is satisfied, guarantees that the search strategy can avoid local maxima. This is proved under the assumptions that the data is sampled from a probability distribution which is faithful to an acyclic digraph, and the length of the sample is unbounded. The previous discussion leads to the design of a new traversal operator and two new learning algorithms in the context of heuristic search and the Markov Chain Monte Carlo method. We carry out a set of experiments with synthetic and real-world data that show empirically the benefit of striving for the inclusion order when learning Bayesian networks from data.