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.
New method selects direct causal parents from large sets of variables.
problem Inferring direct causal parents from many variables, especially nonlinear and cyclic.
method One-vs.-the-rest feature selection approach with theoretical guarantees.
result Significant improvements over existing methods.
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.
Local discovery method uncovers direct unfairness in complex systems.
problem Identifying causal pathways of unfairness in complex domains.
method Local discovery for direct discrimination (LD3) method.
result LD3 returns a valid adjustment set (VAS) for assessing unfairness.
We consider the problem of inferring the directed, causal graph from observational data, assuming no hidden confounders. We take an information theoretic approach, and make three main contributions. First, we show how through algorithmic information theory we can obtain SCI, a highly robust, effective and computational…
Local causal structure learning aims to discover and distinguish direct causes (parents) and direct effects (children) of a variable of interest from data. While emerging successes have been made, existing methods need to search a large space to distinguish direct causes from direct effects of a target variable \emph{T…
SCARY dataset generates complex causal scenarios for causality research.
problem Lack of complexity in existing causal datasets.
method Synthetic dataset with 40 scenarios, three seeds, and two data generation mechanisms.
result Provides a valuable resource for realistic causal discovery.
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.
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.
Efficiently learns linear non-Gaussian DAGs with noisy nodes.
problem Learning DAGs with non-Gaussian noise and diverging number of nodes.
method Proposes a novel method using topological layers for bottom-up reconstruction and consistent parent-child relations.
result Topological layers can be exactly reconstructed and parent-child relations established without faithfulness assumption.
Invariant Causal Set Covering Machines avoid spurious associations.
problem Learning algorithms for rule-based models are vulnerable to spurious associations.
method Building on invariant causal prediction, propose Invariant Causal Set Covering Machines for conjunctions/disjunctions of binary-valued rules.
result The method can identify causal parents of a variable of interest in polynomial time.
New algorithm speeds up causal discovery for network data.
problem Scalability issues in score-matching for temporal network data.
method Developed a new parent-finding subroutine for DAGs, improving score matching efficiency.
result Efficiency-lifted score matching for both i.i.d. and temporal data on networks.
A new method for identifying causal directions in complex systems.
problem Identifying causal relationships in nonlinear systems with limited data.
method Sequential edge orientation approach using pairwise additive noise model.
result The method can recover true causal DAGs under nonlinear additive noise models.
FLOP algorithm speeds up causal structure learning for linear models.
problem Efficiently learning causal structures from discrete data.
method FLOP algorithm combines fast parent selection and iterative score updates.
result FLOP finds highly accurate causal structures with near-perfect recovery.
The problem of inferring the direct causal parents of a response variable among a large set of explanatory variables is of high practical importance in many disciplines. Recent work exploits stability of regression coefficients or invariance properties of models across different experimental conditions for reconstructi…
New method identifies extreme risk propagation in financial networks.
problem Understanding extreme risk in financial networks.
method Max-linear structural equation model, hard-thresholding, Hamming distance.
result Sparse DAG for extreme risk propagation estimated.
Study identifies parameters in causal models with latent confounding.
problem Parameter identification in linear non-Gaussian causal models with latent confounding.
method Graphical criterion for necessary and sufficient identifiability of direct causal effects, with polynomial-time algorithm.
result Developed a graphical criterion for identifying direct causal effects in latent variable models with arbitrary non-linear confounding.
We consider structural equation models in which variables can be written as a function of their parents and noise terms, which are assumed to be jointly independent. Corresponding to each structural equation model, there is a directed acyclic graph describing the relationships between the variables. In Gaussian structu…
A novel method for learning DAGs from positive-valued data.
problem Causal discovery from observational data of positive-valued variables.
method Hybrid Moment-Ratio Scoring (H-MRS) algorithm combining moment-based scoring and log-scale regression.
result H-MRS integrates log-scale Ridge regression for moment-ratio estimation with a greedy ordering procedure based on raw-scale moment ratios, followed by Elastic Net-based parent selection.
We describe a formal approach to identify 'root causes' of outliers observed in n variables X1,…,Xn in a scenario where the causal relation between the variables is a known directed acyclic graph (DAG). To this end, we first introduce a systematic way to define outlier scores. Further, we introduce the concep…
DAG-FOCI learns causal relationships without parametric assumptions.
problem Learning causal structure with minimal assumptions on functionals and noise.
method DAG-FOCI, a fast algorithm based on FOCI variable selection.
result Theoretical and conservative guarantees for causal claims.
New method for causal discovery using peeling algorithms for various data types.
problem Challenges in causal discovery due to unmeasured confounders.
method Two peeling algorithms (bottom-up and top-down) for causal discovery with generalized structural equation models.
result Valid discovery of causal relationships and parent-child effects in diverse data types.
The paper proves ML estimators are strongly consistent for identifying edge weights in BAR models.
problem Identifying edge weights in Bernoulli Autoregressive (BAR) models.
method Maximum Likelihood (ML) estimation for two variants of BAR models.
result ML estimators are strongly consistent for edge weight identification.
KaCGM models provide transparent causal inference from tabular data.
problem Limited auditability in deep causal models for tabular data.
method KaCGM uses Kolmogorov-Arnold Networks to parameterize structural equations, enabling direct inspection and visualization of causal mechanisms.
result KaCGM achieves competitive performance and interpretable causal effects in real-world applications.
Bayesian causal inference method improves accuracy over traditional approaches.
problem Bayesian marginalisation over causal models is computationally infeasible.
method Decomposes structure marginalisation into causal orders and DAGs, using Gaussian processes for mechanisms and ARCO for orders.
result Method outperforms state-of-the-art in structure learning and inference.
New method uses information theory to uncover causal relationships in complex systems.
problem Discovering causal relationships in multivariate systems, especially in Bayesian networks and hypergraphs.
method Partial Information Decomposition (PID) to explicitly model higher-order interactions.
result PID components reveal direct causal neighbors and collider relationships in Bayesian networks and multi-tail hyperedges in causal hypergraphs.
The paper shows how instrumental variables can help identify sparse causal effects in linear models.
problem Identifying sparse causal effects in linear models with limited instruments.
method Conditions and graphical criteria for identifiability, spaceIV estimator.
result Causal effects can be identified from observed distributions with sparse effects and limited instruments.
Modular neural causal models outperform other models in generalization and adaptation.
problem Robust out-of-distribution generalization and fast adaptation in machine learning.
method Factorizing data generating process into modules using only causal parents as predictors.
result Modular neural causal models offer robust generalization and fast adaptation, especially in low data regimes.
This work sets a universal lower bound for learning causal DAGs with atomic interventions.
problem Learning causal DAGs using only observational data results in a Markov equivalence class, requiring interventions to fully orient.
method Developed CBSP orderings and used them to prove a universal lower bound on the number of single-node interventions needed.
result The universal lower bound is within a factor of two of the minimum number of single-node interventions required to fully orient a given Markov equivalence class.
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.
A new measure of causal influence quantifies intrinsic contributions in DAGs.
problem Quantifying intrinsic causal contributions in Directed Acyclic Graphs (DAGs).
method Recursive decomposition of node contributions, structure-preserving interventions, Shapley symmetrization.
result A measure of intrinsic causal contribution that is invariant to node relabeling.
Paper introduces VBG for Bayesian causal structure and mechanism learning.
problem Bayesian causal structure learning with uncertainty over models.
method Variational Bayes-DAG-GFlowNet (VBG) method.
result VBG outperforms existing methods in modeling posterior over DAGs and mechanisms.
RAMEN corrects observational data biases for multiple environments.
problem Bias in observational data for causal inference.
method RAMEN algorithm that leverages heterogeneity of multiple data sources.
result RAMEN produces unbiased treatment effect estimates.
Bayesian networks, with structure given by a directed acyclic graph (DAG), are a popular class of graphical models. However, learning Bayesian networks from discrete or categorical data is particularly challenging, due to the large parameter space and the difficulty in searching for a sparse structure. In this article,…
Bayesian method recovers causal structure in SEMs with equal error variances.
problem Recovering causal structure in SEMs with equal error variances.
method Bayesian DAG selection method using g-priors and the key property of minimum expected squared errors.
result The method consistently recovers the true graph without additional distributional assumptions.
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 improves causal discovery in time series with latent confounders.
problem Low recall in causal discovery for autocorrelated time series with latent confounders.
method Iterative procedure that includes causal parents in conditioning sets, using novel orientation rules.
result Significantly higher recall compared to existing methods, especially in strong autocorrelation cases.
Bayesian method models binary response and covariates for two groups, estimating causal relationships.
problem Estimating causal relationships between binary response and covariates in observational data.
method Gaussian DAG-probit model with MCMC sampling for posterior distribution estimation.
result Validated method on simulated and real datasets, showing value of grouping variable in causality.
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…
Causal discovery from empirical data is a fundamental problem in many scientific domains. Observational data allows for identifiability only up to Markov equivalence class. In this paper we first propose a polynomial time algorithm for learning the exact correctly-oriented structure of the transitive reduction of any c…
Estimating causal models from observational data is a crucial task in data analysis. For continuous-valued data, Shimizu et al. have proposed a linear acyclic non-Gaussian model to understand the data generating process, and have shown that their model is identifiable when the number of data is sufficiently large. Howe…
M-CaStLe discovers causal structures in multivariate space-time data.
problem Challenges in causal graph discovery for high-dimensional gridded data.
method Generalizes CaStLe to multivariate analyses, using local embeddings and pooling spatial replicates.
result More accurately recovers multivariate causal structure and identifies physical dynamics.
TRAM-DAG models bridge interpretability and flexibility in causal modeling.
problem Modeling causal relationships in diverse data types while maintaining interpretability.
method Using transformation models (TRAMs) within structural causal models (SCMs) to handle various data types and maintain interpretability.
result TRAM-DAG models achieve equal or superior performance in causal queries across different levels of the causal hierarchy.
Low-dimensional probability models for local distribution functions in a Bayesian network include decision trees, decision graphs, and causal independence models. We describe a new probability model for discrete Bayesian networks, which we call an embedded Bayesian network classifier or EBNC. The model for a node Y g…
Game theory approach to predicting and responding to interventions based on causal relationships.
problem Optimizing predictions and interventions in response to observational data.
method Prediction-intervention game framework, focusing on invariant subsets of covariates.
result Stable-blanket predictors are optimal for certain follower objectives and under specific conditions.
Graph-coupled causal Bayesian optimization transfers information across related interventions.
problem Optimizing expensive systems where interventions are costly and causal effects are confounded.
method Ties intervention effects together through shared causal parameters, improving estimation.
result Information-gain and regret bounds show improved performance with shared mechanisms.
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.
For decomposable score-based structure learning of Bayesian networks, existing approaches first compute a collection of candidate parent sets for each variable and then optimize over this collection by choosing one parent set for each variable without creating directed cycles while maximizing the total score. We target…