Causal Structure Discovery from Distributions Arising from Mixtures of
DAGs
- URL: http://arxiv.org/abs/2001.11940v2
- Date: Sun, 9 Aug 2020 15:40:22 GMT
- Title: Causal Structure Discovery from Distributions Arising from Mixtures of
DAGs
- Authors: Basil Saeed, Snigdha Panigrahi, Caroline Uhler
- Abstract summary: We consider distributions arising from a mixture of causal models, where each model is represented by a directed acyclic graph (DAG)
We show that such algorithms recover a "union" of the component DAGs and can identify variables whose conditional distribution across the component DAGs vary.
As an immediate application, we demonstrate how retrieval of this causal information can be used to cluster samples according to each mixture component.
- Score: 12.12755951035594
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We consider distributions arising from a mixture of causal models, where each
model is represented by a directed acyclic graph (DAG). We provide a graphical
representation of such mixture distributions and prove that this representation
encodes the conditional independence relations of the mixture distribution. We
then consider the problem of structure learning based on samples from such
distributions. Since the mixing variable is latent, we consider causal
structure discovery algorithms such as FCI that can deal with latent variables.
We show that such algorithms recover a "union" of the component DAGs and can
identify variables whose conditional distribution across the component DAGs
vary. We demonstrate our results on synthetic and real data showing that the
inferred graph identifies nodes that vary between the different mixture
components. As an immediate application, we demonstrate how retrieval of this
causal information can be used to cluster samples according to each mixture
component.
Related papers
- Synthetic Potential Outcomes and Causal Mixture Identifiability [9.649642656207869]
Heterogeneity can be resolved at multiple levels by grouping populations according to different notions of similarity.
This paper proposes grouping with respect to the causal response of an intervention or perturbation on the system.
arXiv Detail & Related papers (2024-05-29T16:05:57Z) - Graph Invariant Learning with Subgraph Co-mixup for Out-Of-Distribution
Generalization [51.913685334368104]
We propose a novel graph invariant learning method based on invariant and variant patterns co-mixup strategy.
Our method significantly outperforms state-of-the-art under various distribution shifts.
arXiv Detail & Related papers (2023-12-18T07:26:56Z) - On the Equivalence of Graph Convolution and Mixup [70.0121263465133]
This paper investigates the relationship between graph convolution and Mixup techniques.
Under two mild conditions, graph convolution can be viewed as a specialized form of Mixup.
We establish this equivalence mathematically by demonstrating that graph convolution networks (GCN) and simplified graph convolution (SGC) can be expressed as a form of Mixup.
arXiv Detail & Related papers (2023-09-29T23:09:54Z) - Bayesian Causal Inference in Doubly Gaussian DAG-probit Models [0.0]
We introduce the concept of Gaussian DAG-probit model under two groups and hence doubly Gaussian DAG-probit model.
We validated the proposed method using a comprehensive simulation experiment and applied it on two real datasets.
arXiv Detail & Related papers (2023-04-12T16:57:47Z) - Score-based Continuous-time Discrete Diffusion Models [102.65769839899315]
We extend diffusion models to discrete variables by introducing a Markov jump process where the reverse process denoises via a continuous-time Markov chain.
We show that an unbiased estimator can be obtained via simple matching the conditional marginal distributions.
We demonstrate the effectiveness of the proposed method on a set of synthetic and real-world music and image benchmarks.
arXiv Detail & Related papers (2022-11-30T05:33:29Z) - Latent Space Diffusion Models of Cryo-EM Structures [6.968705314671148]
We train a diffusion model as an expressive, learnable prior in the cryoDRGN framework.
By learning an accurate model of the data distribution, our method unlocks tools in generative modeling, sampling, and distribution analysis.
arXiv Detail & Related papers (2022-11-25T15:17:10Z) - Score-based Generative Modeling of Graphs via the System of Stochastic
Differential Equations [57.15855198512551]
We propose a novel score-based generative model for graphs with a continuous-time framework.
We show that our method is able to generate molecules that lie close to the training distribution yet do not violate the chemical valency rule.
arXiv Detail & Related papers (2022-02-05T08:21:04Z) - A Robust and Flexible EM Algorithm for Mixtures of Elliptical
Distributions with Missing Data [71.9573352891936]
This paper tackles the problem of missing data imputation for noisy and non-Gaussian data.
A new EM algorithm is investigated for mixtures of elliptical distributions with the property of handling potential missing data.
Experimental results on synthetic data demonstrate that the proposed algorithm is robust to outliers and can be used with non-Gaussian data.
arXiv Detail & Related papers (2022-01-28T10:01:37Z) - GANs with Variational Entropy Regularizers: Applications in Mitigating
the Mode-Collapse Issue [95.23775347605923]
Building on the success of deep learning, Generative Adversarial Networks (GANs) provide a modern approach to learn a probability distribution from observed samples.
GANs often suffer from the mode collapse issue where the generator fails to capture all existing modes of the input distribution.
We take an information-theoretic approach and maximize a variational lower bound on the entropy of the generated samples to increase their diversity.
arXiv Detail & Related papers (2020-09-24T19:34:37Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.