HyperMixup: Hypergraph-Augmented with Higher-order Information Mixup
Kaixuan Yao, Zhuo Li, Jianqing Liang, Jiye Liang, Ming Li, Feilong Cao
Abstract
Hypergraphs offer a natural paradigm for modeling complex systems with multi-way interactions. Hypergraph neural networks (HGNNs) have demonstrated remarkable success in learning from such higher-order relational data. While such higher-order modeling enhances relational reasoning, the effectiveness of hyper-graph learning remains bottlenecked by two persistent challenges: the scarcity of labeled data inherent to complex systems, and the vulnerability to structural noise in real-world interaction patterns. Traditional data augmentation methods, though successful in Euclidean and graph-structured domains, struggle to preserve the intricate balance between node features and hyperedge semantics, often disrupting the very group-wise interactions that define hypergraph value. To bridge this gap, we present HyperMixup, a hypergraph-aware augmentation framework that preserves higher-order interaction patterns through structure-guided feature mixing. Specifically, HyperMixup contains three critical components: 1) Structure-aware node pairing guided by joint feature-hyperedge similarity metrics, 2) Context-enhanced hierarchical mixing that preserves hyperedge semantics through dual-level feature fusion, and 3) Adaptive topology reconstruction mechanisms that maintain hypergraph consistency while enabling controlled diversity expansion. Theoret-ically, we establish that our method induces hypergraph-specific regularization effects through gradient alignment with hyperedge covariance structures, while providing robustness guarantees against combined node-hyperedge perturbations. Comprehensive experiments across diverse hypergraph learning tasks demonstrate consistent performance improvements over state-of-the-art baselines, with particular effectiveness in low-label regimes. The proposed framework advances hypergraph representation learning by unifying data augmentation with higher-order topological constraints, offering both practical utility and theoretical insights for relational machine learning
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 45d13157-045f-4314-a375-62e79ee6c3f5Builds on11
- CutMix: Regularization Strategy to Train Strong Classifiers With Localizable FeaturesSangdoo Yun, Dongyoon Han, Sanghyuk Chun, Seong Joon Oh et al.ICCV 2019 · 5,843 citations
- Graph Contrastive Learning with AugmentationsYuning You, Tianlong Chen, Yongduo Sui, Ting Chen et al.NeurIPS 2020 · 3,042 citations
- G-Mixup: Graph Data Augmentation for Graph ClassificationXiaotian Han, Zhimeng Jiang, Ninghao Liu, Xia HuICML 2022 · 251 citations
- Mixup for Node and Graph ClassificationYiwei Wang, Wei Wang, Yuxuan Liang, Yujun Cai et al.WWW 2021 · 220 citations
- Be More with Less: Hypergraph Attention Networks for Inductive Text ClassificationKaize Ding, Jianling Wang, Jundong Li, Dingcheng Li et al.EMNLP 2020 · 210 citations
Related papers
- Augmentations in Hypergraph Contrastive Learning: Fabricated and GenerativeTianxin Wei, Yuning You, Tianlong Chen, Yang Shen et al.NeurIPS 2022 · 96 citations
- Hypergraph Joint Representation Learning for Hypervertices and Hyperedges via Cross ExpansionYuguang Yan, Yuanlin Chen, Shibo Wang, Hanrui Wu et al.AAAI 2024 · 20 citations
- ReLaSH: Reconstructing Joint Latent Spaces for Efficient Generation of Synthetic Hypergraphs with Hyperlink AttributesFeiyan Ma, Shihao Wu, Gongjun Xu, Ji ZhuICLR 2026
- Hypergraph-Enhanced Contrastive Learning for Multi-View Clustering with Hyper-Laplacian RegularizationZhibin Gu, Weili WangNeurIPS 2025 · 7 citations
- Hypergraph-enhanced Dual Semi-supervised Graph ClassificationWei Ju, Zhengyang Mao, Siyu Yi, Yifang Qin et al.ICML 2024 · 39 citations
