Estimates causal effects in Gaussian Linear SCMs with finite data.
problem Estimating causal effects from observational data with latent confounders.
method Centralized Gaussian Linear SCMs (CGL-SCMs) and EM-based estimation algorithm.
result Learned CGL-SCM parameters accurately recover causal distributions from finite observational samples.
TSC improves causal effect estimation in panel data.
problem Estimating causal effects in panel data with a single treated unit.
method Targeted synthetic control method that refines initial weights through a one-dimensional targeted update.
result TSC consistently improves estimation accuracy over state-of-the-art SCM baselines.
Expands experimental design for causal discovery from limited data.
problem Challenges in causal discovery from observational and interventional data.
method Bayesian optimal experimental design incorporating recent advances in causal discovery.
result Active causal discovery of large, nonlinear SCMs with both intervention target and value selection.
COTA learns abstraction maps from data without complete SCM knowledge.
problem Learning causally consistent representations at different resolutions.
method Multi-marginal Optimal Transport (OT) with do-calculus constraints and interventional cost.
result COTA outperforms non-causal and independent formulations on synthetic and real-world problems.
We propose iSCMs to standardize SCM data, improving causal inference.
problem Artifacts in SCM data can lead to misleading conclusions.
method We introduce internally-standardized structural causal models (iSCMs).
result iSCMs are not Var-sortable and mostly not R2-sortable. This paper introduces a new method to deceive causal structure learning by omitting data.
problem Deceiving causal structure learning algorithms with incompletely observed data.
method Adversarial missingness attack to bias the learned causal structures.
result Theoretical and practical attack mechanisms are developed for various SCMs.
Deep SCMs with deep learning infer counterfactuals from noisy data.
problem Inference of counterfactuals from noisy data in causal models.
method Normalizing flows and variational inference for deep SCMs.
result Tractable inference of exogenous noise variables for counterfactuals.
Two environments are enough to infer causal graphs and counterfactuals.
problem Inferring causal relations from multiple environments, especially for nonlinear mechanisms.
method Using structural causal models and the invariance principle, the study shows that only two auxiliary environments are sufficient for causal graph inference and counterfactual inference.
result Two auxiliary environments are sufficient for identifying causal graphs and counterfactuals.
New model predicts drug effects across various cell types using causal imputation.
problem Predict drug effects across different cell types given limited data.
method Introduces a novel SCM-based model class with latent factor structure and uses Synthetic Interventions estimator.
result Method outperforms other matrix completion approaches in drug repurposing dataset.
A new method infers causal structures and generates data without DAGs.
problem Modeling causal relationships without DAGs.
method Fixed-point approach on causally ordered variables, amortized TO inference, transformer-based SCM learning.
result The model learns TOs and SCMs from data, outperforming baselines.
Markov boundary improves tabular prediction but not as expected.
problem Improving tabular prediction using the Markov boundary.
method Evaluation on a synthetic SCM benchmark with feature counts from 40 to 1000.
result Restricting a regressor to the Markov boundary often improves prediction, but existing discovery and training pipelines do not fully exploit this.
The Set Covering Machine (SCM) is a greedy learning algorithm that produces sparse classifiers. We extend the SCM for datasets that contain a huge number of features. The whole genetic material of living organisms is an example of such a case, where the number of feature exceeds 10^7. Three human pathogens were used to…
New method warns of counterfactual non-identifiability in DSCMs.
problem Counterfactual inference from observational data is non-identifiable even without unobserved confounding.
method Prove counterfactual identifiability for monotonic generation mechanisms, provide impossibility result for general mechanisms, propose method for estimating worst-case errors.
result Non-identifiability of counterfactual inference from observational data, even in absence of unobserved confounding.
Paper simplifies complex causal identifiability problems with exogenous isomorphism.
problem Achieving consistent answers to causal questions in Structural Causal Models.
method Introducing exogenous isomorphism and proposing ∼EI-identifiability. result Unified and generalized theories for practical applications in counterfactual reasoning.
Paper proves linear convergence of SCMS algorithm for directional data.
problem Identifying density ridges in directional data.
method Generalized SCMS algorithm to directional data, derived from SCGA with adaptive step size.
result Linear convergence of the proposed directional SCMS algorithm.
New method infers causal relationships from nonstationary time series data.
problem Challenges in inferring causal relationships from nonstationary time series data.
method Proposes a new class of restricted SCM with time-varying filters and stationary noise, leveraging asymmetry from nonstationarity.
result Demonstrates effectiveness of the proposed methodology on various synthetic and real datasets.
Paper reconciles RCM and SCM frameworks for causal inference.
problem Clarifying the relationship between RCM and SCM frameworks.
method Neutral logical perspective, previous work, and abstract representation.
result Every RCM emerges as an abstraction of some representable RCM.
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.
Study counterfactuals in cyclic systems with shifts and scales.
problem Counterfactual inference in cyclic systems with shifts and scales.
method Shift-scale interventions in cyclic SCMs.
result Valid inference in cyclic systems with shifts and scales.
Improved covariance matrix estimation for multiple classes with limited data.
problem Estimating covariance matrices for multiple classes with scarce data.
method Coupled regularized sample covariance matrix estimator (RSCM) that combines pooled SCM and scaled identity matrix for regularization.
result The coupled RSCM estimators outperform cross-validation in classification tasks with comparable accuracy but faster computation.
For decades, researchers in fields, such as the natural and social sciences, have been verifying causal relationships and investigating hypotheses that are now well-established or understood as truth. These causal mechanisms are properties of the natural world, and thus are invariant conditions regardless of the collec…
Proposes iVDFM for identifying latent factors in multivariate time series.
problem Identifying latent factors in multivariate time series with structural dynamics.
method Identifiable Variational Dynamic Factor Model (iVDFM) with iVAE-style conditioning.
result Identifiable latent factors up to permutation and component-wise affine transformations.
Have you ever wondered how a song might sound if performed by a different artist? In this work, we propose SCM-GAN, an end-to-end non-parallel song conversion system powered by generative adversarial and transfer learning that allows users to listen to a selected target singer singing any song. SCM-GAN first separates …
Graph neural networks help infer causal effects from partially observable data.
problem Inferring causal effects from partially observable data.
method Theoretical analysis of GNN and SCM connections.
result Established a new model class for GNN-based causal inference.
New method identifies causal order without sparsity assumptions.
problem Causal order discovery in observational data.
method Sequential procedure to directly identify causal order.
result Direct identification of causal order without sparsity assumptions.
Identifies shifts in causal mechanisms between related datasets using ANMs.
problem Estimating the full causal structure from data is challenging; focus on identifying shifts in causal mechanisms.
method Assumes nonlinear additive noise models, uses Jacobian of score function for mixture distribution to identify shifts.
result Shows applicability of the approach on synthetic and real-world data.
Structural Causal Models (SCMs) provide a popular causal modeling framework. In this work, we show that SCMs are not flexible enough to give a complete causal representation of dynamical systems at equilibrium. Instead, we propose a generalization of the notion of an SCM, that we call Causal Constraints Model (CCM), an…
Dynamical systems are widely used in science and engineering to model systems consisting of several interacting components. Often, they can be given a causal interpretation in the sense that they not only model the evolution of the states of the system's components over time, but also describe how their evolution is af…
Paper proposes a new method for covariance estimation using M-estimators with eigenvalue shrinkage.
problem Estimating covariance matrices in heavy-tailed distributions.
method Replaces shrinkage sample covariance matrix with M-estimator of scatter matrix and optimizes shrinkage parameter.
result Shrinkage M-estimators outperform shrinkage SCM in heavy-tailed distributions.
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.
Graph neural network explainer identifies causal subgraphs ensuring predictions.
problem Spurious correlations in GNN explainers.
method Proposes {
ame}, a GNN causal explainer via causal inference.
result Significantly outperforms existing GNN explainers in exact groundtruth explanation identification.
A new framework for robust and coherent counterfactual transports.
problem Estimating joint distributions over counterfactual outcomes in personalized decision-making and treatment risk assessment.
method Counterfactual cocycles that use algebraic structure to provide coherence and identifiability guarantees, bridging the gap between bijective SCMs and OT methods.
result Counterfactual cocycles provide state-of-the-art performance and noise-robustness across synthetic benchmarks and a real-world study.
New method learns causal models from data efficiently.
problem Learning Structural Causal Models from data is challenging.
method Amortized inference via Conditional Fixed-Point Iterations with transformer embeddings.
result Single model predicts causal mechanisms conditioned on data and graph.
Paper proposes a method to estimate counterfactual outcomes without a known SCM.
problem Estimating counterfactual outcomes without a known structural causal model.
method Introduces rank preservation assumption and a novel ideal loss for unbiased learning of counterfactual outcomes.
result The proposed method is effective and unbiased, as shown by theoretical analysis and experiments.
Novel approach to compute hazard ratios from observational studies using SCMs and backdoor adjustment.
problem Identifying causal relationships from observational data using hazard ratios.
method Backdoor adjustment through structural causal models (SCMs) and do-calculus.
result Novel approach for computing hazard ratios from observational studies.
SD-SCMs generate counterfactual data for causal inference benchmarks.
problem Benchmarking causal inference methods with realistic data.
method Sequence-driven structural causal models (SD-SCMs) for causal inference.
result State-of-the-art methods struggle with individual treatment effect estimation.
New RL method learns policies from few data using causal models.
problem Limited interaction data and heterogeneous patient responses.
method Exploits structural causal models to model state dynamics and counterfactual reasoning.
result Counterfactual RL algorithms converge to optimal value function.
New algorithm learns causal structures by intersecting Markov blankets.
problem Learning causal relationships from data.
method Endogenous and Exogenous Markov Blankets Intersection (EEMBI) algorithm.
result EEMBI-PC integrates PC algorithm steps for improved accuracy.
Drift-Resilient TabPFN learns to adapt to changing data distributions.
problem Real-world data often shifts over time, degrading model performance.
method In-Context Learning with a Prior-Data Fitted Network, using structural causal models.
result Significant performance improvements across various datasets.
New method distinguishes cause from effect using causal velocity.
problem Inferring causal direction from bivariate data.
method Parametrization of bivariate SCMs in terms of causal velocity, using tools from measure transport.
result Method extends beyond known model classes and requires no assumptions on noise distributions.
New method quantifies intrinsic causal contributions in neural networks.
problem Measuring the causal influence of input features in deep neural networks.
method Proposes an identifiable generative post-hoc framework to quantify intrinsic causal contributions (ICC) as structural causal models.
result ICC generates more intuitive and reliable explanations compared to existing global explanation techniques.
This paper describes a versatile method that accelerates multichannel source separation methods based on full-rank spatial modeling. A popular approach to multichannel source separation is to integrate a spatial model with a source model for estimating the spatial covariance matrices (SCMs) and power spectral densities…
We consider the problem in precision health of grouping people into subpopulations based on their degree of vulnerability to a risk factor. These subpopulations cannot be discovered with traditional clustering techniques because their quality is evaluated with a supervised metric: the ease of modeling a response variab…
We give an explicit algorithm and source code for combining alpha streams via bounded regression. In practical applications typically there is insufficient history to compute a sample covariance matrix (SCM) for a large number of alphas. To compute alpha allocation weights, one then resorts to (weighted) regression ove…
We introduce an off-policy evaluation procedure for highlighting episodes where applying a reinforcement learned (RL) policy is likely to have produced a substantially different outcome than the observed policy. In particular, we introduce a class of structural causal models (SCMs) for generating counterfactual traject…
TSLiNGAM improves causal discovery in heavy-tailed data.
problem Identifying causal relationships in data with heavy tails.
method Combines DAGs with structural causal models, leveraging non-Gaussian noise.
result Significantly better performance on heavy-tailed and skewed data.
New approach to counterfactual reasoning in AI and psychology.
problem Challenges to conventional counterfactual reasoning in AI and psychology.
method Formalizes a backtracking approach to counterfactuals within the SCM framework.
result First general account and algorithmisation of backtracking counterfactuals.
Extends linear structural causal models to include deterministic relations and latent confounders for causal discovery.
problem Causal discovery in linear SCMs with deterministic relations and latent confounders.
method Extended existing results to include deterministic relations and latent confounders, derived necessary and sufficient conditions for unique identifiability, proposed an algorithm for recovery.
result First work on identifiability results for causal discovery under latent confounding and deterministic relationships.