When Is Complex Chunking Worth It? A Multi-Objective Evaluation of Chunking Methods at Scale

• URL: http://arxiv.org/abs/2608.16586v1
• Date: Mon, 17 Aug 2026 13:47:48 GMT
• Title: When Is Complex Chunking Worth It? A Multi-Objective Evaluation of Chunking Methods at Scale
• Abstract summary: We evaluate eight representative chunking strategies across two scalable corpora, three embedding models, and multiple corpus sizes.<n>Our results show that computationally expensive methods rarely provide consistent gains over simpler chunking.
• Score: 2.7605457369947892
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Dense retrieval is commonly evaluated on benchmarks that represent each document with a single embedding, even though real-world retrieval systems often index long documents that require chunking. In these settings, the chosen chunking method not only affects retrieval quality, but also indexing throughput, query latency, and memory usage. Prior comparisons of chunking strategies have mainly focused on retrieval performance, leaving operational trade-offs underexplored. To address these issues, we evaluate eight representative chunking strategies across two scalable corpora, three embedding models, and multiple corpus sizes, measuring both retrieval effectiveness and system-level costs. Our results show that computationally expensive methods rarely provide consistent gains over simpler chunking. Instead, the best performing strategy depends on the embedding model, dataset, corpus size, and target retrieval metric. Methods with similar performance can also differ substantially in operational cost, showing that chunking should be seen as a multi-objective design decision.

Related papers

• Adaptive Chunking: Optimizing Chunking-Method Selection for RAG [0.0]
  We introduce Adaptive Chunking, a framework that selects the most suitable chunking strategy for each document.<n>On a diverse corpus spanning legal, technical, and social science domains, our metric-merge adaptive method significantly improves downstream RAG performance.
  arXiv  Detail & Related papers  (2026-03-26T11:20:52Z)
• Beyond Chunk-Then-Embed: A Comprehensive Taxonomy and Evaluation of Document Chunking Strategies for Information Retrieval [37.055995647350784]
  This paper reproduces prior studies in document chunking and presents a systematic framework that unifies existing strategies.<n>Our evaluation reveals that optimal chunking strategies are task-dependent.
  arXiv  Detail & Related papers  (2026-02-19T00:27:15Z)
• SimpleMem: Efficient Lifelong Memory for LLM Agents [73.74399447715052]
  We introduce SimpleMem, an efficient memory framework based on semantic lossless compression.<n>We propose a three-stage pipeline designed to maximize information density and token utilization.<n> Experiments on benchmark datasets show that our method consistently outperforms baseline approaches in accuracy, retrieval efficiency, and inference cost.
  arXiv  Detail & Related papers  (2026-01-05T21:02:49Z)
• SmartChunk Retrieval: Query-Aware Chunk Compression with Planning for Efficient Document RAG [41.16937860730275]
  We present SmartChunk, a query-adaptive framework for efficient and robust long-document question answering (QA)<n>SmartChunk uses a planner that predicts the optimal chunk abstraction level for each query, and a lightweight compression module that produces high-level chunk embeddings without repeated summarization.<n>To reflect real-world applications, where users face diverse document types and query styles, we evaluate SmartChunk on five QA benchmarks plus one out-of-domain dataset.
  arXiv  Detail & Related papers  (2025-12-17T01:21:44Z)
• Rethinking Chunk Size For Long-Document Retrieval: A Multi-Dataset Analysis [0.0]
  We evaluate fixed-size chunking strategies and their influence on retrieval performance using multiple embedding models.<n>Our experiments, conducted on both short-form and long-form datasets, reveal that chunk size plays a critical role in retrieval effectiveness.
  arXiv  Detail & Related papers  (2025-05-27T19:39:16Z)
• Is Semantic Chunking Worth the Computational Cost? [0.0]
  This study systematically evaluates the effectiveness of semantic chunking using three common retrieval-related tasks. The results show that the computational costs associated with semantic chunking are not justified by consistent performance gains.
  arXiv  Detail & Related papers  (2024-10-16T21:53:48Z)
• CART: A Generative Cross-Modal Retrieval Framework with Coarse-To-Fine Semantic Modeling [53.97609687516371]
  Cross-modal retrieval aims to search for instances, which are semantically related to the query through the interaction of different modal data.<n>Traditional solutions utilize a single-tower or dual-tower framework to explicitly compute the score between queries and candidates.<n>We propose a generative cross-modal retrieval framework (CART) based on coarse-to-fine semantic modeling.
  arXiv  Detail & Related papers  (2024-06-25T12:47:04Z)
• SQLNet: Scale-Modulated Query and Localization Network for Few-Shot Class-Agnostic Counting [67.97870844244187]
  The class-agnostic counting (CAC) task has recently been proposed to solve the problem of counting all objects of an arbitrary class with several exemplars given in the input image.<n>We propose a novel localization-based CAC approach, termed Scale-modulated Query and Localization Network (Net)<n>It fully explores the scales of exemplars in both the query and localization stages and achieves effective counting by accurately locating each object and predicting its approximate size.
  arXiv  Detail & Related papers  (2023-11-16T16:50:56Z)
• How Does Generative Retrieval Scale to Millions of Passages? [68.98628807288972]
  We conduct the first empirical study of generative retrieval techniques across various corpus scales. We scale generative retrieval to millions of passages with a corpus of 8.8M passages and evaluating model sizes up to 11B parameters. While generative retrieval is competitive with state-of-the-art dual encoders on small corpora, scaling to millions of passages remains an important and unsolved challenge.
  arXiv  Detail & Related papers  (2023-05-19T17:33:38Z)
• Recall@k Surrogate Loss with Large Batches and Similarity Mixup [62.67458021725227]
  Direct optimization, by gradient descent, of an evaluation metric is not possible when it is non-differentiable. In this work, a differentiable surrogate loss for the recall is proposed. The proposed method achieves state-of-the-art results in several image retrieval benchmarks.
  arXiv  Detail & Related papers  (2021-08-25T11:09:11Z)
• One-Shot Object Detection without Fine-Tuning [62.39210447209698]
  We introduce a two-stage model consisting of a first stage Matching-FCOS network and a second stage Structure-Aware Relation Module. We also propose novel training strategies that effectively improve detection performance. Our method exceeds the state-of-the-art one-shot performance consistently on multiple datasets.
  arXiv  Detail & Related papers  (2020-05-08T01:59:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.