Optimal adjustment sets for causal query estimation in partially observed biomolecular networks

• Published in: Bioinformatics (Oxford, England) Vol. 39; no. Supplement_1; pp. i494 - i503
• Main Authors: Mohammad-Taheri, Sara, Tewari, Vartika, Kapre, Rohan, Rahiminasab, Ehsan, Sachs, Karen, Tapley Hoyt, Charles, Zucker, Jeremy, Vitek, Olga
• Format: Journal Article
• Language: English
• Published: England Oxford University Press 30.06.2023
• Subjects: Computational Biology; Computer Simulation; Systems Biology and Networks
• ISSN: 1367-4803; 1367-4811; 1367-4811
• DOI: 10.1093/bioinformatics/btad270

Abstract Causal query estimation in biomolecular networks commonly selects a ‘valid adjustment set’, i.e. a subset of network variables that eliminates the bias of the estimator. A same query may have multiple valid adjustment sets, each with a different variance. When networks are partially observed, current methods use graph-based criteria to find an adjustment set that minimizes asymptotic variance. Unfortunately, many models that share the same graph topology, and therefore same functional dependencies, may differ in the processes that generate the observational data. In these cases, the topology-based criteria fail to distinguish the variances of the adjustment sets. This deficiency can lead to sub-optimal adjustment sets, and to miss-characterization of the effect of the intervention. We propose an approach for deriving ‘optimal adjustment sets’ that takes into account the nature of the data, bias and finite-sample variance of the estimator, and cost. It empirically learns the data generating processes from historical experimental data, and characterizes the properties of the estimators by simulation. We demonstrate the utility of the proposed approach in four biomolecular Case studies with different topologies and different data generation processes. The implementation and reproducible Case studies are at https://github.com/srtaheri/OptimalAdjustmentSet.