H2Table: Hierarchical Hypergraph-Enhanced Large Language Models for Complex Table Reasoning
- URL: http://arxiv.org/abs/2609.01216v1
- Date: Tue, 01 Sep 2026 13:19:42 GMT
- Title: H2Table: Hierarchical Hypergraph-Enhanced Large Language Models for Complex Table Reasoning
- Abstract summary: H2Table is a novel framework that represents complex tables as hierarchical nested hypergraphs.<n>We design a tailored hypergraph encoder to facilitate message passing between hyperedges (headers) and nodes (cells)
- Score: 16.150378428877445
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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.
Related papers
- DeepTable: Structural Attention Biases and Tree Path Encoding for Hierarchical Table Understanding [10.761232681902394]
Large language models (LLMs) have demonstrated strong performance in table understanding.<n>We propose DeepTable, a structure-aware approach for table understanding with LLMs.
arXiv Detail & Related papers (2026-09-07T16:19:33Z) - 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) - ASTRA: Adaptive Semantic Tree Reasoning Architecture for Complex Table Question Answering [55.55968342644846]
Table serialization remains a critical bottleneck for Large Language Models (LLMs) in complex table question answering.<n>Existing serialization methods fail to capture explicit hierarchies and lack schema flexibility.<n>We propose ASTRA (Adaptive Semantic Tree Reasoning Architecture) including two main modules, AdaSTR and DuTR.<n> Experiments on complex table benchmarks demonstrate that our method achieves state-of-the-art (SOTA) performance.
arXiv Detail & Related papers (2026-04-10T06:09:41Z) - Orthogonal Hierarchical Decomposition for Structure-Aware Table Understanding with Large Language Models [13.58784346599112]
We propose an Orthogonal Hierarchical Decomposition (OHD) framework that constructs structure-preserving input representations of complex tables for LLMs.<n>Building on this representation, we design a dual-pathway association protocol to symmetrically reconstruct semantic lineage of each cell.<n>We evaluate OHD framework on two complex table question answering benchmarks, AITQA and HiTab.
arXiv Detail & Related papers (2026-02-02T11:22:43Z) - STAR: Semantic Table Representation with Header-Aware Clustering and Adaptive Weighted Fusion [1.483000637348699]
STAR (Semantic Table Representation) is a lightweight framework that improves semantic table representation through semantic clustering and weighted fusion.<n>We show that STAR achieves consistently higher Recall than QGpT on all datasets.
arXiv Detail & Related papers (2026-01-22T11:08:46Z) - CORE-T: COherent REtrieval of Tables for Text-to-SQL [91.76918495375384]
CORE-T is a scalable, training-free framework that enriches tables with purpose metadata and pre-computes a lightweight table-compatibility cache.<n>Across Bird, Spider, and MMQA, CORE-T improves table-selection F1 by up to 22.7 points while retrieving up to 42% fewer tables.
arXiv Detail & Related papers (2026-01-19T14:51:23Z) - HyperJoin: LLM-augmented Hypergraph Link Prediction for Joinable Table Discovery [27.204701078044252]
We propose a large language model (LLM)-augmented Hypergraph framework for joinable table discovery.<n>Specifically, we first construct a hypergraph to model tables using both the intra-table hyperedges and the LLM-augmented inter-table hyperedges.<n>We then design HIN, a Hierarchical Interaction Network that learns expressive column representations through bidirectional message passing over columns and hyperedges.
arXiv Detail & Related papers (2026-01-03T00:54:55Z) - UNJOIN: Enhancing Multi-Table Text-to-SQL Generation via Schema Simplification [50.59009084277447]
We introduce UNJOIN, a framework that decouples the retrieval of schema elements from logic generation.<n>In the first stage, we merge the column names of all tables in the database into a single-table representation by prefixing each column with its table name.<n>In the second stage, the query is generated on this simplified schema and mapped back to the original schema by reconstructing JOINs, UNIONs, and relational logic.
arXiv Detail & Related papers (2025-05-23T17:28:43Z) - RAG over Tables: Hierarchical Memory Index, Multi-Stage Retrieval, and Benchmarking [63.253294691180635]
In real-world scenarios, beyond pure text, a substantial amount of knowledge is stored in tables.<n>We first propose a table-corpora-aware RAG framework, named T-RAG, which consists of the hierarchical memory index, multi-stage retrieval, and graph-aware prompting.
arXiv Detail & Related papers (2025-04-02T04:24:41Z) - Joint Entity and Relation Extraction with Span Pruning and Hypergraph
Neural Networks [58.43972540643903]
We propose HyperGraph neural network for ERE ($hgnn$), which is built upon the PL-marker (a state-of-the-art marker-based pipleline model)
To alleviate error propagation,we use a high-recall pruner mechanism to transfer the burden of entity identification and labeling from the NER module to the joint module of our model.
Experiments on three widely used benchmarks for ERE task show significant improvements over the previous state-of-the-art PL-marker.
arXiv Detail & Related papers (2023-10-26T08:36:39Z) - Table Retrieval May Not Necessitate Table-specific Model Design [83.27735758203089]
We focus on the task of table retrieval, and ask: "is table-specific model design necessary for table retrieval?"
Based on an analysis on a table-based portion of the Natural Questions dataset (NQ-table), we find that structure plays a negligible role in more than 70% of the cases.
We then experiment with three modules to explicitly encode table structures, namely auxiliary row/column embeddings, hard attention masks, and soft relation-based attention biases.
None of these yielded significant improvements, suggesting that table-specific model design may not be necessary for table retrieval.
arXiv Detail & Related papers (2022-05-19T20:35:23Z) - Retrieving Complex Tables with Multi-Granular Graph Representation
Learning [20.72341939868327]
The task of natural language table retrieval seeks to retrieve semantically relevant tables based on natural language queries.
Existing learning systems treat tables as plain text based on the assumption that tables are structured as dataframes.
We propose Graph-based Table Retrieval (GTR), a generalizable NLTR framework with multi-granular graph representation learning.
arXiv Detail & Related papers (2021-05-04T20:19:03Z)
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.