English

How Reliable are Causal Probing Interventions?

Machine Learning 2025-12-23 v5 Artificial Intelligence Computation and Language

Abstract

Causal probing aims to analyze foundation models by examining how intervening on their representation of various latent properties impacts their outputs. Recent works have cast doubt on the theoretical basis of several leading causal probing methods, but it has been unclear how to systematically evaluate the effectiveness of these methods in practice. To address this, we define two key causal probing desiderata: completeness (how thoroughly the representation of the target property has been transformed) and selectivity (how little non-targeted properties have been impacted). We find that there is an inherent tradeoff between the two, which we define as reliability, their harmonic mean. We introduce an empirical analysis framework to measure and evaluate these quantities, allowing us to make the first direct comparisons between different families of leading causal probing methods (e.g., linear vs. nonlinear, or concept removal vs. counterfactual interventions). We find that: (1) all methods show a clear tradeoff between completeness and selectivity; (2) more complete and reliable methods have a greater impact on LLM behavior; and (3) nonlinear interventions are almost always more reliable than linear interventions. Our project webpage is available at: https://ahdavies6.github.io/causal_probing_reliability/

Keywords

Cite

@article{arxiv.2408.15510,
  title  = {How Reliable are Causal Probing Interventions?},
  author = {Marc Canby and Adam Davies and Chirag Rastogi and Julia Hockenmaier},
  journal= {arXiv preprint arXiv:2408.15510},
  year   = {2025}
}

Comments

In Proceedings of IJCNLP-AACL, 2025

R2 v1 2026-06-28T18:26:08.376Z