CORE: Data Augmentation for Link Prediction via Information Bottleneck
<|reference_start|>CORE: Data Augmentation for Link Prediction via Information Bottleneck: Link prediction (LP) is a fundamental task in graph representation learning, with numerous applications in diverse domains. However, the generalizability of LP models is often compromised due to the presence of noisy or spurious information in graphs and the inherent incompleteness of graph data. To address these challenges, we draw inspiration from the Information Bottleneck principle and propose a novel data augmentation method, COmplete and REduce (CORE) to learn compact and predictive augmentations for LP models. In particular, CORE aims to recover missing edges in graphs while simultaneously removing noise from the graph structures, thereby enhancing the model's robustness and performance. Extensive experiments on multiple benchmark datasets demonstrate the applicability and superiority of CORE over state-of-the-art methods, showcasing its potential as a leading approach for robust LP in graph representation learning.<|reference_end|>
@article{dong2024core:,
    title={CORE: Data Augmentation for Link Prediction via Information Bottleneck},
    author={Kaiwen Dong, Zhichun Guo, Nitesh V. Chawla},
    journal={arXiv preprint arXiv:2404.11032},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.11032},
    primaryClass={cs.LG cs.SI}
}