Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

A function for enumerating backdoor adjustment sets in causal graphs #35

Open
adam2392 opened this issue Jan 10, 2023 · 0 comments
Open
Labels
Algorithms Related to graphical algorithms
Milestone

Comments

@adam2392
Copy link
Collaborator

Is your feature request related to a problem? Please describe.
In causal estimation tasks, one is interested in typically using covariate adjustment to estimate the total causal effects given a fully specified causal graph (i.e. nx.DiGraph, or pywhy_graphs.ADMG).

In addition, these sets exist for Markov equivalence classes as well: pywhy_graphs.CPDAG and pywhy_graphs.PAG

Describe the solution you'd like
Implement https://www.jmlr.org/papers/volume18/16-319/16-319.pdf construction algorithm.

The implementation should be careful to note computational complexity of the algorithms. For example, many graph set listing algorithms are exponential in the number of variables, so ideally this function returns a generator, rather than a fully specified list.

@adam2392 adam2392 added the Algorithms Related to graphical algorithms label Feb 10, 2023
@adam2392 adam2392 added this to the v0.2 milestone Feb 20, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Algorithms Related to graphical algorithms
Projects
None yet
Development

No branches or pull requests

1 participant