Adaptive and Reinforcement-Guided Contrastive Hypergraph Distillation
Abstract
Hypergraph-based distillation methods have been proposed to mitigate the high computational cost of Hypergraph Neural Networks (HGNNs) in modeling high-order relationships. However, most existing methods use static and uniform distillation strategies for all nodes and hyperedges, ignoring their individual characteristics. In addition, they neglect the student model's capability to independently extract useful internal features. As a result, they are not effective in transferring higher-order structural knowledge from the teacher. To overcome these limitations, we propose ARCHER, an Adaptive and Reinforcement-Guided Contrastive HypER graph Distillation framework that enables a lightweight MLP student model to outperform its HGNN teacher model. First, we design an adaptive strategy that leverages node- and hyperedge-level confidence to mediate error guidance from the teacher model. Second, we introduce a contrastive learning module that guides the student to learn from both the teacher's outputs and its own internal representations, producing more expressive embeddings. Finally, we propose a multi-armed bandit-based reinforcement learning module that dynamically balances multiple loss objectives during training. Experiments on six benchmark datasets demonstrate that our method outperforms existing hypergraph distillation methods.
Fields of Study & Subjects
Advanced Graph Neural Networks
Graph Theory and Algorithms
Complex Network Analysis Techniques
Publication details
- Journal / source
- ACM International Conference on Web Search and Data Mining (WSDM)
- Pages
- 778–787
- Publication date
- 16 February 2026
- Language
- EN