Computational Identifiability

• URL: http://arxiv.org/abs/2606.19361v1
• Date: Mon, 08 Jun 2026 19:39:59 GMT
• Title: Computational Identifiability
• Abstract summary: 'Identical identifiability' assumes properties, infinite data, or other mathematically idealized conditions.<n>'Computational identifiability' is to instead define a finite computational search procedure for an empirical estimator.<n>We show how this framework allows us to answer fine-grained, practical identification questions.
• Score: 58.12019389497595
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Identification conditions describe the computability of a target query or parameter of interest as a function of the type and amount of information available. In causal identification, this information is often expressed in the form of a causal graph, and data are observed or collected for some subset of variables in the graph. Target queries may be for a single effect alone or for a class of effects in a given model. The derivation of an identification algorithm then defines mathematically the process by which the desired causal effect(s) can be uniquely determined, theoretically, in expectation. Identifiability in expectation, or 'theoretical identifiability,' generally assumes asymptotic properties, infinite data, or other mathematically idealized conditions. In this paper, we explore a fundamental distinction between this theoretical, idealized notion of identifiability and a proposed alternative that is computation-bound. The framework we propose - 'computational identifiability' - is to instead define a finite computational search procedure for an empirical estimator. If this process finds an estimator empirically, within a desired error tolerance, then identifiability is satisfied, conditional on the specified assumptions of the search (i.e., a prior distribution over the parameters) and conditional on the search procedure itself. Through several experiments, we demonstrate how this framework allows us to answer fine-grained, practical identification questions, such as identification with small finite samples, with ambiguous graphical criteria, with mixed observational-interventional data, and across counterfactual data and estimands. Code is available at https://github.com/lbynum/metadentify.

Related papers

• Uncertainty quantification in mechanics: A unified Bayesian perspective [0.0]
  Uncertainty quantification (UQ) is essential to experimental mechanics, but has become particularly relevant in computational mechanics.<n>We show that Bayesian probability theory provides a unified theoretical framework for addressing both problem types.<n>While this theoretical framework is presented for general mechanical problems, particular emphasis is placed on biomechanics, where variability and uncertainty is especially pronounced.
  arXiv  Detail & Related papers  (2026-07-21T05:46:28Z)
• Identifying Information from Observations with Uncertainty and Novelty [7.088298584035036]
  This paper formalizes the notion of identifiable information that arises from the language used to express the relationship between distinct states.<n>We prove that computable PAC-Bayes learners' sample complexity distribution is determined by its moments in terms of the prior probability distribution over a fixed finite hypothesis set.
  arXiv  Detail & Related papers  (2025-01-16T07:02:05Z)
• Detecting and Identifying Selection Structure in Sequential Data [53.24493902162797]
  We argue that the selective inclusion of data points based on latent objectives is common in practical situations, such as music sequences. We show that selection structure is identifiable without any parametric assumptions or interventional experiments. We also propose a provably correct algorithm to detect and identify selection structures as well as other types of dependencies.
  arXiv  Detail & Related papers  (2024-06-29T20:56:34Z)
• Learning to Bound Counterfactual Inference in Structural Causal Models from Observational and Randomised Data [64.96984404868411]
  We derive a likelihood characterisation for the overall data that leads us to extend a previous EM-based algorithm. The new algorithm learns to approximate the (unidentifiability) region of model parameters from such mixed data sources. It delivers interval approximations to counterfactual results, which collapse to points in the identifiable case.
  arXiv  Detail & Related papers  (2022-12-06T12:42:11Z)
• Bounding Counterfactuals under Selection Bias [60.55840896782637]
  We propose a first algorithm to address both identifiable and unidentifiable queries. We prove that, in spite of the missingness induced by the selection bias, the likelihood of the available data is unimodal.
  arXiv  Detail & Related papers  (2022-07-26T10:33:10Z)
• The Proximal ID Algorithm [9.190358641395848]
  Unobserved confounding is a fundamental obstacle to establishing valid causal conclusions from observational data. We develop a synthesis of the former and latter approaches to identification in causal inference. Our approach allows us to systematically exploit proxies to adjust for the presence of unobserved confounders.
  arXiv  Detail & Related papers  (2021-08-15T21:32:47Z)
• Typing assumptions improve identification in causal discovery [123.06886784834471]
  Causal discovery from observational data is a challenging task to which an exact solution cannot always be identified. We propose a new set of assumptions that constrain possible causal relationships based on the nature of the variables.
  arXiv  Detail & Related papers  (2021-07-22T14:23:08Z)
• Nested Counterfactual Identification from Arbitrary Surrogate Experiments [95.48089725859298]
  We study the identification of nested counterfactuals from an arbitrary combination of observations and experiments. Specifically, we prove the counterfactual unnesting theorem (CUT), which allows one to map arbitrary nested counterfactuals to unnested ones.
  arXiv  Detail & Related papers  (2021-07-07T12:51:04Z)
• Identifying Causal Effects via Context-specific Independence Relations [9.51801023527378]
  Causal effect identification considers whether an interventional probability distribution can be uniquely determined from a passively observed distribution. We show that deciding causal effect non-identifiability is NP-hard in the presence of context-specific independence relations. Motivated by this, we design a calculus and an automated search procedure for identifying causal effects in the presence of CSIs.
  arXiv  Detail & Related papers  (2020-09-21T11:38:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.