Challenge: Existing methods for retrieving relevant tables from databases are limited by the number of tables required.
Approach: They propose an adaptive table retrieval method that adjusts the number of tables retrieved according to the requirements of each query.
Outcome: Experiments on Spider, BIRD, and Spider 2.0 show that the proposed method improves performance and retrieval and downstream tasks.

Similar Papers

Is Table Retrieval a Solved Problem? Exploring Join-Aware Multi-Table Retrieval (2024.acl-long)

Copied to clipboard

Challenge: Existing methods for retrieving relevant tables are not sufficient as many questions require retrieving multiple tables and joining them through a join plan that cannot be discerned from the user query itself.
Approach: They propose a method that uncovers useful join relations during table retrieval.
Outcome: The proposed method outperforms the state-of-the-art methods for table retrieval by up to 9.3% in F1 score and for end-to-end QA by up 5.4% in accuracy.
Adaptive Document Retrieval for Deep Question Answering (D18-1)

Copied to clipboard

Challenge: Existing methods for deep question answering do not understand the exact interplay between document retrieval and machine comprehension.
Approach: They propose an adaptive document retrieval model that learns the optimal document number, conditional on the size of the corpus and the query.
Outcome: The proposed model outperforms state-of-the-art methods on multiple benchmark datasets and in the context of corpora with variable sizes.
Proceedings of the Thirteenth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-13) (D19-53)

Copied to clipboard

Challenge: TextGraphs is a workshop on graph-based methods for natural language processing . the workshop is being organized in conjunction with the 9th International Joint Conference on Natural Language Processing .
Approach: TextGraphs is the 13th edition of the Workshop on Graph-Based Methods for Natural Language Processing . the workshop promotes synergy between GT and natural language processing .
Outcome: the 2013 edition of TextGraphs is being held in conjunction with the 9th International Joint Conference on Natural Language Processing in Hong Kong.
Uncovering Limitations of Large Language Models in Information Seeking from Tables (2024.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks for Table Information Seeking (TabIS) are lacking in reliable evaluation.
Approach: They propose a benchmark to evaluate the table information seeking abilities of large language models . they use a single-choice question format instead of a text-based evaluation .
Outcome: The proposed benchmark is more reliable than existing models and is available online.
K-order Ranking Preference Optimization for Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Existing list-wise methods focus on optimizing list ranking consistency for LLMs to improve ranking abilities.
Approach: They propose to extend the Plackett-Luce model to accommodate top-K ranking by extending the DPO’s Plact-Lucer model to dynamically determine appropriate K for different samples.
Outcome: The proposed model can be extended to accommodate top-K ranking and improve training efficiency.
Proceedings of the 2nd Workshop on Machine Reading for Question Answering (D19-58)

Copied to clipboard

Challenge: a workshop focuses on machine reading for question answering . despite recent progress, there is much to be desired about these datasets and systems .
Approach: This year, they present a shared task on machine reading for question answering . they adapt and unified 18 distinct question answering datasets into the same format .
Outcome: The proposed system achieves an average F1 score of 72.5 on the held-out datasets.
The Fragility of Multi-Treebank Parsing Evaluation (2022.coling-1)

Copied to clipboard

Challenge: a limitation in NLP evaluation lies in the association between solving a dataset versus solving . authors often run their models only in a handful of treebanks .
Approach: They propose to run a large-scale experiment on a single treebank and compare them on many parsers whose scores are available.
Outcome: The proposed model can be biased on a single treebank and spurious effects can be avoided.
Adaptive Retrieval for Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Existing reasoning-based rerankers suffer from bounded recall.
Approach: They propose a framework that leverages adaptive retrieval to ensure sufficient "bridge" documents are retrieved for reasoning-intensive retrieval.
Outcome: The proposed method outperforms baselines on reasoning-intensive retrieval tasks by 5.6%pt.
Table Question Answering in the Era of Large Language Models: A Comprehensive Survey of Tasks, Methods, and Evaluation (2026.acl-long)

Copied to clipboard

Challenge: Table Question Answering (TQA) aims to answer natural language questions using tabular data.
Approach: They propose a systematic overview of TQA research using large language models and summarize available benchmarks based on task features.
Outcome: The proposed framework provides a comprehensive overview of the current state of the art in the field of Table Question Answering.
Tailoring Table Retrieval from a Field-aware Hybrid Matching Perspective (2025.emnlp-main)

Copied to clipboard

Challenge: Empirical results show that a hybrid retrieval approach to table retrieval outperforms state-of-the-art benchmarks.
Approach: They propose a table-tailored HYbrid matching rEtriever which addresses table matching needs from a field-aware hybrid perspective.
Outcome: Empirical results show that the proposed rEtriever outperforms state-of-the-art retrieval methods.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations