DCRL learns causal relationships from mixed-type discrete data.
problem Challenges in learning causal relationships from discrete, mixed-type data.
method Generative framework modeling directed acyclic graph and sparse bipartite graph, flexible measurement models for different types of data.
result Consistent recovery of latent causal structure from observed data distribution.
Algorithm recovers causal graphs in presence of latent confounders and selection bias.
problem Recovering causal graphs in the presence of latent confounders and selection bias.
method Iterative causal discovery (ICD) algorithm that relies on causal Markov and faithfulness assumptions.
result Sound and complete algorithm that recovers the equivalence class of the underlying causal graph.
New bounds for causal effect identification in time series graphs with latent confounders.
problem Identifying causal effects in time series graphs with latent confounders over unbounded time intervals.
method Applying the Causal Identification algorithm to a constant-size segment of the time series graph.
result A bound on the number of past time steps needed for causal effect identification.
OrphicX generates causal explanations for GNNs by isolating latent causal factors.
problem Generating interpretable causal explanations for complex graph neural networks.
method Develops a generative model and objective function to isolate latent causal factors, maximizing information flow.
result OrphicX effectively identifies causal semantics, significantly outperforming alternatives.
FMI uses matching to mimic interventions for causal feature learning.
problem Challenges in causal discovery from observational data.
method Feature Matching Intervention (FMI) using matching to emulate perfect interventions.
result FMI outperforms in identifying causal features from observational data.
Paper distinguishes causal structures under latent confounding and selection bias.
problem Distinguishing causal relationships when latent variables and selection bias are present.
method Formulated selected-marginalized directed graphs (smDGs) to distinguish causal structures.
result Two causal structures are indistinguishable if they have the same selected-marginalized directed graph.
Novel graphical models for time series with latent confounders improve causal inference.
problem Causal relationships and independencies in multivariate time series with unobserved confounders.
method Introduced a novel class of graphical models and characterized their properties.
result Novel graphs provide stronger causal inferences without additional assumptions.
Paper proposes a new method to identify causal graphs with latent variables using higher-order cumulants.
problem Estimating causal directed acyclic graphs with latent confounders.
method Uses higher-order cumulants to identify causal structures among observed and latent variables.
result Validates the proposed algorithm through simulations and real-world data.
This paper tackles causal representation learning from multiple distributions without hard interventions.
problem Recovering latent causal variables and their relations from multiple distributions.
method Develops general solutions for causal representation learning without hard interventions, under sparsity constraints and suitable change conditions.
result Recovering the moralized graph of the underlying directed acyclic graph and latent variables related to the underlying causal model.
The paper presents efficient methods for identifying causal graphs with latent variables.
problem Recovering causal graphs with latent variables while minimizing intervention costs.
method Two intervention cost models (linear and identity) are considered. Algorithms are provided for both models.
result Upper bounds on the number of interventions needed for recovery, and approximation factors for the linear cost model.
Study reconstructs causal graph from latent variables using mixture oracles.
problem Reconstructing causal graphical model from data with latent variables.
method Reduction to mixture oracle to identify latent representations and causal structure.
result Conditions for identifying latent representations and causal model.
New method identifies latent causal graphs without parametric assumptions.
problem Identifying latent causal graphs without parametric assumptions.
method Constructive proofs with new graphical concepts.
result Conditions for nonparametric identification of latent causal graphs.
Causal Component Analysis aims to recover latent variables with causal relationships.
problem Recover latent variables with causal relationships from observed mixtures.
method Introduces a likelihood-based approach using normalizing flows to estimate unmixing function and causal mechanisms.
result Demonstrates effectiveness through synthetic experiments in CauCA and ICA settings.
Develops SCMs for latent selection to simplify causal analysis.
problem Latent selection complicates causal analysis.
method Introduces a conditioning operation for SCMs to encode latent selection.
result Conditioning operation preserves simplicity, acyclicity, and linearity of SCMs.
Identifies causal effects in LiNGAM models with latent variables.
problem Identifying causal effects in LiNGAM models with latent confounders.
method Complete graphical characterization and efficient algorithms for certification. RICA adaptation for estimation.
result Efficient algorithms and RICA adaptation for estimating causal effects.
Proposes a new condition to estimate latent variable causal graphs from observed data.
problem Estimating causal structures when observed variables are not the underlying causal variables.
method Introduces Generalized Independent Noise (GIN) condition and a recursive learning algorithm.
result Shows that GIN helps locate latent variables and identify their causal structure.
Framework generates causal probabilities from observational data.
problem Generating causal probabilities from observational data.
method Moment-matching graph-networks for causal inference.
result Automated sampling of latent space conditional probability distributions.
CLEAR learns causal graphs from attention in recommender systems to explain user behavior.
problem Understanding why specific recommendations are made in recommender systems.
method CLEAR learns session-specific causal graphs from attention in pre-trained neural recommenders, addressing latent confounders.
result CLEAR provides counterfactual explanations that are shorter and more effective than naive methods.
New algorithm learns causal graph to minimize regret in bandits without full structure.
problem Learning optimal decisions in bandits with unknown causal graph and latent confounders.
method Two-stage approach: first learns ancestors and necessary confounders, second applies standard bandit algorithm.
result No full causal structure needed for optimal decisions; only necessary confounders are crucial.
Improves causal graph learning on dependent binary data.
problem Challenges in learning causal graphical models from dependent binary data.
method Decorrelation-based approach using latent utility model and EM-like algorithm.
result Significant improvement in accuracy of causal graph learning.
Efficient algorithms decide algebraic constraints of causal graphs.
problem Distinguish causal graphs with latent confounders.
method Study algebraic constraints and propose efficient algorithms.
result Decide equivalence or subset of algebraic constraints.
We solve continuous-time latent SDE identifiability using diffusion shifts.
problem Identifiability of latent SDEs in continuous-time time series.
method Environment-induced shifts in diffusion covariance for additive-noise latent SDEs.
result Two diagonal diffusion regimes with distinct variance ratios identify latent coordinates up to permutation and scaling.
We address the problem of causal discovery from data, making use of the recently proposed causal modeling framework of modular structural causal models (mSCM) to handle cycles, latent confounders and non-linearities. We introduce σ-connection graphs (σ-CG), a new class of mixed graphs (containing undirected, bidirected…
Study designs experiments to identify causal graph structure with cycles and latent confounders.
problem Identify causal graph structure with cycles and latent confounders.
method Established lower bounds, developed CI and do see tests algorithms, and proved tightness.
result Proposed algorithms can recover all causal edges except for double adjacent bidirected edges.
SPOT improves differentiable causal discovery by estimating skeleton posterior for latent confounders.
problem Scalable and accurate estimation of causal skeletons in the presence of latent confounders.
method SPOT (Skeleton Posterior-guided OpTimization) framework that estimates skeleton posterior and integrates it with differentiable causal discovery.
result SPOT enhances differentiable causal discovery by reducing the search space and improving accuracy.
Causal discovery from data affected by latent confounders is an important and difficult challenge. Causal functional model-based approaches have not been used to present variables whose relationships are affected by latent confounders, while some constraint-based methods can present them. This paper proposes a causal f…
New method recovers causal DAGs from general environments without strict assumptions.
problem Recovering causal DAGs from real-world data with varying distributions.
method Formalizes desiderata for causal representation learning in general environments, leveraging sufficient change conditions up to third-order derivatives.
result Fully recovers latent DAG and identifies latent variables up to minor indeterminacies under nonparametric mixing.
Study identifies causal relationships without direct supervision from unknown interventions.
problem Identify causal relationships from unknown interventions without direct supervision.
method General nonparametric setting with multiple datasets from unknown interventions.
result Identify ground truth latents and causal graph up to ambiguities.
We consider the task of causal structure learning over measurement dependence inducing latent (MeDIL) causal models. We show that this task can be framed in terms of the graph theoretic problem of finding edge clique covers,resulting in an algorithm for returning minimal MeDIL causal models (minMCMs). This algorithm is…
Paper proposes a fast algorithm to recover causal DAGs with latent variables.
problem Discovering causal relationships in the presence of latent variables.
method Cholesky factorization of covariance matrix with optimization for latent variables.
result The algorithm significantly outperforms previous methods in synthetic and real-world datasets.
Algorithm learns causal structures from time-series data, reducing tests for temporal vs. contemporaneous relations.
problem Learning causal structures from time-series data with latent confounders.
method Constraint-based algorithm that refines a causal graph by learning temporal relations first, then contemporaneous ones.
result Reduces the number of statistical tests and improves accuracy for synthetic and real-world data.
CCHM algorithm learns BN structure with latent variables, improving causal effect measurement.
problem Latent variables cause spurious relationships in BN structure learning.
method Hybrid approach combining constraint-based and score-based learning, incorporating do-calculus.
result CCHM outperforms state-of-the-art in reconstructing true BN structure.
A new framework estimates causal effects for ordinal variables.
problem Existing causal inference methods fail for ordinal data.
method Presumes a latent Gaussian DAG model with constrained covariance matrix.
result Closed-form function for ordinal causal effects in latent space.
Study identifies latent variables and causal relationships from multiple environments.
problem Identify latent variables and causal relationships from multiple environments.
method Proposes algorithm LiNGCReL for identifying causal graph up to surrounded-node ambiguity.
result Identifies latent variables up to surrounded-node ambiguity (SNA) in linear causal models.
Researchers identify latent variables and causal structures from nonlinear hierarchical models.
problem Challenging task of identifying latent variables and causal structures from observational data, especially when relationships are nonlinear.
method Investigated nonlinear latent hierarchical causal models, developed identification criterion, and constructed an estimation procedure.
result Identifiability of causal structures and latent variables achieved under mild assumptions.
Paper relaxes identifiability conditions for causal models with latent variables.
problem Challenges in identifying causal graphical models with latent variables.
method Proposes a double triangular graphical condition for nonparametric measurement models with binary latent variables.
result Guarantees identifiability of the entire causal graphical model under relaxed conditions.
This paper tackles causal representation learning with linear and general transformations.
problem Identify and recover latent causal variables and graphs under unknown transformations.
method Score-based algorithms that use gradients of log-density functions for identifiability and achievability.
result Two stochastic hard interventions per node are sufficient for identifiability of general transformations.
Unpaired multi-domain causal representation learning is possible with sufficient conditions.
problem Learning shared causal representation from unpaired data across domains.
method Identify sufficient conditions for joint distribution and shared causal graph recovery.
result Practical method to recover shared latent causal graph from marginal distributions.
New algorithm identifies causal relationships from graphs, even with selection bias.
problem Identifying causal relationships from graphs with selection bias.
method Developed a measure-theoretic version of Pearl's causal calculus and a sound, complete identification algorithm.
result General measure-theoretic version of causal calculus allows for identification of causal relationships under selection bias.
Paper establishes identifiability and achievability for causal representation learning.
problem Identifying and recovering latent causal models and variables from observational and interventional data.
method Establishes identifiability and achievability using uncoupled interventions and a recovery algorithm.
result Guaranteed perfect recovery of latent causal model and variables under uncoupled interventions.
New method identifies latent variables with causal dependencies from observed data.
problem Identify latent variables with causal relationships from observed data.
method Linear causal disentanglement via higher-order cumulants, with perfect and soft interventions.
result Recovery of parameters via coupled tensor decomposition and polynomial equations.
SPACY discovers causal graphs from spatiotemporal data using variational inference.
problem Inferring causal relationships from high-dimensional spatiotemporal data with complex correlations.
method SPACY uses variational inference to model latent time series and their causal relationships, incorporating spatial factors to aggregate correlated data.
result SPACY outperforms state-of-the-art methods on synthetic and real-world data, identifying key causal phenomena.
Develops a method to identify causal effects in linear models with latent variables.
problem Identifying causal effects in models with latent variables that are not independent.
method A novel graphical criterion and an integer linear program algorithm.
result Sufficient condition for identifying causal effects by rational formulas in the covariance matrix.
Paper recovers latent causal structure and linear transformation from indirect observations.
problem Recovering latent causal structure and linear transformation from indirect observations.
method Established sufficient conditions for DAG recovery, leveraged score function properties, and used soft/hard interventions.
result Perfect recovery of latent DAG structure and linear transformation up to scaling using soft interventions, hard interventions with additional hypothesis testing.
AGFN improves causal discovery by integrating expert feedback and handling latent confounding.
problem Inaccurate causal discovery due to unreliable expert knowledge and latent confounding.
method Ancestral GFlowNet (AGFN) is a reinforcement learning algorithm that iteratively refines a policy based on noisy expert feedback to infer ancestral graphs.
result AGFN converges to the true ancestral graph given accurate expert responses and outperforms baselines in structural Hamming distance and Bayesian Information Criterion.
Algorithm recovers causal graphs from data with fewer tests.
problem Recovering causal graphs from observational data with latent confounders and selection bias.
method Iterative CI tests with increasing condition set sizes.
result Significantly fewer CI tests and condition sets compared to FCI.
Weak supervision enables learning causal representations from unstructured data.
problem Learning high-level causal representations from unstructured data like images.
method Weakly supervised setting with paired samples before and after interventions. Implicit latent causal models using variational autoencoders.
result Models can reliably identify causal structure and disentangle causal variables.
Causal reasoning has been an indispensable capability for humans and other intelligent animals to interact with the physical world. In this work, we propose to endow an artificial agent with the capability of causal reasoning for completing goal-directed tasks. We develop learning-based approaches to inducing causal kn…