cs.IRApr 13, 2026

The Effect of Document Selection on Query-focused Text Analysis

Authors: Sandesh S Rangreji, Mian Zhong, Anjalie Field

Organizations: Johns Hopkins University

Abstract

Analyses of document collections often require selecting what data to analyze, as not all documents are relevant to a particular research question and computational constraints preclude analyzing all documents, yet little work has examined effects of selection strategy choices. We systematically evaluate seven selection methods (from random selection to hybrid retrieval) on outputs from four text analyses methods (LDA, BERTopic, TopicGPT, HiCode) over two datasets with 26 open-ended queries. Our evaluation reveals practice guidance: semantic or hybrid retrieval offer strong go-to approaches that avoid the pitfalls of weaker selection strategies and the unnecessary compute overhead of more complicated ones. Overall, our evaluation framework establishes data selection as a methodological decision, rather than a practical necessity, inviting the development of new strategies.

Figures & tables

Appendix figures & tables12 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Jul 26, 2026

Choosing a Text Embedding Model: A Practical Benchmarking and Decision Framework

Choosing the right text embedding model is one of the most consequential -- and most frequently under-examined -- decisions in building a retrieval or search system, yet the model that tops a leaderboard is rarely the best choice for a given deployment. This report develops a practical, evidence-based framework for embedding model selection, built on a benchmarking study that evaluates T3EM (Text 3 Embedding Model), a commercial API-based embedding model, against a broad set of open-source alternatives on English-language retrieval tasks, and situates these findings within the wider Massive Text Embedding Benchmark (MTEB) landscape spanning classification, clustering, semantic similarity, reranking, pair classification, bitext mining, and summarization. Beyond raw benchmark scores, the report traces the full path from embedding model to retrieved result -- how embeddings are produced, how they are indexed and searched at scale, and how document chunking strategy shapes retrieval quality -- so that model choice can be reasoned about as one decision within a complete retrieval pipeline rather than in isolation. The result is a consolidated set of practical recommendations for selecting an embedding model according to task, latency, cost, and deployment constraints.
Apr 2, 2026

From BM25 to Corrective RAG: Benchmarking Retrieval Strategies for Text-and-Table Documents

Retrieval-Augmented Generation (RAG) systems critically depend on retrieval quality, yet no systematic comparison of modern retrieval methods exists for heterogeneous documents containing both text and tabular data. We benchmark ten retrieval strategies spanning sparse, dense, hybrid fusion, cross-encoder reranking, query expansion, index augmentation, and adaptive retrieval on a challenging financial QA benchmark of 23,088 queries over 7,318 documents with mixed text-and-table content. We evaluate retrieval quality via Recall@k, MRR, and nDCG, and end-to-end generation quality via Number Match, with paired bootstrap significance testing. Our results show that (1) a two-stage pipeline combining hybrid retrieval with neural reranking achieves Recall@5 of 0.816 and MRR@3 of 0.605, outperforming all single-stage methods by a large margin; (2) BM25 outperforms state-of-the-art dense retrieval on financial documents, challenging the common assumption that semantic search universally dominates; and (3) query expansion methods (HyDE, multi-query) and adaptive retrieval provide limited benefit for precise numerical queries, while contextual retrieval yields consistent gains. We provide ablation studies on fusion methods and reranker depth, actionable cost-accuracy recommendations, and release our full benchmark code.
Oct 24, 2025

Adaptive Data Selection for Text Classification: Hierarchical Value with a Local Utility Budget

Selecting compact training sets from heterogeneous text sources requires balancing target relevance, label reliability, and coverage. For small classifiers, discarding unfamiliar but useful texts can be as harmful as retaining annotation errors. Gradient-based selection estimates immediate target utility, whereas confidence and coverage scores capture complementary properties. Combining them with fixed weights leaves the utility sacrificed for this evidence uncontrolled across candidate pools. We propose Data Value Contribution (\DVC), which gates lexical, hidden-layer, and prediction-level evidence by neighborhood label support and calibrates its influence under a local utility budget; exact MLP gradient contractions and a monotone scoring path make the budget directly verifiable. At 20% source retention, DVC achieves 75.4 mean macro F1 across eight classification and domain-transfer tasks, exceeding the strongest baseline under shared final training by 0.7 points and random selection by 4.3; an equal-budget tuning study confirms a 0.6-point gain over calibrated quality-only selection.