TAHB (Text-Attributed Hypergraph Benchmark) is presented, the first public benchmark integrating hypergraph structures and raw textual attributes, and shows that LLM-enhanced textual semantics improve hypergraph learning performance, while structural and textual information jointly provide the best setting for LLM-based prediction.
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.
OpenRTAG provides a standardized testbed for understanding robustness in TAG learning under realistic low-quality settings and systematically evaluates scenario validity and model sensitivity, compares traditional GNNs, LLM-GNNs, and a representative GFM, and investigates the effectiveness, efficiency, and robustness of scenario-matched baselines.
Yu-Ze Dai, Zhi-Han Zhang, Yan Zhao et al.· arXiv.org· 0 citations
This paper introduces a novel task, graph textual summarization, which aims to generate natural language descriptions that capture both the semantic content and structural characteristics of graph data based on large language models (LLMs). Unlike traditional summarization tasks for text, images, or videos, summarizing graph data presents unique challenges due to its abstract and non-intuitive nature. We develop a comprehensive benchmark construction framework and construct three diverse benchmark datasets, including text-attributed graphs (TAGs), knowledge graphs (KGs), and heterogeneous attributed graphs (HAGs). To facilitate empirical studies, we deliver three representative benchmark datasets: SurveyGraphSum, consisting of 7835 citation graphs from survey papers across 10 major domains and 56 subdomains; BookGraphSum, containing 6175 knowledge graphs extracted from 186 books; and E-comGraphSum, with 912 heterogeneous graphs from real-world e-commerce networks, each representing a fraud group with 14 node types, 19 relation types, and 9 numerical attributes related to user behavior and interactions. In addition, we propose a unified evaluation framework that assesses both linguistic quality and factual consistency, providing a comprehensive approach to evaluating generated summaries for content fidelity and accuracy. By formalizing the task, releasing benchmark datasets, and proposing an evaluation framework, we aim to advance research in graph textual summarization and promote methods that produce accurate, informative, and human-readable summaries for complex graphs.
Xiaoxuan Gou, Weiguo Zheng, Hanqing Guo et al.· Proceedings of the 32nd ACM...· 0 citations
Tables are ubiquitous across diverse domains, yet reasoning over them remains a significant challenge for modern large language models (LLMs). Current approaches typically linearize tables into sequences, inherently overlooking their intrinsic two-dimensional and hierarchical structure. To address this, we propose H2Table (Hierarchical Hypergraph-Enhanced Table Reasoning), a novel framework that represents complex tables as hierarchical nested hypergraphs. To process this representation, we design a tailored hypergraph encoder to facilitate message passing between hyperedges (headers) and nodes (cells), thereby perceiving the semantic entailment relationships between them within complex tables. Furthermore, we introduce a set of learnable query vectors acting as a lightweight bridge to extract representative structural embeddings from the encoder into the LLM. Experimental results demonstrate that our approach effectively handles complex table question answering tasks with hierarchical nested headers. Notably, on the HiTab dataset, H2Table achieves an average improvement of 22.88% over state-of-the-art baselines on highly complex tables with a nesting depth of four. Our code is available at: https://github.com/lila120/h2table.
Jia Ling, Yang-Fan Wang, Chen Tang et al.· 0 citations
Multimodal Large Language Models (MLLMs) have achieved strong performance on structured visual understanding tasks such as chart and document question answering. However, existing benchmarks typically evaluate these domains in isolation, leaving underexplored a key capability: whether models can use textual context to determine how chart evidence should be selected, interpreted, and aggregated. We introduce DocHop, a benchmark for integrated chart--context reasoning in document-style images. In DocHop, the document narrative specifies multi-step compositional constraints, while charts provide the corresponding data values. Questions are grounded on a semantic reference label defined in the narrative, requiring models to resolve target entities from context before aggregating evidence across multiple charts. To enable systematic evaluation, we construct DocHop via a stochastic logic-first generation pipeline with controllable reasoning depth and visual density, covering 2,074 examples across six task categories. Experiments on a wide range of proprietary and open-source MLLMs show a substantial gap to human performance: annotators achieve over 90% accuracy, while the best model reaches only 62.83%. Reasoning-enhanced models consistently show improved results, but performance degrades as reasoning complexity increases. Overall, DocHop provides a controlled testbed for challenging multi-hop document reasoning.
Zhuoran Yu, Le Thien Phuc Nguyen, Jaden Park et al.· 0 citations
Existing scientific text representation methods based on contrastive learning typically adopt a binary classification paradigm of positive and negative samples, which struggles to capture the complex, hierarchical semantic similarity relationships inherent in scientific texts. To address this, we propose SciRep, a novel two-stage ranking distillation framework. In the first stage, we distill knowledge from a large language model to a medium-scale representation model using generated ranking samples; in the second stage, a multi-teacher strategy further transfers fine-grained ranking capability to a lightweight model. Evaluated on a scientific literature semantic embedding benchmark comprising three tasks, SciRep outperforms the strongest baseline by 11.3% in terms of Average Rank and also achieves the highest Mean Reciprocal Rank scores across all three tasks. These results demonstrate that the proposed ranking-aware distillation mechanism significantly enhances scientific text representation quality while maintaining efficient inference, offering a more effective contrastive learning method for domain-specific retrieval tasks.
Bing-Hao Fu, Jun Wang· Applied Sciences· 0 citations
Short text clustering has become increasingly important with the popularity of social media. Existing methods fall into three paradigms: those based on topic models, deep representation learning, and large language models (LLMs). The first relies on the bag-of-words assumption, which ignores word order and semantic information. The second achieves strong performance but lacks interpretability. The third captures the most comprehensive semantic information but requires high-frequency, real-time API calls and incurs higher computational costs during model inference. In addition, the requirement to predefine the number of clusters remains a key issue. In this paper, we propose a Non-parametric Multi-View Model (NMVM) for short text clustering, which represents texts using two complementary views: bag-of-words and text embeddings. NMVM incorporates semantic information into a generative framework by integrating the Dirichlet process multinomial mixture model and the Dirichlet process gaussian mixture model. Notably, we propose and derive a novel and efficient clustering algorithm based on collapsed Gibbs sampling, which automatically infers the number of clusters from the data and identifies representative words for each cluster, thereby enabling fully non-parametric and interpretable clustering. Extensive experiments on six real-world datasets demonstrate the superiority of the proposed model over several strong baselines. Notably, our algorithm converges rapidly and demonstrates high efficiency. The source code is publicly available at~https://github.com/chehaoa/NMVM.
Enhao Cheng, Xiaolong Zheng, Jintong Li et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
