Optimal Experiments for Partial Causal Effect Identification

The paper tackles selecting a cost‑constrained set of experiments that most effectively tighten bounds on a partially identifiable causal query. It formalizes this as the NP‑hard max‑potency problem, introduces efficient graphical pruning rules to reduce the search space, and demonstrates the approach on synthetic graphs and real NHANES data to estimate the effect of physical activity on diabetes.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

• efficiency
• benchmarks