Formalizes the max-potency problem for cost-constrained experiment selection to tighten bounds on causal queries, proves NP-hardness, and introduces two graphical pruning criteria that reduce the search space by 50-88% on average.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal Experiments for Partial Causal Effect Identification
Formalizes the max-potency problem for cost-constrained experiment selection to tighten bounds on causal queries, proves NP-hardness, and introduces two graphical pruning criteria that reduce the search space by 50-88% on average.