TAHB: A Comprehensive Benchmark for Text-Attributed Hypergraph Learning

• URL: http://arxiv.org/abs/2608.15055v1
• Date: Sat, 15 Aug 2026 06:02:20 GMT
• Title: TAHB: A Comprehensive Benchmark for Text-Attributed Hypergraph Learning
• Abstract summary: Hypergraphs effectively model higher-order groupwise relationships beyond pairwise interactions.<n>Pretrained language models (PLMs) and large language models (LLMs) provide rich semantic understanding from textual attributes.<n>We present TAHB (Text-Attributed Hypergraph Benchmark), the first public benchmark integrating hypergraph structures and raw textual attributes.
• Score: 16.697800509771614
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hypergraphs effectively model higher-order groupwise relationships beyond pairwise interactions, while pretrained language models (PLMs) and large language models (LLMs) provide rich semantic understanding from textual attributes. However, research on combining language models with hypergraph learning remains limited due to the lack of public text-attributed hypergraph benchmarks. To address this limitation, we present TAHB (Text-Attributed Hypergraph Benchmark), the first public benchmark integrating hypergraph structures and raw textual attributes. TAHB contains 10 real-world datasets from four domains - e-commerce, academia, movies, and politics networks - enabling systematic evaluation of text-aware hypergraph representation learning. Experimental results show that TAHB preserves key structural properties of real-world hypergraphs and consistently reproduces performance tendencies observed in existing benchmarks. Furthermore, experiments under both LLM-as-Enhancer and LLM-as-Predictor settings demonstrate that LLM-enhanced textual semantics improve hypergraph learning performance, while structural and textual information jointly provide the best setting for LLM-based prediction. Our benchmark provides a foundation for future research at the intersection of hypergraph learning and language models.

Related papers

• Semi-Supervised Text-Attributed Graph Distillation [15.73558394941586]
  em Text-Attributed Graphs (TAGs) have emerged as an expressive data model for integrating graph topology with rich textual semantics.<n>We propose algo, a unified semi-supervised framework guided by the em Wasserstein Distance (WSD)
  arXiv  Detail & Related papers  (2026-05-27T14:52:24Z)
• Hypergraph as Language [49.35033483821496]
  We propose a hypergraph-native alignment framework for large language models.<n>For hypergraph structures, existing methods often fail to preserve the native semantics that multiple objects are jointly connected by the same high-order relation.<n>We show that Hyper-Align significantly outperforms existing methods across in-domain and zero-shot evaluations.
  arXiv  Detail & Related papers  (2026-05-21T01:09:48Z)
• Unify Graph Learning with Text: Unleashing LLM Potentials for Session Search [35.20525123189316]
  Session search involves a series of interactive queries and actions to fulfill user's complex information need.<n>Current strategies typically prioritize sequential modeling for deep semantic understanding, overlooking the graph structure in interactions.<n>We propose Symbolic Graph Ranker (SGR), which aims to take advantage of both text-based and graph-based approaches.
  arXiv  Detail & Related papers  (2025-05-20T10:05:06Z)
• Beyond Graphs: Can Large Language Models Comprehend Hypergraphs? [26.39103710373248]
  Existing benchmarks like NLGraph and GraphQA evaluate LLMs on graphs by focusing mainly on pairwise relationships. We introduce LLM4Hypergraph, the first comprehensive benchmark comprising 21,500 problems across eight low-order, five high-order, and two isomorphism tasks. We evaluate six prominent LLMs, including GPT-4o, demonstrating our benchmark's effectiveness in identifying model strengths and weaknesses.
  arXiv  Detail & Related papers  (2024-10-14T01:55:02Z)
• Hypergraph based Understanding for Document Semantic Entity Recognition [65.84258776834524]
  We build a novel hypergraph attention document semantic entity recognition framework, HGA, which uses hypergraph attention to focus on entity boundaries and entity categories at the same time. Our results on FUNSD, CORD, XFUNDIE show that our method can effectively improve the performance of semantic entity recognition tasks.
  arXiv  Detail & Related papers  (2024-07-09T14:35:49Z)
• HyperBERT: Mixing Hypergraph-Aware Layers with Language Models for Node Classification on Text-Attributed Hypergraphs [16.07396492960869]
  We propose a new architecture, HyperBERT, which simultaneously models hypergraph relational structure and text-attributed hypergraphs. Results show that HyperBERT achieves a new state-of-the-art on five challenging text-attributed hypergraph node classification benchmarks.
  arXiv  Detail & Related papers  (2024-02-11T21:16:26Z)
• Large Language Models on Graphs: A Comprehensive Survey [77.16803297418201]
  We provide a systematic review of scenarios and techniques related to large language models on graphs. We first summarize potential scenarios of adopting LLMs on graphs into three categories, namely pure graphs, text-attributed graphs, and text-paired graphs. We discuss the real-world applications of such methods and summarize open-source codes and benchmark datasets.
  arXiv  Detail & Related papers  (2023-12-05T14:14:27Z)
• Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learning [51.90524745663737]
  A key innovation is our use of explanations as features, which can be used to boost GNN performance on downstream tasks. Our method achieves state-of-the-art results on well-established TAG datasets. Our method significantly speeds up training, achieving a 2.88 times improvement over the closest baseline on ogbn-arxiv.
  arXiv  Detail & Related papers  (2023-05-31T03:18:03Z)
• HTLM: Hyper-Text Pre-Training and Prompting of Language Models [52.32659647159799]
  We introduce HTLM, a hyper-text language model trained on a large-scale web crawl. We show that pretraining with a BART-style denoising loss directly on simplified HTML provides highly effective transfer for a wide range of end tasks and supervision levels. We find that hyper-text prompts provide more value to HTLM, in terms of data efficiency, than plain text prompts do for existing LMs.
  arXiv  Detail & Related papers  (2021-07-14T19:39:31Z)
• Exploiting Structured Knowledge in Text via Graph-Guided Representation Learning [73.0598186896953]
  We present two self-supervised tasks learning over raw text with the guidance from knowledge graphs. Building upon entity-level masked language models, our first contribution is an entity masking scheme. In contrast to existing paradigms, our approach uses knowledge graphs implicitly, only during pre-training.
  arXiv  Detail & Related papers  (2020-04-29T14:22:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.