TabRank: Chain-of-Thought Distillation for Table Re-Rankers
arXiv:2607. 25182v1 Announce Type: cross Abstract: The ability to retrieve relevant tables for answering questions is a key task for structured information retrieval.
The paper introduces Table Graph Reasoner (TabGR), a model that represents tables as an Attributed Table Graph (ATG) to preserve row-column-cell structure and enable graph-based reasoning without task-specific training. It also proposes a Question-Guided Personalized PageRank (QG-PPR) mechanism to rerank tabular data and address the lost-in-the-middle issue. Experiments on multiple table reasoning benchmarks show that TabGR outperforms state-of-the-art models by up to 9.7% in accuracy.
arXiv:2607. 25182v1 Announce Type: cross Abstract: The ability to retrieve relevant tables for answering questions is a key task for structured information retrieval.
PARTAB is a framework that improves large language model reasoning on tables by constructing a structured evidence interface. It represents query‑relevant evidence as semantically coherent, row‑linked table regions and performs hierarchical selection over column groups and row‑level partitions before composing the evidence for answer generation. Evaluations on multiple table reasoning benchmarks show that PARTAB consistently outperforms full‑table prompting and recent methods, achieving strong performance on WikiTableQuestions and TabFact while remaining competitive on numerical reasoning tasks.
arXiv:2607. 22633v1 Announce Type: new Abstract: Table Question Answering (TableQA) aims to reason over tables to answer user queries.
Large Language Models (LLMs) have shown strong capabilities in table reasoning, but their effectiveness degrades as tables grow in size and complexity due to irrelevant context and difficulty localizi...
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 sequen...
H2Table introduces a hierarchical hypergraph representation for complex tables, enabling a hypergraph encoder to capture semantic relationships between headers and cells. The framework uses learnable query vectors to extract structural embeddings for large language models. Experiments on the HiTab dataset show a 22.88% improvement over state‑of‑the‑art baselines on tables with four levels of nesting.
arXiv:2605. 20254v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) have shown promising results on NLP tasks, however, their performance on tabular data still needs research attention, because Table Question-Answering (TQA) requires precise cell retrieval and multi-step structured reasoning.
arXiv:2506. 18421v3 Announce Type: replace-cross Abstract: The majority of data in businesses and industries is stored in tables, databases, and data warehouses.
arXiv:2608. 03292v1 Announce Type: new Abstract: Long Document Visual Question Answering (LongDocVQA) requires Multimodal Large Language Models (MLLMs) to locate, integrate, and reason over heterogeneous document elements distributed across multiple pages.
Posted by Zilong Wang, Student Researcher, and Chen-Yu Lee, Research Scientist, Cloud AI Team People use tables every day to organize and interpret complex information in a structured, easily accessible format. Due to the ubiquity of such tables, reasoning over tabular data has long been a central topic in natural language processing (NLP).
arXiv:2607. 28680v1 Announce Type: cross Abstract: Entity linking in tables matches short and ambiguous cell mentions to their corresponding knowledge-base entities.
TabScope introduces a question‑adaptive framework for table question answering that dynamically chooses between localized and full‑table reasoning. It constructs question‑specific sub‑tables via operation‑aware decomposition and predicts the question type to select the appropriate reasoning mode. Experiments on WikiTQ and the new SLQA benchmark show that localization improves lookup and local reasoning questions, while adaptive selection yields the best overall performance on long tables.