The paper defines computational identifiability as success of a finite search procedure in finding an empirical estimator for a causal query within error tolerance, conditional on the search assumptions and procedure.
Correa and Elias Bareinboim , title =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LG 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
POSCMs extend structural causal models to latent contexts that co-determine both graph structure and mechanisms, supported by an identifiability theory and validation in a retina simulator.
citing papers explorer
-
Computational Identifiability
The paper defines computational identifiability as success of a finite search procedure in finding an empirical estimator for a causal query within error tolerance, conditional on the search assumptions and procedure.
-
Partially Observed Structural Causal Models
POSCMs extend structural causal models to latent contexts that co-determine both graph structure and mechanisms, supported by an identifiability theory and validation in a retina simulator.