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

PC/FCI algo: FDR by leveraging the storage of maximum pvalues / minimum test statistics between pairs of edges #24

Open
adam2392 opened this issue Aug 23, 2022 · 0 comments
Labels
constraint-algorithm Constraint based discovery algorithms

Comments

@adam2392
Copy link
Collaborator

Is your feature request related to a problem? Please describe.
Implement: https://www.jmlr.org/papers/volume10/li09a/li09a.pdf

Describe the solution you'd like
Basically perform FDR procedure on sets of pvalues over the entire graph.

Note that the storage cost will go up since we need to keep track of these values

Additional context
Came up in #18

@adam2392 adam2392 added the constraint-algorithm Constraint based discovery algorithms label Nov 21, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
constraint-algorithm Constraint based discovery algorithms
Projects
None yet
Development

No branches or pull requests

1 participant