Challenge: Existing methods for table-text retrieval are limited due to the need to bridge structured tables and unstructured passages.
Approach: They propose a table-text retrieval system that combines the strengths of both approaches . they propose bipartite subgraph retrieval and query-relevant node expansion .
Outcome: The proposed method outperforms state-of-the-art models with a 42.6% and 39.9% improvement on the OTT-QA benchmark.

Similar Papers

MMLF: Multi-query Multi-passage Late Fusion Retrieval (2025.findings-naacl)

Copied to clipboard

Challenge: Existing approaches to query expansion are limited in terms of lexical overlap.
Approach: They propose a query expansion pipeline that generates sub-queries, expands them into pseudo-documents, retrieves them individually and aggregates results using reciprocal rank fusion.
Outcome: The proposed pipeline improves on five BEIR benchmark datasets and achieves a maximum gain of up to 8%.
DIVKNOWQA: Assessing the Reasoning Ability of LLMs via Open-Domain Question Answering over Knowledge Base and Text (2024.findings-naacl)

Copied to clipboard

Challenge: Retrievalaugmented LLMs have been used to ground LLM in external knowledge . a gap exists in the current landscape regarding the effectiveness of grounding LLM on heterogeneous knowledge sources.
Approach: They propose a model that uses symbolic language to generate symbolic queries . they use a dataset that is generated using predefined reasoning chains and human annotation .
Outcome: The proposed model outperforms previous approaches by a significant margin in QA tasks over text.
GRAM: Generative Recommendation via Semantic-aware Multi-granular Late Fusion (2025.acl-long)

Copied to clipboard

Challenge: Existing studies rely on item metadata to construct abbreviated item IDs, leading to a loss of valuable details.
Approach: They propose a Generative Recommender via semantic-aware multi-granular late fusion to integrate rich semantics efficiently with minimal information loss.
Outcome: The proposed model outperforms eight state-of-the-art recommendation models on four benchmark datasets and achieves significant improvements of 11.5-16.0% in Recall@5 and 5.3-13.6% in NDCG@5.
Scaling Beyond Context: A Survey of Multimodal Retrieval-Augmented Generation for Document Understanding (2026.acl-long)

Copied to clipboard

Challenge: Document understanding is critical for applications from financial analysis to scientific discovery.
Approach: They propose a taxonomy based on domain, retrieval modality, and granularity and review advances involving graph structures and agentic frameworks.
Outcome: The proposed model enables holistic retrieval and reasoning across all modalities, unlocking comprehensive document intelligence.
Weaver: Interweaving SQL and LLM for Table Reasoning (2025.emnlp-main)

Copied to clipboard

Challenge: Existing approaches that combine SQL and LLM rely on rigid workflows . Tables play a critical role across various domains such as finance, healthcare and scientific research .
Approach: Weaver is a modular pipeline that integrates SQL and LLM for table-based question answering.
Outcome: Weaver outperforms state-of-the-art methods on four Table QA datasets.
LILaC: Late Interacting in Layered Component Graph for Open-domain Multimodal Multihop Retrieval (2025.emnlp-main)

Copied to clipboard

Challenge: Existing multimodal document retrieval frameworks focus on textual, tabular, and visual elements, but there is a shift toward open-domain multimodal retrieval.
Approach: They propose a multimodal retrieval framework that uses a component graph and a late-interaction-based subgraph retrieval method to capture semantic relationships between components.
Outcome: The proposed framework achieves state-of-the-art retrieval performance on all five benchmarks . it is based on a layered component graph representing multimodal information at two layers .
REaR : Retrieve, Expand and Refine for Effective Multitable Retrieval (2026.acl-long)

Copied to clipboard

Challenge: REaR is retriever-agnostic and improves dense/ sparse retrievers on complex table QA datasets.
Approach: a new framework separates semantic relevance from structural joinability for efficient multi-table retrieval. adam scott and eric liu introduce REaR, a three-stage, LLM-free framework.
Outcome: a new framework improves retrieval quality and performance on complex table QA datasets . it separates semantic relevance from structural joinability and prunes weakly related candidates . the framework is retriever-agnostic and delivers performance competitive with state-of-the-art LLM-augmented retrieval systems .
H-STAR: LLM-driven Hybrid SQL-Text Adaptive Reasoning on Tables (2025.naacl-long)

Copied to clipboard

Challenge: Existing methods for tabular reasoning combine textual and symbolic reasoning in a two-stage process to address these limitations.
Approach: They propose an algorithm that integrates symbolic and semantic (textual) approaches in a two-stage process to address these limitations.
Outcome: The proposed algorithm outperforms state-of-the-art methods across three tabular question-answering and fact-verification datasets, underscoring its effectiveness and efficiency.
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.
GRAFF: GRaph-Augmented Fine-grained Fusion for Large Language Models (2026.findings-eacl)

Copied to clipboard

Challenge: Existing methods to integrate graphs into LLMs compress the graph's structural information into a single token, restricting their ability to capture deep semantic and structural information.
Approach: They propose a method that integrates fine-grained node-level structural information with corresponding text entities to LLMs via a lightweight, structure adapter module.
Outcome: The proposed method outperforms baseline models in graph-based question answering by 10.24%.

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