Metraipolis › archive › dc_0044ce9f2fe0
Hypergraph Representation Learning with Hyperlink Random Effects — arXiv:2610.04640
- Source
- arXiv
- Original
- https://arxiv.org/abs/2610.04640
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T05:32:10.211Z
- SHA-256 of the archived text
f6d13dcfcab345276109af6a2439832928998602a9396fdaae03a9222d2ab8f0- Stable URL of this page
https://metraipolis.com/documento/dc_0044ce9f2fe0
How to cite
Hypergraph Representation Learning with Hyperlink Random Effects — arXiv:2610.04640 — arXiv, https://arxiv.org/abs/2610.04640 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0044ce9f2fe0 (Metraipolis archive dc_0044ce9f2fe0, sha256 f6d13dcfcab345276109af6a2439832928998602a9396fdaae03a9222d2ab8f0)
BibTeX
@misc{dc0044ce9f2fe0,
title = {Hypergraph Representation Learning with Hyperlink Random Effects — arXiv:2610.04640},
howpublished = {arXiv},
url = {https://arxiv.org/abs/2610.04640},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0044ce9f2fe0; sha256 f6d13dcfcab345276109af6a2439832928998602a9396fdaae03a9222d2ab8f0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.04640. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Hypergraphs record multi-way interactions among entities. Extracting information from the combinatorial structure underlying observed multi-way interactions is a central task in many real-world problems. Existing methods face several limitations. First, many deep architectures for hypergraphs do not explicitly exploit the potential low-rank structure, which can sacrifice parsimony and interpretability in the learned representations. Second, many low-rank-based methods operate on tensor representations, which typically require hyperlinks to have uniform sizes and thus limit their applicability to general hypergraphs with non-uniform hyperlink sizes. Third, many methods ignore the fact that hyperlinks often arise from heterogeneous mechanisms. For example, medical symptoms may co-occur in the profiles of patients with very different conditions, and such heterogeneity should be incorporated into the learning process. In this work, we develop a general framework for hypergraph representation learning using hyperlink random effects while exploiting the low-rank structure in hypergraphs. The proposed framework accommodates latent heterogeneity in hyperlink formation while preserving entity interaction patterns. We establish identifiability of the model parameters and theoretical guarantees of representation-level recovery under this framework. The framework allows flexible specifications for the hyperlink random effects; in this paper, we study three choices: categorical, Gaussian mixture, and score-based effects, and develop corresponding estimation algorithms. Through simulation studies, we demonstrate the effectiveness of the proposed method in recovering latent structure and capturing heterogeneous interaction patterns. Empirical studies on real-world hypergraph datasets further illustrate the practical utility of our approach. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2610.04640 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T05:27:05.975Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).