| Challenge: | Tabular language models truncate the sequence of a long table due to their input token limits. |
| Approach: | They propose a sub-table rescorer to improve the performance of an inner table retriever-based inference. |
| Outcome: | The proposed sub-table rescorer improves the performance of an ITR-based inference. |
Similar Papers
An Inner Table Retriever for Robust Table Question Answering (2023.acl-long)
Copied to clipboard
| Challenge: | Table Question Answering (TableQA) is a task of answering NL user questions using factoid answers extracted from table content. |
| Approach: | They propose a method for handling long tables in TableQA that extracts sub-tables to preserve the most relevant information for a question. |
| Outcome: | The proposed method can improve TableQA's accuracy with up to 1.3-4.8% and achieve state-of-the-art in two benchmarks. |
Denoising Table-Text Retrieval for Open-Domain Question Answering (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing studies in table-text open-domain question answering have problems with false-positive labels in training datasets. |
| Approach: | They propose a denoised table-text retriever that discards false positives from training datasets . they integrate table-level ranking information into the retriever to assist in finding evidence . |
| Outcome: | The proposed method outperforms baselines on retrieval recall and QA tasks. |
LI-RAGE: Late Interaction Retrieval Augmented Generation with Explicit Signals for Open-Domain Table Question Answering (2023.acl-short)
Copied to clipboard
| Challenge: | Recent open-domain TableQA pipelines use a combination of retriever and reader . a table can be very large and might contain heterogeneous information across rows/columns . |
| Approach: | They propose to combine a retriever-reader pipeline with a binary relevance token to train the retriever and reader. |
| Outcome: | The proposed approaches improve on two open-domain TableQA datasets. |
TableLoRA: Low-rank Adaptation on Table Structure Understanding for Large Language Models (2025.acl-long)
Copied to clipboard
| Challenge: | Tabular data are crucial in many fields and their understanding by large language models (LLMs) under high parameter efficiency paradigm is important. |
| Approach: | They propose a module that uses 2D LoRA to encode low-rank information on cell positions to improve table serialization and representation of two-dimensional structured information within a one-dimensional sequence. |
| Outcome: | Experiments on four tabular-related datasets show that TableLoRA outperforms vanilla LoRA and surpasses table encoding methods tested in control. |
TabSQLify: Enhancing Reasoning Capabilities of LLMs Through Table Decomposition (2024.naacl-long)
Copied to clipboard
| Challenge: | Large language models struggle with large tables due to their limited input length . a novel method that decomposes tables into smaller and relevant sub-tables reduces the computational load on LLMs . |
| Approach: | They propose a method that leverages text-to-SQL generation to decompose tables into smaller and relevant sub-tables . the method can reduce the input context length significantly, making it more scalable and efficient . |
| Outcome: | The proposed method performs remarkably well on the WikiTQ benchmark and on the TabFact benchmark. |
Table-R1: Region-based Reinforcement Learning for Table Understanding (2026.findings-acl)
Copied to clipboard
Zhenhe Wu, Jian Yang, Zhongjiang He, Changzai Pan, Jiaheng Liu, Xianjie Wu, Yu Zhao, Shuangyong Song, Yongxiang Li, Zhoujun Li, Xuelong Li
| Challenge: | Tables are a widely used data format that poses unique challenges for language models due to their structured row-column interactions. |
| Approach: | They propose a region-based reinforcement learning approach that integrates region evidence into reasoning steps. |
| Outcome: | The proposed method outperforms baseline models on three benchmark datasets and significantly reduces the reasoning token consumption by 67.5%. |
TableMBR: Minimum Bayes Risk Table Generation Based on Structural Consistency (2026.acl-srw)
Copied to clipboard
| Challenge: | Experimental results show TableMBR outperforms the baseline, achieving relative improvements of up to 15% in F1 on Rotowire and 23% in accuracy on LiveSum. |
| Approach: | They propose a text-to-table task that generates structured data from unstructured text . they propose 'tableMBR' that maintains structural consistency through minimum Bayes risk decoding . |
| Outcome: | The proposed method outperforms the baseline and achieves relative improvements in F1 and LiveSum. |
ReTAG: Reasoning Aware Table to Analytic Text Generation (2023.emnlp-main)
Copied to clipboard
| Challenge: | Table to text models generate descriptive summaries that repeat information contained within a table in sentences. |
| Approach: | They propose a table-aware table-to-text model that uses vector-quantization to infuse different types of analytical reasoning into the output. |
| Outcome: | The proposed model achieves 2.2%, 2.9% improvement on PARENT metric over state-of-the-art models. |
Expand, Rerank, and Retrieve: Query Reranking for Open-Domain Question Answering (2023.findings-acl)
Copied to clipboard
| Challenge: | Empirically, EAR improves top-5/20 accuracy by 3-8 and 5-10 points . dense retrievers are limited by their inability to perform semantic matching for relevant passages that have low lexical overlap with the query. |
| Approach: | They propose a query expansion and reranking approach for improving passage retrieval with the application to open-domain question answering. |
| Outcome: | Empirically, EAR improves top-5/20 accuracy by 3-8 and 5-10 points when compared to a vanilla query expansion model and a dense retrieval model. |
Subgraph Retrieval Enhanced Model for Multi-hop Knowledge Base Question Answering (2022.acl-long)
Copied to clipboard
| Challenge: | Existing retrieval methods for knowledge base question answering are either heuristic or interwoven with the reasoning, causing reasoning on the partial subgraphs. |
| Approach: | They propose a subgraph retrieval framework that decouples the retrieval from the subsequent reasoning process and trains subgraphs for easier reasoning. |
| Outcome: | The proposed framework improves retrieval and QA performance over existing methods. |