GACBO optimizes unknown causal graphs with interventions.
problem Optimizing a target variable on an unknown causal graph with interventions.
method Graph Agnostic Causal Bayesian Optimisation (GACBO) seeks to balance exploitation and exploration of causal structures and functions.
result GACBO outperforms baselines in simulated and real-world applications.
New algorithms for causal bandits without knowing the graph structure.
problem Causal bandit problems with unknown graph structure.
method Developed novel causal bandit algorithms for causal trees, forests, and general graphs without prior knowledge of the causal graph.
result Regret guarantees significantly improved over standard MAB algorithms under mild conditions.
MetaCaDI learns causal graphs and unknown interventions from few data instances.
problem Discovering causal mechanisms in systems with high data costs and unknown interventions.
method MetaCaDI is a Bayesian meta-learning framework that optimizes for rapid adaptation to new intervention targets.
result MetaCaDI significantly outperforms state-of-the-art methods in causal graph recovery and intervention target prediction.
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.
This paper tackles unknown causal graphs and soft interventions, establishing regret bounds and an efficient algorithm.
problem Designing causal bandit algorithms with unknown causal graphs and stochastic intervention models.
method Establishes novel regret bounds and presents a computationally efficient algorithm for unknown graph and soft interventions.
result Regret bounds for unknown graph and soft interventions, with a universal minimax lower bound.
Identifies root causes of outliers in unknown cyclic graphs.
problem Outliers in unknown cyclic graphs with linear structural equations.
method Identifies a short list of potential root causes based on strong perturbation and structural equations.
result The shortlist includes true root causes and their parents on the cycle.
Proposes a new CBO method without known causal graphs.
problem Optimizing outcomes with unknown causal graphs.
method New CBO method focusing on direct causal parents, learning Bayesian posterior over them.
result Empirical validation and competitive performance with GP approximation.
We consider testing and learning problems on causal Bayesian networks as defined by Pearl (Pearl, 2009). Given a causal Bayesian network M on a graph with n discrete variables and bounded in-degree and bounded `confounded components', we show that O(logn) interventions on an unknown causal Bayesian ne…
Optimizes causal effects on unknown graphs using Causal Entropy Optimization.
problem Optimizing causal effects in unknown causal graphs.
method Causal Entropy Optimization (CEO) framework that generalizes Causal Bayesian Optimization (CBO). Incorporates causal structure uncertainty in surrogate models and intervention selection.
result CEO achieves faster convergence to global optimum compared to CBO and improves upon sequential structure learning.
New algorithm identifies best intervention without graph knowledge.
problem Finding best intervention in causal bandit setting with unknown graph.
method Additive combinatorial linear bandit problem with action-elimination algorithm.
result One can identify best intervention without explicitly learning graph parents.
New method infers causal effects without knowing control variables.
problem Inference errors when control variables are unknown.
method Proposes a method for inferring causal effects when control variables are unknown.
result Proves method yields asymptotically valid confidence intervals for average causal effects.
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.
Model identifies causal structure from paired observational and interventional data with unknown soft interventions.
problem Identifying causal structure from observational and interventional data with unknown soft interventions.
method Proposes a scalable causal discovery model that aggregates subset-level PDAGs and applies contrastive cross-regime orientation rules.
result The model asymptotically recovers the identifiable PDAG and can orient additional edges compared to non-contrastive subset-restricted methods.
New algorithm finds causal parent nodes without graph learning.
problem Finding causal relationships without knowing the graph structure.
method Developed an efficient algorithm using atomic interventions.
result Algorithm optimally performs interventions with sublinear complexity.
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.
The paper tackles causal bandits with unknown SCMs and soft interventions, providing upper and lower bounds on regret.
problem Optimizing interventions in a causal system with unknown SCMs and soft interventions.
method Assumes unknown SCMs from a general class, allows infinite interventions, and provides upper and lower bounds on regret.
result General upper and lower bounds on cumulative achievable regret for various SCMs.
Bayesian method for causal discovery from unknown general interventions.
problem Learning causal DAGs from unknown interventions that modify parent sets.
method Bayesian approach with MCMC for approximating posterior DAGs and intervention targets.
result Bayesian method can identify DAGs and intervention targets up to equivalence classes.
The paper shows how to learn causal representations with few environments and finite samples.
problem Learning causal representations from limited data and environments.
method Explicit, finite-sample guarantees with a logarithmic number of interventions.
result Consistent recovery of latent causal graph, mixing matrix, and unknown intervention targets.
fCBO optimizes interventions in causal graphs using Gaussian processes.
problem Optimizing interventions in known causal graphs.
method Functional causal Bayesian optimization (fCBO) using Gaussian processes and expected improvement acquisition.
result Functional interventions can lead to better target effects and optimal conditional effects.
SNAP efficiently identifies causal effects without needing full graph learning.
problem Efficiently estimating causal effects on a subset of variables.
method Sequential Non-Ancestor Pruning (SNAP) framework.
result SNAP reduces independence tests and computation time without sacrificing causal effect estimations.
We develop a method to learn abstract causal graphs from interventional data.
problem Estimating causal models at fine granularity is impractical or undesirable.
method Novel graphical identifiability results and an efficient algorithm.
result Directly learns abstract causal graphs from interventional data.
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.
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.
Casper uses causal graph neural networks to improve spatiotemporal time series imputation.
problem Imputing missing values in spatiotemporal time series with confounders and non-causal correlations.
method Casper introduces a novel Prompt Based Decoder (PBD) and Spatiotemporal Causal Attention (SCA) to block confounders and discover causal relationships.
result Casper outperforms baselines and effectively discovers causal relationships in spatiotemporal time series imputation.
Adversarial CBO optimizes under interventions by adversaries and non-stationarities.
problem Optimizing in the presence of adversaries and non-stationary factors.
method Formalizes CBO as ACBO, introduces CBO-MW algorithm combining online learning and causal modeling.
result First algorithm with bounded regret for ACBO, achieving superior performance in synthetic and real-world environments.
Study efficient algorithms for identifying minimum interventional sets to learn causal relationships.
problem Identify the smallest set of interventions to learn causal relationships between a subset of edges.
method Develop algorithms for subset verification and search problems under assumptions of faithfulness, causal sufficiency, and ideal interventions.
result For subset verification, an efficient algorithm is provided to compute a minimum sized interventional set.
We consider the problem of learning the functions computing children from parents in a Structural Causal Model once the underlying causal graph has been identified. This is in some sense the second step after causal discovery. Taking a probabilistic approach to estimating these functions, we derive a natural myopic act…
Model discovers causal relationships from video data of physical systems.
problem Discover structural dependencies and causal interactions in physical systems from video data.
method End-to-end model with perception, inference, and dynamics modules; handles unknown interventions.
result Model correctly identifies causal interactions and makes long-term predictions.
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.
New method uses neural networks to learn causal graphs from interventional data.
problem Challenges in learning causal directed acyclic graphs from data.
method Reformulates as continuous constrained optimization, uses neural networks, leverages interventional data.
result Method compares favorably to state of the art in various settings.
DAG-FM discovers causal relationships from heterogeneous data.
problem Challenges in causal discovery from heterogeneous causal mechanisms.
method DAG-FM uses two specialized Transformer-based sub-modules and a robust tabular interaction block to model complex row-column interactions.
result DAG-FM achieves state-of-the-art performance on synthetic and real-world datasets.
Proposes MCBO for causal Bayesian optimization with model learning and regret bounds.
problem Maximizing downstream variables in unknown structural models.
method Model-based causal Bayesian optimization (MCBO) that learns full system models and trades off exploration and exploitation.
result First non-asymptotic bounds for CBO and practical implementation showing superior performance.
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.
One of the most fundamental problems in causal inference is the estimation of a causal effect when variables are confounded. This is difficult in an observational study, because one has no direct evidence that all confounders have been adjusted for. We introduce a novel approach for estimating causal effects that explo…
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.
LOAD discovers optimal adjustments locally for scalable causal inference.
problem Scalable causal inference for unknown causal graphs.
method Local Optimal Adjustments Discovery (LOAD) method.
result LOAD combines local and global approaches for efficient and accurate causal effect estimation.
BaCaDI discovers causal structures from unknown interventions.
problem Inferring causal structures from unknown interventions with limited data.
method Bayesian framework with gradient-based variational inference.
result BaCaDI outperforms related methods in identifying causal structures and intervention targets.
New PCstar algorithm discovers causal structure of max-linear Bayesian networks.
problem Discovering causal structure in max-linear Bayesian networks due to non-faithfulness.
method PC algorithm modified with C∗-separation assumptions. result PCstar algorithm can orient additional edges not possible with standard PC algorithm.
Study tackles causal effects of close contact on MRSA infections from entangled treatment data.
problem Estimating causal effects of close contact on MRSA infections from observational data with entangled treatments.
method NEAT method that models treatment assignment mechanism and mitigates confounding biases.
result NEAT method effectively estimates causal effects from entangled treatment data.
Unified framework for clustering and learning causal graphs across subjects.
problem Bias and obscured subpopulation-specific dependencies in multivariate systems.
method Directed Acyclic Graph-based Dependency Clustering via Alternating Direction Method of Multipliers (DAG-DC-ADMM) integrated with Structural Equation Modeling (SEM).
result Unified framework recovers cluster-specific causal dependency structures with high true positive rate and low false discovery rate.
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.
This paper tackles causal interactions in mixtures of DAGs using interventions.
problem Learning causal interactions among variables governed by a mixture of causal systems.
method Establishes necessary and sufficient conditions for intervention size, designs an adaptive algorithm.
result Identifies true edges in a mixture of DAGs using optimal or near-optimal interventions.
In many application areas---lending, education, and online recommenders, for example---fairness and equity concerns emerge when a machine learning system interacts with a dynamically changing environment to produce both immediate and long-term effects for individuals and demographic groups. We discuss causal directed a…
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.
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.
New method disentangles mixed interventional and observational data in SEMs.
problem Learning causal relationships from mixed interventional and observational data.
method Developed a method to disentangle mixed interventional and observational data in linear SEMs with Gaussian noise.
result The method can identify causal graphs up to their interventional Markov Equivalence Class.
New methods learn DAGs from noisy data, adapting to noise levels.
problem Inferring causal relationships from observational data with noise and confounding.
method Reformulate DAG learning as a continuous optimization problem over adjacency matrices, jointly inferring structure and noise levels.
result Improved robustness to heteroscedasticity and distribution shifts.
GnIES recovers causal structure from unknown interventions.
problem Recovering causal structure from unknown interventions.
method Characterization of equivalence classes, greedy learning algorithm GnIES.
result GnIES recovers the equivalence class of the data-generating model.