Pith. sign in

REVIEW 2 cited by

Mix-of-Granularity: Optimize the Chunking Granularity for Retrieval-Augmented Generation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.00456 v2 pith:Y7KN6F7E submitted 2024-06-01 cs.LG cs.AIcs.CL

classification cs.LGcs.AIcs.CL
keywords granularityknowledgemix-of-granularitymogggenerationinformationoptimalreference
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Integrating information from various reference databases is a major challenge for Retrieval-Augmented Generation (RAG) systems because each knowledge source adopts a unique data structure and follows different conventions. Retrieving from multiple knowledge sources with one fixed strategy usually leads to under-exploitation of information. To mitigate this drawback, inspired by Mix-of-Expert, we introduce Mix-of-Granularity (MoG), a method that dynamically determines the optimal granularity of a knowledge source based on input queries using a router. The router is efficiently trained with a newly proposed loss function employing soft labels. We further extend MoG to MoG-Graph (MoGG), where reference documents are pre-processed as graphs, enabling the retrieval of distantly situated snippets. Experiments demonstrate that MoG and MoGG effectively predict optimal granularity levels, significantly enhancing the performance of the RAG system in downstream tasks. The code of both MoG and MoGG are released in https://github.com/ZGChung/Mix-of-Granularity.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 3 citations worldwide. Full citation record

  1. Context is Gold to find the Gold Passage: Evaluating and Training Contextual Document Embeddings

    cs.IR 2025-05 conditional novelty 6.0 of 10

    A new benchmark (ConTEB) and training method (InSeNT) show that context-aware chunk embeddings greatly improve retrieval on context-dependent queries, with minimal computational overhead.

  2. Rethinking Chunk Size For Long-Document Retrieval: A Multi-Dataset Analysis

    cs.IR 2025-05 conditional novelty 4.0 of 10

    Fixed-size chunking trade-offs depend on answer locality and embedding model: 64-128 token chunks suit fact-based QA, 512-1024 token chunks suit long-context narrative QA.

Pith tools