cs.LGOct 2, 2026

HyperFuse: Fast Self-Supervised Node Embeddings for Attributed Hypergraphs

Authors: Megha P, Harshit Kumar, Srajan Agarwal, Anirban Banerjee, Olaf Wolkenhauer, Saptarshi Bej

Organizations: School of Data Science, Indian Institute of Science Education and Research Thiruvananthapuram, Thiruvananthapuram, 695551, Kerala, India. · Department of Mathematics and Statistics, Indian Institute of Science Education and Research Kolkata, Mohanpur, 741246, West Bengal, India. · Institute of Computer Science, University of Rostock, Rostock, 18051, Germany. · Stellenbosch Institute for Advanced Study (STIAS), Stellenbosch, South Africa.

Abstract

Self-supervised hypergraph representation learning can produce informative node embeddings, but existing methods often require deep encoders trained for hundreds of epochs, making embedding generation costly even for hypergraphs with a few thousand nodes. This limits applications requiring embeddings for many or evolving hypergraphs. We present HyperFuse, a label-free pipeline for fast hypergraph representation learning. HyperFuse (i) computes structural node coordinates by maximizing a spectral relaxation of hypergraph modularity using Banerjee's hypergraph adjacency and a matrix-free operator with cost linear in node-hyperedge incidences; (ii) constructs multi-scale feature summaries and assigns bounded utility weights to hyperedges based on member stability under feature and membership masking; and (iii) trains a lightweight utility-weighted hypergraph encoder for 100 epochs using an invariance-decorrelation objective. We compare HyperFuse with TriCL, SE-HSSL, VilLain, and HypeBoy on nine public hypergraphs using six downstream classifiers and k-means clustering. On the eight datasets where all methods completed, HyperFuse required 8.7 s per dataset on average, achieving 13-179x geometric-mean speed-ups over the baselines. It achieved the highest average accuracy with five of six classifiers, while classification and clustering performance was not significantly different from TriCL and SE-HSSL. Compared with HypeBoy, HyperFuse was 13x faster and 2.1-4.1 percentage points more accurate across all classifiers. HyperFuse provides a practical approach for fast, repeated hypergraph embedding generation.

Figures & tables

Appendix figures & tables15 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. From Representation to Clusters: A Contrastive Learning Approach for Attributed Hypergraph Clustering

    Mar 10, 2026Li Ni, Shuaikang Zeng, Lin Mu +1Hypergraph LearningDeep Clustering

  2. BHyGNN+: Unsupervised Representation Learning for Heterophilic Hypergraphs

    Feb 16, 2026Tianyi Ma, Yiyue Qian, Zehong Wang +3Hypergraph LearningHypergraph Neural Networks

  3. A Unified Framework of Hyperbolic Graph Representation Learning Methods

    Apr 30, 2026Sofía Pérez Casulo, Marcelo Fiori, Bernardo Marenco +1Graph Representation LearningGraph Embedding