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.
Causal identification from counterfactual data: Com- pleteness and bounding results.arXiv preprint arXiv:2602.23541, 2026
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.