arXiv:2510. 16703v3 Announce Type: replace-cross Abstract: The classical notion of causal effect identifiability is defined in terms of treatment and outcome variables.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
The paper tackles the problem of estimating causal effects when an unobserved confounder is present. It assumes a single, possibly multi‑dimensional proxy variable for the confounder and knowledge of the mechanism that generates this proxy. Under the Single Proxy Identifiability of Causal Effects (SPICE) assumption, the authors prove that the error mechanism is complete and causal effects are identifiable, extending prior proxy‑based results to continuous, multi‑dimensional settings and more flexible functional forms. They also introduce SPICE‑Net, a neural‑network‑based framework for estimating causal effects applicable to both discrete and continuous treatments.
arXiv:2608. 10664v1 Announce Type: new Abstract: The Relativity of Causal Knowledge (RCK) explains how a network of agents with different structural causal models can exchange causal knowledge through a shared interventionally consistent abstraction, or backbone.
arXiv:2606. 00278v1 Announce Type: new Abstract: For many real-world systems, causal ground truth is difficult to obtain, making claims about causal effects hard to assess.
The paper introduces a formal framework that uses symmetries in data to keep causal mechanisms invariant, providing a simple and general mathematical language for causal reasoning. It outlines how to describe models and queries, and presents strategies for rigorously identifying causal effects from data within this framework. The approach reproduces known results for IID data and extends causal analysis to non‑IID settings, complex queries beyond do‑ or soft‑interventions, and incorporates missing data, transfer, and robustness considerations.
arXiv:2607. 11816v1 Announce Type: new Abstract: Causal discovery algorithms learn a network that describes the causal dependencies among random variables.
The paper introduces causal foundation models that can bound the effects of interventions and counterfactuals using only observational data. It defines a canonical prior with full support over structural causal models with discrete observables, enabling the translation of counterfactual bounding into learning distributions over functions that map data and structural assumptions to causal queries. This approach extends causal foundational modelling to partially-identifiable causal effects, where unobserved confounding leads to multiple compatible values for the effect.