Polaris is presented, a system that trains an LLM to generate table descriptions directly from retrieval feedback, and demonstrates that retrieval benchmarks can be repurposed as supervision for training LLMs to generate retrieval-oriented metadata.
Abstract
Many table-centric NLP tasks such as NL2SQL first retrieve relevant tables from large collections using keyword search. Recent work uses LLMs to generate natural-language table descriptions to improve retrieval, but they are typically optimized for fluency rather than retrieval effectiveness. We present Polaris, a system that trains an LLM to generate table descriptions directly from retrieval feedback. Our key insight is that existing table retrieval benchmarks already contain the supervision needed for this task: given query-table relevance judgments, we generate multiple candidate descriptions for each table, rank them by their BM25 retrieval effectiveness, and use the resulting preference pairs to fine-tune the LLM with Direct Preference Optimization (DPO). Polaris further expands abbreviated table and column names before generation to reduce vocabulary mismatch. Extensive experiments show that Polaris outperforms the state-of-the-art AutoDDG solution, often by a significant margin. More broadly, our results demonstrate that retrieval benchmarks can be repurposed as supervision for training LLMs to generate retrieval-oriented metadata.
Evaluation on WikiSA and ExaRank shows that ranking-based few-shot prompting generally improves over zero-shot prompting and achieves competitive performance against random-shot prompting, indicating that retrieval-based demonstration selection is beneficial but not uniformly superior in all settings.
A. Laksito, Aali Alqarni, Mark Stevenson· International Conference on...· 0 citations
GeCo-TR is proposed, a zero-shot table retrieval framework that eliminates the need for supervised QA data by shifting from direct query-to-table learning to modeling the intrinsic structural semantics of the table corpus, resulting in high-precision and high-recall retrieval for implicit queries in a zero-shot setting...
Zhou He, Zhifei Pang, Xiu Tang et al.· Annual International ACM SIG...· 0 citations
This work introduces AnchorQE, a training-free method that separately encodes the original query and its expansion before interpolating them, and shows that AnchorQE improves retrieval effectiveness by up to 12.89% when compared to widely-used expansion-only or text-level concatenation baselines across TREC-DL, LoTTE,...
This work presents Cross-Encoder Query Expansion (CE-QE), which reads the per-token relevance attributions of a cross-encoder applied to top semantic search results, selects the terms the cross-encoder treats as decisive, and appends them to the BM25 query.
Adam Kahirov, Umesh Deshpande, S. Sundararaman· 0 citations
Results demonstrate that hypothetical document generation does not improve ranking performance for short-form or long-form queries, and a Hypothetical Document Embeddings (HyDE) layer into the retrieval pipeline is proposed and evaluated.
Lily Hanslik, Ian Ortega, Hunter Sandidge et al.· 55th International Conferenc...· 0 citations
Results demonstrate a 157% improvement in retrieval quality over a Naive-RAG baseline, with only 50 ms additional la tency, while Qwen2-VL-2B-Instruct achieved results comparable to cloud-based models in BERTScore, validate that open-source optimized SLMs, paired with advanced retrieval strategies, can provide competit...