Learning Minimal Latent Directed Information Polytrees
- 1 September 2016
- journal article
- Published by MIT Press in Neural Computation
- Vol. 28 (9) , 1723-1768
Abstract
We propose an approach for learning latent directed polytrees as long as there exists an appropriately defined discrepancy measure between the observed nodes. Specifically, we use our approach for learning directed information polytrees where samples are available from only a subset of processes. Directed information trees are a new type of probabilistic graphical models that represent the causal dynamics among a set of random processes in a stochastic system. We prove that the approach is consistent for learning minimal latent directed trees. We analyze the sample complexity of the learning task when the empirical estimator of mutual information is used as the discrepancy measure.Keywords
This publication has 35 references indexed in Scilit:
- A Granger Causality Measure for Point Process Models of Ensemble Neural Spiking ActivityPLOS Computational Biology, 2011
- Estimating the directed information to infer causal relationships in ensemble neural spike train recordingsJournal of Computational Neuroscience, 2010
- Markov equivalence for ancestral graphsThe Annals of Statistics, 2009
- On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection biasArtificial Intelligence, 2008
- Motif Discovery in Tissue-Specific Regulatory Sequences Using Directed InformationEURASIP Journal on Bioinformatics and Systems Biology, 2007
- Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joiningJournal of Algorithms, 2003
- Measures of mutual and causal dependence between two time series (Corresp.)IEEE Transactions on Information Theory, 1987
- The Bidirectional Communication Theory--A Generalization of Information TheoryIEEE Transactions on Communications, 1973
- Investigating Causal Relations by Econometric Models and Cross-spectral MethodsEconometrica, 1969
- Approximating discrete probability distributions with dependence treesIEEE Transactions on Information Theory, 1968