Learning to Compress Graphs via Dual Agents for Consistent Topological Robustness Evaluation
Qisen Chai, Yansong Wang, Junjie Huang, Tao Jia

TL;DR
This paper introduces Cutter, a dual-agent reinforcement learning framework that compresses large graphs into smaller, topologically faithful representations, enabling efficient and reliable robustness evaluation against adversarial attacks.
Contribution
The paper presents a novel dual-agent RL approach with innovative reward shaping and imitation strategies for graph compression that preserves robustness profiles.
Findings
Cutter produces compressed graphs maintaining key topological features.
Compressed graphs exhibit robustness degradation similar to original graphs under attacks.
The method significantly improves evaluation efficiency without losing fidelity.
Abstract
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 structure and robustness profile, enabling efficient and reliable evaluation. We propose Cutter, a dual-agent reinforcement learning framework composed of a Vital Detection Agent (VDA) and a Redundancy Detection Agent (RDA), which collaboratively identify structurally vital and redundant nodes for guided compression. Cutter incorporates three key strategies to enhance learning efficiency and compression quality: trajectory-level reward shaping to transform sparse trajectory returns into dense, policy-equivalent learning signals; prototype-based shaping to guide decisions using behavioral patterns from both high-…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsAdvanced Graph Neural Networks · Adversarial Robustness in Machine Learning · Graph Theory and Algorithms
