Skip to content

Latest commit

 

History

History
3 lines (3 loc) · 368 Bytes

File metadata and controls

3 lines (3 loc) · 368 Bytes

graph-information-bottleneck-for-subgraph-recognition

Code for the paper "Graph Information Bottleneck for Subgraph Recognition" in ICLR 2021. Something important: there is a MI_est function where I implement multiple estimators in trian_eval.py of graph classfication task. Please use Donsker-varadhan estimator as recommended in our paper instead of the last one.