Qisen Chai

Learning to Compress Graphs via Dual Agents for Consistent Topological Robustness Evaluation

2026 · Proceedings of the AAAI Conference on Artificial Intelligence

As graph-structured data grow increasingly large, evaluating their robustness under adversarial attacks becomes computationally expensive and difficult to scale. To address this challenge, we propose to compress graphs into compact representations that preserve both topological …