Study causal structure of warped spacetimes using novel pre-length spaces.
problem Understanding the causal structure of warped spacetimes.
method Novel notion of Lorentzian pre-length spaces and proof of causal completion as globally hyperbolic pre-length space.
result Causal completion of GRW spacetime is a globally hyperbolic pre-length space under Hausdorff chronological topology.
This paper completes globally hyperbolic conformally flat spacetimes, proving they are topological manifolds.
problem Understanding the structure of spacetimes with specific properties.
method Analyzing globally hyperbolic conformally flat spacetimes, proving their causal completions are topological manifolds.
result Causal completions of globally hyperbolic conformally flat spacetimes are topological manifolds homeomorphic to S x [0, 1].
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.
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 methods identify causal effects without needing complete proxy variables.
problem Identifying causal effects in the presence of unmeasured confounders.
method Partial identification methods that do not require completeness of proxy variables.
result Obtain bounds on causal effects using available proxy 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…
The paper extends completeness notions to low-regularity spacetimes.
problem Defining completeness conditions for spacetimes with low-regularity metrics.
method Extending Beem's completeness notions to Lorentzian length spaces and proving relationships between them.
result Equivalence of completeness conditions for globally hyperbolic C1-spacetimes under certain conditions. We describe up to finite coverings causal flat affine complete Lorentzian manifolds such that the past and the future of any point are closed near this point. We say that these manifolds are strictly causal. In particular, we prove that their fundamental groups are virtually abelian. In dimension 4, there is only one, …
New method corrects bias in missing data for matrix completion.
problem Missing data bias in matrix completion.
method Causal model and synthetic nearest neighbors (SNN) method.
result Synthetic nearest neighbors (SNN) method provides consistent and normal estimates.
Single proxy variable helps estimate causal effects from confounders.
problem Estimating causal effects from treatment to outcome when unobserved confounders are present.
method Assumes a single, potentially multi-dimensional proxy variable of the unobserved confounder and a known mechanism generating the proxy from the confounder. Proves causal effects are identifiable under completeness assumption.
result Causal effects are identifiable under SPICE assumption.
Missing data are ubiquitous in many domains including healthcare. When these data entries are not missing completely at random, the (conditional) independence relations in the observed data may be different from those in the complete data generated by the underlying causal process. Consequently, simply applying existin…
New method reduces errors in causal discovery from data.
problem Errors in causal discovery from limited data.
method Hierarchical wrapper for constraint-based algorithms.
result Significantly fewer tests, more accurate graphs, shorter run-times.
New approach uses negative controls to estimate causal parameters without completeness conditions.
problem Estimating causal parameters when not all confounders are observed.
method Identification strategy based on minimax learning formulations for general function classes.
result Avoids completeness conditions and uniqueness assumptions on bridge functions.
Causal spacetimes with Ricci tensor have unique transformations.
problem Understanding transformations in viable causal spacetimes.
method Analyzing Ricci tensor and causal diffeomorphisms.
result Causal diffeomorphisms preserving Ricci tensor are homotheties.
A flat complete causal Lorentzian manifold is called {\it strictly causal} if the past and the future of each its point are closed near this point. We consider strictly causal manifolds with unipotent holonomy groups and assign to a manifold of this type four nonnegative integers (a signature) and a parabola in the con…
Estimate collapsibility of causal effects in CPDAGs via strong d-convex hulls.
problem Estimate causal effects in CPDAGs.
method Use strong d-convex hulls to characterize minimal collapsible sets.
result Efficient algorithm for obtaining collapsible sets in DAGs and CPDAGs.
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.
New model analyzes customer churn with tensor completion and binary data.
problem Analyzing the impact of interventions on customer churn.
method Tensorized latent factor block hazard model with 1-bit tensor completion.
result Effective categorization of interventions by similar impacts.
We review geometrical properties of a static spacetime (M,g), including geodesic completeness, causality, standard splittings, compact M, closed geodesics and geodesic connectedness. We pay special attention to the critical quadratic behavior at infinity of the coefficients β, β−1 (β=−g(K,K), being K a …
Proves globally hyperbolic spacetimes via null distance completeness.
problem No Hopf-Rinow Theorem in Lorentzian Geometry.
method Observation of null distances and their behavior with time functions.
result Proves globally hyperbolic spacetimes via null distance completeness.
New method identifies causal relationships in presence of hidden variables.
problem Identifying causal relationships when hidden variables exist.
method Established sufficient conditions and introduced a search algorithm.
result Proved soundness and completeness of the search algorithm.
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…
New estimator for causal effects in large datasets.
problem Unobserved confounding in large-scale data.
method Doubly robust estimator combining imputation, IPW, and cross-fitting.
result Error converges to Gaussian distribution at parametric rate.
This article contains detailed proofs and additional examples related to the UAI-2013 submission `Learning Sparse Causal Models is not NP-hard'. It describes the FCI+ algorithm: a method for sound and complete causal model discovery in the presence of latent confounders and/or selection bias, that has worst case polyno…
Revisits causal inference identifiability with positivity assumption.
problem General identifiability in causal inference without positivity assumption.
method Introduces new algorithm sound and complete under positivity assumption.
result New algorithm connects general identifiability to classical identifiability.
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.
On the Geroch-Kronheimer-Penrose future completion IP(X) of a spacetime X, there are two frequently used topologies. We systematically examine τ+, the stronger (metrizable) of them, which is the coarsest causally continuous topology, obtaining a variety of novel results, among them a complete characterization of…
Researchers extend the concept of metric spaces to Lorentzian spaces and prove the feasibility of their c-completion.
problem Extending the concept of metric spaces to Lorentzian spaces and proving their c-completion.
method Revisiting Lorentzian metric spaces, constructing c-completion, proving feasibility and endowing with Lorentzian metric space structure.
result The c-completion of Lorentzian metric spaces is feasible and well-suited, completing the original space in a precise sense.
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.
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.
Develops a framework for distributional Granger causality
problem Identifying predictive dependence in time series beyond Gaussian settings
method Using finite collection of channel-specific restrictions
result Identifies distributional Granger non-causality through testable hypotheses
Paper introduces v-CMC linking causality and utility.
problem Linking causality and utility for value theory.
method Developed a new causal independence principle (v-CMC) and proved its equivalence.
result Equivalence of local, global, and decomposition versions of v-CMC.
Causal graphs, such as directed acyclic graphs (DAGs) and partial ancestral graphs (PAGs), represent causal relationships among variables in a model. Methods exist for learning DAGs and PAGs from data and for converting DAGs to PAGs. However, these methods are significantly limited in that they only output a single cau…
Identifies causal effects in partially directed acyclic graphs with observed variables.
problem Identifying conditional causal effects in graphs with background knowledge and observed variables.
method Three results: identification formula, do calculus generalization, and algorithm completeness.
result Complete algorithm for identifying conditional effects in MPDAGs.
The study of low regularity (in-)extendibility of Lorentzian manifolds is motivated by the question whether a given solution to the Einstein equations can be extended (or is maximal) as a weak solution. In this paper we show that a timelike complete and globally hyperbolic Lorentzian manifold is C0-inextendible. For…
Study defines new products for Lorentzian spaces and analyzes causal diamonds.
problem Understanding causal diamonds in Lorentzian spaces.
method Introduced taxicab and uniform products for Lorentzian pre-length spaces. Defined D(RimesTX) space and analyzed its properties. result The space D(RimesTX) is geodesic and globally hyperbolic for complete X. We obtain some results in both Lorentz and Finsler geometries, by using a correspondence between the conformal structure (Causality) of standard stationary spacetimes on M=R×S and Randers metrics on S. In particular, for stationary spacetimes, we give a simple characterization of when they are causally conti…
The Links--Gould polynomial detects causality in spacetimes.
problem Detecting causality in spacetimes using link invariants.
method Using the Links--Gould polynomial, which specializes to the Alexander--Conway polynomial.
result The Links--Gould polynomial distinguishes Allen-Swenberg links and detects causality.
The causal compatibility question asks whether a given causal structure graph -- possibly involving latent variables -- constitutes a genuinely plausible causal explanation for a given probability distribution over the graph's observed variables. Algorithms predicated on merely necessary constraints for causal compatib…
Develops a new causal model for path-dependent link prediction.
problem Existing causal models assume fixed node factors, but real-world links can depend on existing ones.
method Introduces causal lifting and structural pairwise embeddings for path-dependent link prediction.
result Validated on three scenarios, demonstrating improved accuracy for causal link prediction.
Paper characterizes and represents pairwise causal background knowledge for improved causal inference.
problem Improving causal inference by handling pairwise causal constraints.
method Graphical characterization, direct causal clause (DCC), unified representation, MPDAG, polynomial-time algorithms.
result Pairwise causal background knowledge uniquely decomposes into MPDAG and DCCs, improving causal effect identification.
Causal knowledge is vital for effective reasoning in science, as causal relations, unlike correlations, allow one to reason about the outcomes of interventions. Algorithms that can discover causal relations from observational data are based on the assumption that all variables have been jointly measured in a single dat…
A new method selects covariates for causal effect estimation without strong assumptions.
problem Estimating causal effects without global causal structure learning and strong assumptions.
method Local covariate selection method that avoids pretreatment and causal sufficiency assumptions.
result The method achieves accurate causal effect estimation with improved computational efficiency.
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.
Identifying causal direction in location-scale noise models with hidden variables
problem Causal discovery in location-scale noise models with hidden variables
method ADMGs satisfying a bow-free condition
result First identifiability result for causally insufficient models beyond noise additivity
New distances for causal graphs improve evaluation of learned structures.
problem Difficulty in evaluating graphs learned by causal discovery algorithms.
method Developed a framework for causal distances, including new reachability algorithms.
result Improved distances are faster and more scalable than existing methods.
Establishes a version of Bartnik's conjecture for Lorentzian length spaces.
problem Proving Bartnik's conjecture for Lorentzian length spaces.
method Using timelike completeness and non-negative timelike curvature bounds, the causal boundary is shown to be a single point.
result A globally hyperbolic Lorentzian length space splits as a metric Lorentzian product.
The problem of using observed correlations to infer causal relations is relevant to a wide variety of scientific disciplines. Yet given correlations between just two classical variables, it is impossible to determine whether they arose from a causal influence of one on the other or a common cause influencing both, unle…