Orthogonal Hierarchical Decomposition for Structure-Aware Table Understanding with Large Language Models

• URL: http://arxiv.org/abs/2602.01969v1
• Date: Mon, 02 Feb 2026 11:22:43 GMT
• Title: Orthogonal Hierarchical Decomposition for Structure-Aware Table Understanding with Large Language Models
• Abstract summary: 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.
• Score: 13.58784346599112
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Complex tables with multi-level headers, merged cells and heterogeneous layouts pose persistent challenges for LLMs in both understanding and reasoning. Existing approaches typically rely on table linearization or normalized grid modeling. However, these representations struggle to explicitly capture hierarchical structures and cross-dimensional dependencies, which can lead to misalignment between structural semantics and textual representations for non-standard tables. To address this issue, we propose an Orthogonal Hierarchical Decomposition (OHD) framework that constructs structure-preserving input representations of complex tables for LLMs. OHD introduces an Orthogonal Tree Induction (OTI) method based on spatial--semantic co-constraints, which decomposes irregular tables into a column tree and a row tree to capture vertical and horizontal hierarchical dependencies, respectively. Building on this representation, we design a dual-pathway association protocol to symmetrically reconstruct semantic lineage of each cell, and incorporate an LLM as a semantic arbitrator to align multi-level semantic information. We evaluate OHD framework on two complex table question answering benchmarks, AITQA and HiTab. Experimental results show that OHD consistently outperforms existing representation paradigms across multiple evaluation metrics.

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)
• H2Table: Hierarchical Hypergraph-Enhanced Large Language Models for Complex Table Reasoning [16.150378428877445]
  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)
  arXiv  Detail & Related papers  (2026-09-01T13:19:42Z)
• SemStruct: Contextualizing Semantic Embeddings with Structural Information for Schema Matching [20.959946127503354]
  We propose SemStruct, a framework that joins the semantic power of frozen PLMs with the structural inductive bias of Graph Neural Networks (GNNs)<n>We model the table as a heterogeneous graph where columns and values are nodes connected by rows, allowing the GNN to propagate disambiguating context across the structure.
  arXiv  Detail & Related papers  (2026-05-29T01:45:45Z)
• 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)
• HCRE: LLM-based Hierarchical Classification for Cross-Document Relation Extraction with a Prediction-then-Verification Strategy [54.91468501159335]
  Cross-document relation extraction (RE) aims to identify relations between the head tail entities located in different documents.<n>We propose an inference strategy that improves reliability through multi-view verification at each level.
  arXiv  Detail & Related papers  (2026-04-09T07:55:27Z)
• MoDora: Tree-Based Semi-Structured Document Analysis System [62.01015188258797]
  Semi-structured documents integrate diverse interleaved data elements arranged in various and often irregular layouts.<n>MoDora is an LLM-powered system for semi-structured document analysis.<n> Experiments show MoDora outperforms baselines by 5.97%-61.07% in accuracy.
  arXiv  Detail & Related papers  (2026-02-26T14:48:49Z)
• How Do Language Models Understand Tables? A Mechanistic Analysis of Cell Location [53.68149869349268]
  We investigate the process of table understanding by dissecting the atomic task of cell location.<n>We demonstrate that models locate the target cell via an ordinal mechanism that counts discretes to resolve coordinates.<n>We reveal that models generalize to multi-cell location tasks by multiplexing the identical attention heads identified during atomic location.
  arXiv  Detail & Related papers  (2026-02-09T11:47:34Z)
• Same Content, Different Representations: A Controlled Study for Table QA [15.896655757672441]
  Table Question Answering (Table QA) in real-world settings must operate over both structured databases and semi-structured tables containing textual fields.<n>Existing benchmarks are tied to fixed data formats and have not systematically examined how representation itself affects model performance.<n>We present the first controlled study that isolates the role of table representation by holding content constant while varying structure.
  arXiv  Detail & Related papers  (2025-09-26T22:33:19Z)
• TableDART: Dynamic Adaptive Multi-Modal Routing for Table Understanding [52.59372043981724]
  TableDART is a training-efficient framework that integrates multimodal views by reusing pretrained single-modality models.<n>In addition, we propose a novel agent to cross-modal knowledge integration by analyzing outputs from text- and image-based models.
  arXiv  Detail & Related papers  (2025-09-18T07:00:13Z)
• Beyond Isolated Dots: Benchmarking Structured Table Construction as Deep Knowledge Extraction [80.88654868264645]
  Arranged and Organized Extraction Benchmark designed to evaluate ability of large language models to comprehend fragmented documents.<n>AOE includes 11 carefully crafted tasks across three diverse domains, requiring models to generate context-specific schema tailored to varied input queries.<n>Results show that even the most advanced models struggled significantly.
  arXiv  Detail & Related papers  (2025-07-22T06:37:51Z)
• Plugging Schema Graph into Multi-Table QA: A Human-Guided Framework for Reducing LLM Reliance [8.83042313837811]
  We propose a graph-based framework that leverages human-curated relational knowledge to explicitly encode schema links and join paths.<n>Given a natural language query, our method searches on graph to construct interpretable reasoning chains, aided by pruning and sub-path merging strategies.<n>Experiments on both standard benchmarks and a realistic, large-scale dataset demonstrate the effectiveness of our approach.
  arXiv  Detail & Related papers  (2025-06-04T20:21:52Z)
• Tree-of-Table: Unleashing the Power of LLMs for Enhanced Large-Scale Table Understanding [42.841205217768106]
  "Tree-of-Table" is a novel approach designed to enhance LLMs' reasoning capabilities over large and complex tables. We show that Tree-of-Table sets a new benchmark with superior performance, showcasing remarkable efficiency and generalization capabilities in large-scale table reasoning.
  arXiv  Detail & Related papers  (2024-11-13T11:02:04Z)
• SEMv3: A Fast and Robust Approach to Table Separation Line Detection [48.75713662571455]
  Table structure recognition (TSR) aims to parse the inherent structure of a table from its input image. "Split-and-merge" paradigm is a pivotal approach to parse table structure, where the table separation line detection is crucial. We propose SEMv3 (SEM: Split, Embed and Merge), a method that is both fast and robust for detecting table separation lines.
  arXiv  Detail & Related papers  (2024-05-20T08:13:46Z)
• SEMv2: Table Separation Line Detection Based on Instance Segmentation [96.36188168694781]
  We propose an accurate table structure recognizer, termed SEMv2 (SEM: Split, Embed and Merge) We address the table separation line instance-level discrimination problem and introduce a table separation line detection strategy based on conditional convolution. To comprehensively evaluate the SEMv2, we also present a more challenging dataset for table structure recognition, dubbed iFLYTAB.
  arXiv  Detail & Related papers  (2023-03-08T05:15:01Z)
• TRUST: An Accurate and End-to-End Table structure Recognizer Using Splitting-based Transformers [56.56591337457137]
  We propose an accurate and end-to-end transformer-based table structure recognition method, referred to as TRUST. Transformers are suitable for table structure recognition because of their global computations, perfect memory, and parallel computation. We conduct experiments on several popular benchmarks including PubTabNet and SynthTable, our method achieves new state-of-the-art results.
  arXiv  Detail & Related papers  (2022-08-31T08:33:36Z)
• HiTab: A Hierarchical Table Dataset for Question Answering and Natural Language Generation [35.73434495391091]
  Hierarchical tables challenge existing methods by hierarchical indexing, as well as implicit relationships of calculation and semantics. This work presents HiTab, a free and open dataset for the research community to study question answering (QA) and natural language generation (NLG) over hierarchical tables.
  arXiv  Detail & Related papers  (2021-08-15T10:14:21Z)

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.