Query Generation Pipeline with Enhanced Answerability Assessment for Financial Information Retrieval
Not on the map. Why?
Abstract (arXiv)
As financial applications of large language models (LLMs) gain attention, accurate Information Retrieval (IR) remains crucial for reliable AI services. However, existing benchmarks fail to capture the complex and domain-specific information needs of real-world banking scenarios. Building domain-specific IR benchmarks is costly and constrained by legal restrictions on using real customer data. To address these challenges, we propose a systematic methodology for constructing domain-specific IR benchmarks through LLM-based query generation. As a concrete implementation of this methodology, our pipeline combines single and multi-document query generation with an enhanced and reasoning-augmented answerability assessment method, achieving stronger alignment with human judgments than prior approaches. Using this methodology, we construct KoBankIR, comprising 815 queries derived from 204 official banking documents. Our experiments show that existing retrieval models struggle with the complex multi-document queries in KoBankIR, demonstrating the value of our systematic approach for domain-specific benchmark construction and underscoring the need for improved retrieval techniques in financial domains.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 29 of its 47 references that are in the map. First posted on arXiv 7 Nov 2025.
Builds on
29 of 47 references.
References · 29
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
- 2023G-Eval: NLG Evaluation using GPT-4 with Better Human Alignmentcited by 2,276
- 2020Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Stepscited by 1,282
- 2022Text Embeddings by Weakly-Supervised Contrastive Pre-trainingcited by 1,253
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
- 2024M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillationcited by 1,073
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 849
- 2021Did Aristotle Use a Laptop? A Question Answering Benchmark with Implicit Reasoning Strategiescited by 743
- 2023Towards General Text Embeddings with Multi-stage Contrastive Learningcited by 723
- 2022MTEB: Massive Text Embedding Benchmarkcited by 640
17 more
- 2021FinQA: A Dataset of Numerical Reasoning over Financial Datacited by 562
- 2018The Web as a Knowledge-base for Answering Complex Questionscited by 410
- 2024Multilingual E5 Text Embeddings: A Technical Reportcited by 372
- 2022Text and Code Embeddings by Contrastive Pre-Trainingcited by 361
- 2023The Belebele Benchmark: a Parallel Reading Comprehension Dataset in 122 Language Variantscited by 311
- 2021Learning Passage Impacts for Inverted Indexescited by 68
- 2024DocFinQA: A Long-Context Financial Reasoning Datasetcited by 60
- 2024FinTextQA: A Dataset for Long-form Financial Question Answeringcited by 54
- 2023LeCaRDv2: A Large-Scale Chinese Legal Case Retrieval Datasetcited by 38
- 2024MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodingscited by 32
- 2024FanOutQA: A Multi-Hop, Multi-Document Question Answering Benchmark for Large Language Modelscited by 29
- 2023REFinD: Relation Extraction Financial Datasetcited by 17
- 2024QGEval: Benchmarking Multi-dimensional Evaluation for Question Generationcited by 17
- 2023DORIS-MAE: Scientific Document Retrieval using Multi-level Aspect-based Queriescited by 11
- 2024Bilingual BSARD: Extending Statutory Article Retrieval to Dutchcited by 5
- 2025TWICE: What Advantages Can Low-Resource Domain-Specific Embedding Model Bring? -- A Case Study on Korea Financial Textscited by 3
- 2023End-to-End Retrieval with Learned Dense and Sparse Representations Using Lucenecited by 2
Built on by
Not cited yet.