ASTRA: Adaptive Semantic Tree Reasoning Architecture for Complex Table Question Answering

• URL: http://arxiv.org/abs/2604.08999v1
• Date: Fri, 10 Apr 2026 06:09:41 GMT
• Title: ASTRA: Adaptive Semantic Tree Reasoning Architecture for Complex Table Question Answering
• Abstract summary: 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.
• Score: 55.55968342644846
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Table serialization remains a critical bottleneck for Large Language Models (LLMs) in complex table question answering, hindered by challenges such as structural neglect, representation gaps, and reasoning opacity. Existing serialization methods fail to capture explicit hierarchies and lack schema flexibility, while current tree-based approaches suffer from limited semantic adaptability. To address these limitations, we propose ASTRA (Adaptive Semantic Tree Reasoning Architecture) including two main modules, AdaSTR and DuTR. First, we introduce AdaSTR, which leverages the global semantic awareness of LLMs to reconstruct tables into Logical Semantic Trees. This serialization explicitly models hierarchical dependencies and employs an adaptive mechanism to optimize construction strategies based on table scale. Second, building on this structure, we present DuTR, a dual-mode reasoning framework that integrates tree-search-based textual navigation for linguistic alignment and symbolic code execution for precise verification. Experiments on complex table benchmarks demonstrate that our method achieves state-of-the-art (SOTA) performance.

Related papers

• 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)
• 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)
• LSRIF: Logic-Structured Reinforcement Learning for Instruction Following [56.517329105764475]
  We propose a logic-structured training framework LSRIF that explicitly models instruction logic.<n> Experiments show LSRIF brings significant improvements in instruction-following and general reasoning.
  arXiv  Detail & Related papers  (2026-01-10T05:11:38Z)
• KBQA-R1: Reinforcing Large Language Models for Knowledge Base Question Answering [64.62317305868264]
  We present textbfKBQA-R1, a framework that shifts the paradigm from text imitation to interaction optimization via Reinforcement Learning.<n>Treating KBQA as a multi-turn decision process, our model learns to navigate the knowledge base using a list of actions.<n>Experiments on WebQSP, GrailQA, and GraphQuestions demonstrate that KBQA-R1 achieves state-of-the-art performance.
  arXiv  Detail & Related papers  (2025-12-10T17:45:42Z)
• DynaQuery: A Self-Adapting Framework for Querying Structured and Multimodal Data [0.0]
  We present DynaQuery, a unified, self-adapting framework for querying unstructured data.<n>At the heart of DynaQuery lies the Introspection and Linking Engine (SILE), a novel systems primitive that elevates schema linking to a first-class query planning phase.<n>Our findings provide a validated architectural basis for developing natural language database interfaces that are robust, adaptable, and predictably consistent.
  arXiv  Detail & Related papers  (2025-10-20T19:02:35Z)
• ST-Raptor: LLM-Powered Semi-Structured Table Question Answering [17.807768747239205]
  Semi-structured tables, widely used in real-world applications, often involve flexible and complex layouts.<n>These tables rely on human analysts to interpret table layouts and answer relevant natural language questions.<n>We propose ST-Raptor, a tree-based framework for semi-structured table question answering using large language models.
  arXiv  Detail & Related papers  (2025-08-25T16:48:51Z)
• Data Dependency-Aware Code Generation from Enhanced UML Sequence Diagrams [54.528185120850274]
  We propose a novel step-by-step code generation framework named API2Dep.<n>First, we introduce an enhanced Unified Modeling Language (UML) API diagram tailored for service-oriented architectures.<n>Second, recognizing the critical role of data flow, we introduce a dedicated data dependency inference task.
  arXiv  Detail & Related papers  (2025-08-05T12:28:23Z)
• LLM-Symbolic Integration for Robust Temporal Tabular Reasoning [69.27153114778748]
  We introduce TempTabQA-C, a synthetic dataset designed for systematic and controlled evaluations.<n>This structured approach allows Large Language Models (LLMs) to generate and executesql queries, enhancing generalization and mitigating biases.
  arXiv  Detail & Related papers  (2025-06-06T05:14:04Z)
• Large Language Models are Good Relational Learners [55.40941576497973]
  We introduce Rel-LLM, a novel architecture that utilizes a graph neural network (GNN)- based encoder to generate structured relational prompts for large language models (LLMs)<n>Unlike traditional text-based serialization approaches, our method preserves the inherent relational structure of databases while enabling LLMs to process and reason over complex entity relationships.
  arXiv  Detail & Related papers  (2025-06-06T04:07:55Z)
• 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)

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.