Search Results for author:
Found 1 papers, 0 papers with code
Unifying Invariance and Spuriousity for Graph Out-of-Distribution via Probability of Necessity and Sufficiency
Under mild conditions, we show that the invariant subgraph can be extracted by minimizing an upper bound, which is built on the theoretical advance of probability of necessity and sufficiency.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
