{ "id": "ep3tbb6m3b", "slug": "hypergraph-neural-network", "title": "Hypergraph neural network", "updated": "2026-10-15", "topic_path": [ { "id": "technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/topics/technology" }, { "id": "technology.computing", "label": "Computing and digital systems", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing" }, { "id": "technology.computing.ai", "label": "Artificial intelligence and data", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai" }, { "id": "technology.computing.ai.ml_computation", "label": "Machine learning and neural computation", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.ml_computation" }, { "id": "technology.computing.ai.neural_deep", "label": "Neural networks and deep learning", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.neural_deep" }, { "id": "technology.computing.ai.nn_architectures", "label": "Neural network architectures", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.nn_architectures" }, { "id": "technology.computing.ai.nn_architectures.graph_networks", "label": "Graph neural network architectures", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.nn_architectures.graph_networks" } ], "geo": [ { "id": "geo.nongeo.t2001.technology.computing.ai.neural_deep", "label": "Non-geographic · 2001 to 2020: Neural networks and deep learning", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.neural_deep", "path": [ { "id": "geo.nongeo", "label": "Non-geographic", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo" }, { "id": "geo.nongeo.t2001", "label": "Non-geographic · 2001 to 2020", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001" }, { "id": "geo.nongeo.t2001.technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology" }, { "id": "geo.nongeo.t2001.technology.computing", "label": "Computing and digital systems", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing" }, { "id": "geo.nongeo.t2001.technology.computing.ai", "label": "Artificial intelligence and data", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai" }, { "id": "geo.nongeo.t2001.technology.computing.ai.ml_computation", "label": "Machine learning and neural computation", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.ml_computation" }, { "id": "geo.nongeo.t2001.technology.computing.ai.neural_deep", "label": "Neural networks and deep learning", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.neural_deep" } ] } ], "excerpt": "A hypergraph neural network (HNN or HGNN) is a graph neural network that operates on hypergraphs, where one hyperedge connects any number of nodes, serving node classification and recommendation.", "snippet": "A hypergraph neural network (HNN or HGNN) is a graph neural network that operates on hypergraphs, where one hyperedge connects any number of nodes, serving node classification and recommendation.", "node": "technology.computing.ai.nn_architectures.graph_networks", "markdown": "# Hypergraph neural network\n\nA hypergraph neural network (HNN or HGNN) is a graph neural network that operates on a hypergraph, a structure in which one hyperedge can connect any number of nodes, so that information propagates across higher-order group relationships rather than only pairwise links. It serves node classification, hyperedge prediction, and recommendation, among other tasks.[1](https://ojs.aaai.org/index.php/AAAI/article/download/4235/4113) Group interactions such as co-purchases, co-citations, or a set of items clicked in one session lose information when squeezed into pairwise edges, which is the motivation for keeping the hypergraph structure.[2](https://papers.nips.cc/paper/2006/file/dff8e9c2ac33381546d96deea9922999-Paper.pdf)\n\n| Key fact | Value |\n|---|---|\n| Input | Node features plus an incidence matrix \\( H \\in \\mathbb{R}^{N \\times M} \\) over \\( N \\) nodes and \\( M \\) hyperedges[1](https://ojs.aaai.org/index.php/AAAI/article/download/4235/4113) |\n| Core layer | \\( X^{(l+1)} = \\sigma(D_{v}^{-1/2} H \\cdot W \\cdot D_{e}^{-1} \\cdot H^{\\top} \\cdot D_{v}^{-1/2} \\cdot X^{(l)} \\cdot \\Theta^{(l)}) \\)[1](https://ojs.aaai.org/index.php/AAAI/article/download/4235/4113) |\n| Tasks | Node classification, hyperedge prediction, recommendation[3](https://dl.acm.org/doi/10.1145/3637528.3671457) |\n| Benchmark accuracy (HGNN paper splits) | 81.6% Cora, 80.1% Pubmed (100-run averages)[1](https://ojs.aaai.org/index.php/AAAI/article/download/4235/4113) |\n| Reported accuracy range on Cora | 58.2% to 81.6% depending on paper and split[4](https://doi.org/10.48550/arxiv.2006.12278) |\n| Main failure modes | Over-smoothing, over-squashing, incidence-matrix scalability[5](https://arxiv.org/html/2503.07959v1) |\n\n## How it works\n\nThe hypergraph is represented by a binary [incidence matrix](https://www.edgepedia.org/incidence-matrix) \\( H \\), where entry \\( H_{ij} = 1 \\) means node \\( i \\) belongs to hyperedge \\( j \\). Node degree counts the hyperedges containing a node; hyperedge degree counts the nodes in a hyperedge; both are row and column sums of \\( H \\).[6](https://www.dgl.ai/dgl_docs/notebooks/sparse/hgnn.html) The original HGNN layer propagates features through the normalized hypergraph Laplacian,[1](https://ojs.aaai.org/index.php/AAAI/article/download/4235/4113)\n\n\\[ X^{(l+1)} = \\sigma\\left( D_{v}^{-1/2} H \\cdot W \\cdot D_{e}^{-1} \\cdot H^{\\top} \\cdot D_{v}^{-1/2} \\cdot X^{(l)} \\cdot \\Theta^{(l)} \\right), \\]\n\nwhere \\( W = \\mathrm{diag}(w_{1}, \\ldots, w_{M}) \\) holds hyperedge weights and \\( \\Theta \\in \\mathbb{R}^{C_{1} \\times C_{2}} \\) is learned. DGL implements the same operator as \\( L = D_{v}^{-1/2} H \\cdot B \\cdot D_{e}^{-1} \\cdot H^{\\top} \\cdot D_{v}^{-1/2} \\) with \\( B \\) a diagonal hyperedge-weight matrix, applied as \\( f(X^{(l)}, H; W^{(l)}) = \\sigma(L \\cdot X^{(l)} \\cdot W^{(l)}) \\).[6](https://www.dgl.ai/dgl_docs/notebooks/sparse/hgnn.html) PyTorch Geometric's HypergraphConv uses the closely related form \\( X' = D^{-1} H \\cdot W \\cdot B^{-1} \\cdot H^{\\top} \\cdot X \\cdot \\Theta \\).[7](https://pytorch-geometric.readthedocs.io/en/latest/_modules/torch_geometric/nn/conv/hypergraph_conv.html)\n\nTwo-step message passing is the common abstraction: a permutation-invariant function \\( f_{V \\to E} \\) aggregates node features into each hyperedge, then \\( f_{E \\to V} \\) sends the hyperedge representation back to its nodes.[8](https://arxiv.org/html/2310.07684) This differs from pairwise graph convolution in that one aggregation covers an entire set of nodes at once. Existing message-passing modules use one of four mechanisms: clique-expansion, star-expansion, line-expansion, or incidence-tensor.[9](https://proceedings.iclr.cc/paper_files/paper/2025/file/ad9804eed175610302917a0c21ab9b52-Paper-Conference.pdf)\n\n## How it is done\n\nA practitioner first builds the hypergraph. In the original visual-object construction, each hyperedge connects one vertex and its \\( K \\) nearest neighbors by [Euclidean distance](https://www.edgepedia.org/euclidean-distance), giving \\( N \\) hyperedges over \\( K+1 \\) vertices and an incidence matrix with \\( N \\times (K+1) \\) entries equal to 1.[1](https://ojs.aaai.org/index.php/AAAI/article/download/4235/4113) On citation data, DGL's tutorial builds a \"co-cite\" hypergraph where each paper's hyperedge contains all papers it cited plus itself, then computes the Laplacian with sparse matrix products.[6](https://www.dgl.ai/dgl_docs/notebooks/sparse/hgnn.html) Vision applications also use Fuzzy C-Means or learnable construction functions.[3](https://dl.acm.org/doi/10.1145/3637528.3671457) Next, features are passed through stacked convolution layers; for node classification a two-layer model with a softmax output is trained by back-propagating cross-entropy loss, and multi-modal data are fused by concatenating per-modality hypergraph adjacency matrices.[1](https://ojs.aaai.org/index.php/AAAI/article/download/4235/4113) Implementations exist in DGL, PyTorch Geometric, and the THU-DeepHypergraph toolbox released with HGNN+.[10](https://ieeexplore.ieee.org/document/9795251)\n\n## Origin\n\nThe HGNN model with its hyperedge convolution was presented by Feng and colleagues in the paper \"Hypergraph Neural Networks\", posted to arXiv in 2018 and published at AAAI 2019.[11](https://doi.org/10.48550/arxiv.1809.09401) It formulates learning through a spectral hypergraph regularization framework that generalized spectral clustering from undirected graphs to hypergraphs and developed hypergraph embedding and transductive classification algorithms.[1](https://ojs.aaai.org/index.php/AAAI/article/download/4235/4113) • [2](https://papers.nips.cc/paper/2006/file/dff8e9c2ac33381546d96deea9922999-Paper.pdf) A contemporaneous alternative, HyperGCN by Yadati and colleagues (arXiv 2018), trains graph convolutional networks on hypergraphs using mediators rather than the clique expansion that HGNN-style methods rely on.[12](https://doi.org/10.48550/arxiv.1809.02589) • [13](https://proceedings.neurips.cc/paper/2019/file/1efa39bcaec6f3900149160693694536-Paper.pdf) [Hypergraph](https://www.edgepedia.org/hypergraph) convolution and hypergraph attention by Bai, Zhang, and Torr (Pattern Recognition, 2020) mathematically proves graph convolution is a special case of hypergraph convolution when non-pairwise relationships degenerate to pairwise ones, and adds attention that learns dynamic hyperedge connections.[14](https://doi.org/10.1016/j.patcog.2020.107637) • [15](https://arxiv.org/pdf/1901.08150)\n\n## Variants\n\n**HNHN** (Dong, Sawin, and Bengio, arXiv 2020) relays signals hypernodes to hyperedges and back with \\( X'_{E} = \\sigma(A^{\\top} \\cdot X_{V} \\cdot W_{E} + b_{E}) \\) and \\( X'_{V} = \\sigma(A \\cdot X'_{E} \\cdot W_{V} + b_{V}) \\), using node-specific normalization and avoiding explicit instantiation of \\( A \\), which has size \\( O(m \\cdot n) \\).[4](https://doi.org/10.48550/arxiv.2006.12278) **HGNN+** (Gao and colleagues, IEEE TPAMI 2022) extends the conference model into a general framework for multi-modal data correlation, fusing hyperedge groups adaptively in a single hypergraph with a spatial-domain convolution scheme.[16](https://doi.org/10.1109/tpami.2022.3182052) • [10](https://ieeexplore.ieee.org/document/9795251) **UniGNN** (Huang and Yang, arXiv 2021) unifies graph and hypergraph message passing; its UniGCNII adds initial residual connections and identity mappings in hyperedge-to-node propagation to address over-smoothing, and message-passing models are proven at most as powerful as 1-GWL.[17](https://doi.org/10.48550/arxiv.2105.00956) • [18](https://www.ijcai.org/proceedings/2021/0353.pdf) **AllSet** frames any HNN as a composition of two learnable permutation-invariant multiset functions in the two-step scheme, and is shown to generalize the clique-expansion family including HGNN, HNHN, HCHA, HyperSAGE, and HyperGCN.[19](https://arxiv.org/pdf/2106.13264) • [8](https://arxiv.org/html/2310.07684) **HyperSAGE** (Arya and colleagues, arXiv 2020) generalizes inductive representation learning to hypergraphs.[20](https://doi.org/10.48550/arxiv.2010.04558) **EDHNN** incorporates hyperedge-dependent messages from hyperedges to nodes, going beyond the two-multiset-function framework.[8](https://arxiv.org/html/2310.07684) Newer architectures target the known failure modes: TF-HNN (ICLR 2025) removes training from message passing,[9](https://proceedings.iclr.cc/paper_files/paper/2025/file/ad9804eed175610302917a0c21ab9b52-Paper-Conference.pdf) HGraphormer (Neural Networks, 2025) unifies two-stage methods into one-stage node-to-node propagation by combining the attention matrix with the hypergraph Laplacian,[21](https://doi.org/10.1016/j.neunet.2025.107973) and KHGNN (AAAI 2025) extends the feature-propagation scope with bisection nested convolution.[22](https://dl.acm.org/doi/abs/10.1609/aaai.v39i20.35472) A 2025 survey taxonomizes the wider space into HGCNs, HGATs, HGRNs, HGAEs, and DHGGMs.[5](https://arxiv.org/html/2503.07959v1)\n\n## Applications\n\nRecommendation is a prominent application area, typically formulated as hyperedge prediction; a set of items clicked or purchased in a session forms a hyperedge, and HNNs have been used for sequential, session-based, group, conversational, and point-of-interest recommendation.[3](https://dl.acm.org/doi/10.1145/3637528.3671457) • [23](http://dmlab.kaist.ac.kr/~kijungs/papers/hnnCIKM2025.pdf) In computer vision, nodes represent image patches, features, 3D shapes, joints, or humans. Other documented areas are bioinformatics and medical science, time series analysis,[3](https://dl.acm.org/doi/10.1145/3637528.3671457) and document-style recommendation on a heterogeneous hypergraph built from marketing emails, where one HNN framework reports mean gains of 7.72% for hyperedge prediction and 11.37% for node classification over other models.[24](https://doi.org/10.48550/arxiv.2212.14077) A 2024 Nature Machine Intelligence paper applies HNNs to distributed constrained combinatorial optimization, boosting solution accuracy with a simulated-annealing fine-tuning step on benchmarks including hypergraph MaxCut.[25](https://www.nature.com/articles/s42256-024-00833-7)\n\n## Limitations and alternatives\n\n**Over-smoothing** degrades node information as convolution layers stack, a documented problem for hypergraph convolutions; UniGCNII's residual and identity mappings are one response.[5](https://arxiv.org/html/2503.07959v1) • [8](https://arxiv.org/html/2310.07684) **Over-squashing** arises when pooling over very large hyperedge sets; a 2025 analysis finds state-of-the-art HNNs more susceptible to over-squashing than their predecessors, introducing the HyperEdgeSingle, HyperEdgePath, and HyperEdgeRing problems to measure it.[8](https://arxiv.org/html/2310.07684) • [26](https://proceedings.mlr.press/v269/yadati25a.html) **Scalability** is a second constraint: spectral convolutions require eigen-decomposition of the hypergraph Laplacian, which is computationally expensive and memory-intensive at scale, and spatial convolutions still scale with node and hyperedge counts; the open-sourced HGNN implementation runs out of memory on Pubmed and DBLP.[5](https://arxiv.org/html/2503.07959v1) **Construction sensitivity** matters: when the built hypergraph mirrors the underlying graph, gains over GCN are small,[1](https://ojs.aaai.org/index.php/AAAI/article/download/4235/4113) and reported accuracies are not directly comparable across papers because splits and hypergraph constructions differ, so benchmark figures should always be reported with their source and split. Message-passing models also show high latency and sensitivity to structural perturbations at inference time, motivating alternatives such as Hypergraph-MLP, which learns on hypergraphs without message passing.[27](https://arxiv.org/html/2312.09778v4) Compared with plain GNNs, HGNN's hyperedge convolution reduces to graph convolution when relationships are pairwise.[15](https://arxiv.org/pdf/1901.08150)\n\n## References\n\n1. [Hypergraph Neural Networks (Feng et al., AAAI 2019)](https://ojs.aaai.org/index.php/AAAI/article/download/4235/4113)\n2. [Learning with Hypergraphs: Clustering, Classification, and Embedding (Zhou, Huang, Schölkopf, NeurIPS 2006)](https://papers.nips.cc/paper/2006/file/dff8e9c2ac33381546d96deea9922999-Paper.pdf)\n3. [A Survey on Hypergraph Neural Networks: An In-Depth and Step-By-Step Guide (KDD 2024)](https://dl.acm.org/doi/10.1145/3637528.3671457)\n4. [Dong, Yihe, Sawin, Will, Bengio, Yoshua (2020). HNHN: Hypergraph Networks with Hyperedge Neurons. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.2006.12278)\n5. [Recent Advances in Hypergraph Neural Networks (survey, 2025)](https://arxiv.org/html/2503.07959v1)\n6. [Hypergraph Neural Networks, DGL documentation](https://www.dgl.ai/dgl_docs/notebooks/sparse/hgnn.html)\n7. [torch_geometric.nn.conv.hypergraph_conv source (PyG)](https://pytorch-geometric.readthedocs.io/en/latest/_modules/torch_geometric/nn/conv/hypergraph_conv.html)\n8. [Hypergraph Neural Networks through the Lens of Message Passing](https://arxiv.org/html/2310.07684)\n9. [Training-Free Message Passing for Learning on Hypergraphs (TF-HNN, ICLR 2025)](https://proceedings.iclr.cc/paper_files/paper/2025/file/ad9804eed175610302917a0c21ab9b52-Paper-Conference.pdf)\n10. [HGNN+: General Hypergraph Neural Networks (IEEE TNNLS)](https://ieeexplore.ieee.org/document/9795251)\n11. [Feng, Yifan and colleagues (2018). Hypergraph Neural Networks. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.1809.09401)\n12. [Yadati, Naganand and colleagues (2018). HyperGCN: A New Method of Training Graph Convolutional Networks on Hypergraphs. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.1809.02589)\n13. [HyperGCN: A New Method For Training Graph Convolutional Networks on Hypergraphs (NeurIPS 2019)](https://proceedings.neurips.cc/paper/2019/file/1efa39bcaec6f3900149160693694536-Paper.pdf)\n14. [Song Bai, Feihu Zhang, Philip H.S. Torr (2020). Hypergraph convolution and hypergraph attention. Pattern Recognition.](https://doi.org/10.1016/j.patcog.2020.107637)\n15. [Hypergraph Convolution and Hypergraph Attention (Bai et al.)](https://arxiv.org/pdf/1901.08150)\n16. [Yue Gao and colleagues (2022). HGNN + : General Hypergraph Neural Networks. IEEE Transactions on Pattern Analysis and Machine Intelligence.](https://doi.org/10.1109/tpami.2022.3182052)\n17. [Huang, Jing, Yang, Jie (2021). UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.2105.00956)\n18. [UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks (IJCAI 2021)](https://www.ijcai.org/proceedings/2021/0353.pdf)\n19. [AllSet: A Two-Step Message Passing Framework for Hypergraph Neural Networks](https://arxiv.org/pdf/2106.13264)\n20. [Arya, Devanshu and colleagues (2020). HyperSAGE: Generalizing Inductive Representation Learning on Hypergraphs. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.2010.04558)\n21. [Shilin Qu and colleagues (2025). Hypergraph node representation learning with one-stage message passing. Neural Networks.](https://doi.org/10.1016/j.neunet.2025.107973)\n22. [K-hop Hypergraph Neural Network (KHGNN, AAAI 2025)](https://dl.acm.org/doi/abs/10.1609/aaai.v39i20.35472)\n23. [A Tutorial on Hypergraph Neural Networks (CIKM 2025)](http://dmlab.kaist.ac.kr/~kijungs/papers/hnnCIKM2025.pdf)\n24. [Aponte, Ryan and colleagues (2022). A Hypergraph Neural Network Framework for Learning Hyperedge-Dependent Node Embeddings. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.2212.14077)\n25. [Distributed constrained combinatorial optimization leveraging hypergraph neural networks (Nature Machine Intelligence, 2024)](https://www.nature.com/articles/s42256-024-00833-7)\n26. [Oversquashing in Hypergraph Neural Networks (PMLR v269, 2025)](https://proceedings.mlr.press/v269/yadati25a.html)\n27. [Hypergraph-MLP: Learning on Hypergraphs without Message Passing](https://arxiv.org/html/2312.09778v4)\n\n---\n*Topic: Encyclopedia › Technology and the built world › Computing and digital systems › Artificial intelligence and data › Machine learning and neural computation › Neural networks and deep learning › Neural network architectures › Graph neural network architectures*\n\n*Initially written Sep 29, 2026 · Edited: Oct 15, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n", "same_as": [], "url": "https://www.edgepedia.org/hypergraph-neural-network", "markdown_url": "https://www.edgepedia.org/hypergraph-neural-network.md", "license": { "name": "Edgepedia Community License 1.0", "url": "https://www.edgepedia.org/edgepedia/license", "summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.", "spdx": "LicenseRef-Edgepedia-Community-1.0" }, "credit": "\"Hypergraph neural network\", Edgepedia (EdgeChat), https://www.edgepedia.org/hypergraph-neural-network. Edgepedia Community License 1.0.", "credit_md": "\"[Hypergraph neural network](https://www.edgepedia.org/hypergraph-neural-network)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/hypergraph-neural-network](https://www.edgepedia.org/hypergraph-neural-network). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).", "credit_html": "\"Hypergraph neural network\", Edgepedia (EdgeChat), https://www.edgepedia.org/hypergraph-neural-network. Edgepedia Community License 1.0.", "speakable": "A hypergraph neural network is a graph neural network that operates on hypergraphs, where one hyperedge connects any number of nodes, serving node classification and recommendation." }