Skip to content

Symmetry-Informed Causal Partial Identification

Oct 2026 · 0 citations · 91 references
Computer Science

TL;DR

This work introduces known data symmetries -- invariance of the causal effect under certain data transformations -- as a new source of constraints to inform PI, and operationalizes this as a shape constraint on the causal function and via a change of measure against which PI is posed using simple data pre-processing.

Abstract

Partial identification (PI) entails estimating bounds on causal effects by encoding different assumptions on data generation as a constrained optimization problem. Such bounds can suffice to inform policy decisions even if the causal effect itself is not identifiable. Often vacuous in practice, practitioners seek to exhaustively encode domain knowledge as additional constraints to make the PI bounds more informative. We introduce known data symmetries -- invariance of the causal effect under certain data transformations -- as a new source of constraints to inform PI. We operationalize this as a shape constraint on the causal function, and via a change of measure against which PI is posed using simple data pre-processing. Both approaches are shown to sharpen bounds under two canonical PI models. This is shown both theoretically for the population case, and via experiments in the finite-sample case. More broadly, our framework establishes data symmetries as a natural, underutilized source of background knowledge for robust causal inference.

View source

Similar papers

Preprint Oct 2026

The Missing Corner: When Sharp Causal Bounds Fail to Compose

Sharp bounds on two potential-outcome means need not combine into sharp bounds on their difference. We characterize exactly when composition is guaranteed across environments sharing a joint potential-outcome law. For binary treatment and outcome, fix strict selection-probability bounds and interior treatment propensit...

Yi-Cheng Qi, Xiao Xiong · 0 citations
Preprint Sep 2026

Functional Causal Discovery via Conditional Covariance Ordering

We study causal discovery where each node is a random function. Previous studies on this topic rely on structural assumptions, e.g., linearity or non-linearity, and distributional assumptions, e.g., Gaussianity or non-Gaussianity. In contrast, we make use of covariance operators to avoid these assumptions. Under functi...

Ke-Yu Li, Ruo-Xu Tan · 0 citations
#machine learning Preprint Sep 2026

The Statistical Cost of Causal Discovery with Feedback

What determines the unavoidable sample cost of learning cyclic causal structure? For cyclic linear non-Gaussian models, we study exact condensation recovery from observational data: identifying the strongly connected component (SCC) partition and all edges between components. We establish the first information-theoreti...

Sunmin Oh, Seung-Su Han, Gunwoong Park · 0 citations
#machine learning Preprint Sep 2026

Decoupled Causal Discovery

Decoupled Causal Discovery is proposed, a novel decoupling-based perspective that does not rely on conditional independence tests, structure scores, or restrictive functional assumptions, and establishes the theoretical identifiability, soundness, and completeness of DCD.

Zheng Guan, Fei Wu, Kun Kuang · 0 citations
Preprint Nov 2026

A General Approach for Assessing Sensitivity to Violations of Causal Assumptions

Although causal sensitivity analyses are widely used to assess the robustness of conclusions, a key limitation is that existing methods are typically developed for specific designs. This paper develops a general sensitivity analysis framework that applies to a wide range of discrete causal models and estimands by deriv...

G. Duarte · 0 citations
Preprint Sep 2026

Credible Bounds for Causal Quantities with Continuous Outcomes

The problem of partial identification concerns bounding causal quantities that remain unidentifiable given the observed distribution and the causal diagram of the underlying structural causal model (SCM). While bounds have been developed for certain causal quantities with continuous outcomes, they are necessarily univa...

J. Saporta · 0 citations

Related blog posts

MIT News · Artificial Intelligence Nov 17, 2026

Learning the language of machine learning

By studying the computational foundations of language learning, Associate Professor Jacob Andreas builds intelligent systems that can communicate effectively with humans.

Microsoft Research Blog Nov 16, 2026

TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient

AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.