Finding Front-Door Adjustment Sets in Linear Time
share
Front-door adjustment is a classic technique to estimate causal effects from a specified directed acyclic graph (DAG) and observed data. The advantage of this approach is that it uses observed mediators to identify causal effects, which is possible even in the presence of unobserved confounding. While the statistical properties of the front-door estimation are quite well understood, its algorithmic aspects remained unexplored for a long time. Recently, Jeong, Tian, and Barenboim [NeurIPS 2022] have presented the first polynomial-time algorithm for finding sets satisfying the front-door criterion in a given DAG, with an O(n^3(n+m)) run time, where n denotes the number of variables and m the number of edges of the graph. In our work, we give the first linear-time, i.e. O(n+m), algorithm for this task, which thus reaches the asymptotically optimal time complexity, as the size of the input is Ω(n+m). We also provide an algorithm to enumerate all front-door adjustment sets in a given DAG with delay O(n(n + m)). These results improve the algorithms by Jeong et al. [2022] for the two tasks by a factor of n^3, respectively.
READ FULL TEXT
