Papers › From Hypergraph Energy Functions to Hypergraph Neural Networks

From Hypergraph Energy Functions to Hypergraph Neural Networks

16 Jun 2023arXiv:2306.09623archive 2025-07-28

Yuxin Wang, Quan Gan, Xipeng Qiu, Xuanjing Huang, David Wipf

Hypergraphs are a powerful abstraction for representing higher-order interactions between entities of interest. To exploit these relationships in making downstream predictions, a variety of hypergraph neural network architectures have recently been proposed, in large part building upon precursors from the more traditional graph neural network (GNN) literature. Somewhat differently, in this paper we begin by presenting an expressive family of parameterized, hypergraph-regularized energy functions. We then demonstrate how minimizers of these energies effectively serve as node embeddings that, when paired with a parameterized classifier, can be trained end-to-end via a supervised bilevel optimization process. Later, we draw parallels between the implicit architecture of the predictive models emerging from the proposed bilevel hypergraph optimization, and existing GNN architectures in common use. Empirically, we demonstrate state-of-the-art results on various hypergraph node classification benchmarks. Code is available at https://github.com/yxzwang/PhenomNN.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2306.09623")

Code

Syntology Ran 1 of 12 code samples harvested from 3 repositories linked to this paper; 11 have no recorded run. Of those that ran: 1 ran · our draft was wrong.

By repository: official repository: 1 sample from 1 repository, 1 ran; found in paper text by Syntology: 11 samples from 2 repositories, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

yxzwang/phenomnn officialmentioned in papermentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

12 samples harvested; 1 ran; 0 honoured the contract we drafted; 11 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
11unverified

Licence: 1 of the 12 samples is pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 3 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

Evaluation yxzwang/PhenomNN/train_faster.py official repository ran · our draft was wrong fingerprinted no licence file found · pointer only · f56db6aa911f68ed · report
Eu_dis iMoonLab/HGNN/utils/hypergraph_utils.py found in paper text by Syntology unverified MIT (permissive) · bd608c58ad8406a7 · report
Laplacian malllabiisc/HyperGCN/model/utils.py found in paper text by Syntology unverified Apache-2.0 (permissive) · 62a8829b5b3e655b · report
accuracy malllabiisc/HyperGCN/model/model.py found in paper text by Syntology unverified Apache-2.0 (permissive) · 4e34abf26d062858 · report
adjacency malllabiisc/HyperGCN/model/utils.py found in paper text by Syntology unverified Apache-2.0 (permissive) · 72cb96a7afe170b5 · report
construct_H_with_KNN_from_distance iMoonLab/HGNN/utils/hypergraph_utils.py found in paper text by Syntology unverified MIT (permissive) · caac02b86ce1e557 · report
generate_G_from_H iMoonLab/HGNN/utils/hypergraph_utils.py found in paper text by Syntology unverified MIT (permissive) · 19bf7090ddc330cb · report
get_config iMoonLab/HGNN/config/config.py found in paper text by Syntology unverified MIT (permissive) · ede38fece12b0d2c · report
load_ft iMoonLab/HGNN/datasets/data_helper.py found in paper text by Syntology unverified MIT (permissive) · 81b936ef5207a7d3 · report
test malllabiisc/HyperGCN/model/model.py found in paper text by Syntology unverified Apache-2.0 (permissive) · 0dbfc925a3b4c65b · report
train malllabiisc/HyperGCN/model/model.py found in paper text by Syntology unverified Apache-2.0 (permissive) · 9d023c0bc945b2bb · report
update malllabiisc/HyperGCN/model/utils.py found in paper text by Syntology unverified Apache-2.0 (permissive) · 4ec8917a615ffe2d · report

Tasks

Bilevel OptimizationGraph Neural NetworkNode Classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Graph Neural Network

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections