HyperMixup: Hypergraph-Augmented with Higher-order Information Mixup
Kaixuan Yao, Zhuo Li, Jianqing Liang, Jiye Liang, Ming Li, Feilong Cao
摘要
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
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper11
- CutMix: Regularization Strategy to Train Strong Classifiers With Localizable FeaturesSangdoo Yun, Dongyoon Han, Sanghyuk Chun, Seong Joon Oh 等ICCV 2019 · 被引用 5,843 次
- Graph Contrastive Learning with AugmentationsYuning You, Tianlong Chen, Yongduo Sui, Ting Chen 等NeurIPS 2020 · 被引用 3,042 次
- G-Mixup: Graph Data Augmentation for Graph ClassificationXiaotian Han, Zhimeng Jiang, Ninghao Liu, Xia HuICML 2022 · 被引用 251 次
- Mixup for Node and Graph ClassificationYiwei Wang, Wei Wang, Yuxuan Liang, Yujun Cai 等WWW 2021 · 被引用 220 次
- Be More with Less: Hypergraph Attention Networks for Inductive Text ClassificationKaize Ding, Jianling Wang, Jundong Li, Dingcheng Li 等EMNLP 2020 · 被引用 210 次
相关 Paper
- Augmentations in Hypergraph Contrastive Learning: Fabricated and GenerativeTianxin Wei, Yuning You, Tianlong Chen, Yang Shen 等NeurIPS 2022 · 被引用 96 次
- Hypergraph Joint Representation Learning for Hypervertices and Hyperedges via Cross ExpansionYuguang Yan, Yuanlin Chen, Shibo Wang, Hanrui Wu 等AAAI 2024 · 被引用 20 次
- 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 次
- Hypergraph-enhanced Dual Semi-supervised Graph ClassificationWei Ju, Zhengyang Mao, Siyu Yi, Yifang Qin 等ICML 2024 · 被引用 39 次
