Contextual Compression for RAG: Implementation and Optimization
Picture this: your RAG system piles up 10 chunks of 800 tokens each, but only 100 tokens are actually useful. The LLM pays for noise, and the answers are a mess. A typical scenario – support for technical documentation: 10 chunks retrieved, only 2–3 relevant. Each chunk weighs about 800 tokens, but the useful information is just 100 tokens. The LLM wastes its context window on irrelevant text, leading to hallucinations and incomplete answers. Context window is consumed, cost grows. Contextual Compression is a technique that extracts only the query-relevant fragment from each chunk. We reduce noise, cut tokens, and improve faithfulness. Over our time in AI/ML, we have deployed this in 15+ projects — here we share our experience. Get a consultation on optimizing your RAG system.
Problems Without Contextual Compression
Standard RAG feeds the LLM full chunks (512–1024 tokens). A typical picture: a chunk contains 600 tokens, of which only 80 actually answer the question, the rest is irrelevant context. This leads to:
- Increased cost (more input tokens)
- Reduced accuracy (the LLM "gets lost" in irrelevant text)
- Shrunk effective context window (less room for truly important chunks)
How LLM-based Contextual Compression Works
from langchain.retrievers import ContextualCompressionRetriever
from langchain.retrievers.document_compressors import LLMChainExtractor
from langchain_openai import ChatOpenAI
# LLM-based compressor
llm = ChatOpenAI(model="gpt-4o-mini", temperature=0)
compressor = LLMChainExtractor.from_llm(llm)
compression_retriever = ContextualCompressionRetriever(
base_compressor=compressor,
base_retriever=vectorstore.as_retriever(search_kwargs={"k": 8}),
)
compressed_docs = compression_retriever.invoke(
"What is the contract approval procedure?"
)
# Each document contains only the relevant fragment
for doc in compressed_docs:
print(len(doc.page_content), "chars (vs original ~2000)")
According to LangChain documentation, LLMChainExtractor uses the same LLM to extract relevant content. This gives high accuracy but increases latency.
When to Use Embedding-based Compressor
A faster and cheaper option is filtering by cosine similarity. We often use it as the first stage of the pipeline:
from langchain.retrievers.document_compressors import EmbeddingsFilter
from langchain_openai import OpenAIEmbeddings
embeddings = OpenAIEmbeddings()
embeddings_filter = EmbeddingsFilter(
embeddings=embeddings,
similarity_threshold=0.76,
)
filtering_retriever = ContextualCompressionRetriever(
base_compressor=embeddings_filter,
base_retriever=vectorstore.as_retriever(search_kwargs={"k": 8}),
)
The threshold 0.76 is an empirical value that gives a good balance between recall and precision. It must be calibrated for your dataset.
Why Combine Compression and Reranking?
EmbeddingsFilter removes clearly irrelevant chunks but does not rank the remaining ones. A cross-encoder reranker (e.g., BAAI/bge-reranker-large) provides more accurate relevance sorting but is more expensive. The combination gives a sweet spot: the filter removes 40–60% of chunks, the reranker refines the order of the top-N. A pipeline with Filter and Reranker achieves 15% higher faithfulness than no compression, while being 2.5 times cheaper than the LLM Extractor.
Let's compare methods:
| Method | Cost per query | Latency p99 | Faithfulness gain |
|---|---|---|---|
| No compression | 1× | 1.8 s | — |
| EmbeddingsFilter | 0.2× | 0.3 s | +8% |
| LLM Extractor | 0.5× | 2.4 s | +19% |
| Pipeline (Filter + Reranker) | 0.4× | 0.9 s | +15% |
How to Build a Pipeline with Compression and Reranking
from langchain.retrievers.document_compressors import DocumentCompressorPipeline
from langchain_community.document_transformers import EmbeddingsRedundantFilter
from langchain.retrievers.document_compressors import CrossEncoderReranker
from langchain_community.cross_encoders import HuggingFaceCrossEncoder
cross_encoder = HuggingFaceCrossEncoder(model_name="BAAI/bge-reranker-large")
reranker = CrossEncoderReranker(model=cross_encoder, top_n=3)
compressor_pipeline = DocumentCompressorPipeline(
transformers=[
EmbeddingsFilter(embeddings=embeddings, similarity_threshold=0.75),
EmbeddingsRedundantFilter(embeddings=embeddings),
reranker,
]
)
pipeline_retriever = ContextualCompressionRetriever(
base_compressor=compressor_pipeline,
base_retriever=vectorstore.as_retriever(search_kwargs={"k": 10}),
)
Which Compressor to Choose for Your Scenario?
In production we prefer a hybrid approach: an EmbeddingsFilter for noise removal, then an LLM compressor for key queries where high accuracy is critical. If latency is a concern, we use only the EmbeddingsFilter with a low threshold (0.7–0.75).
Steps to Implement Contextual Compression
- Audit your current RAG system: metrics, bottlenecks, scenarios.
- Select and calibrate the compressor (LLM / Embedding / Pipeline).
- Integrate via LangChain or custom code.
- Test: faithfulness, relevancy, latency, cost.
- Document and train the team.
- Monitor and tweak thresholds as new data arrives.
Practical Case: From Our Client's Experience
Task: an assistant for technical manuals (chunks ~800 tokens). After compression, the average context dropped from 4800 to 1200 tokens per query.
| Metric | Without Compression | With Compression (LLM) |
|---|---|---|
| Input tokens/query | 5200 | 1450 |
| Faithfulness (RAGAS) | 0.79 | 0.94 |
| Answer Relevancy | 0.81 | 0.89 |
| Cost (GPT-4o-mini) | 1× | 0.3× |
| Latency | 1.8 s | 2.4 s (+compression LLM) |
Compression reduced cost by 3.3× while increasing faithfulness by 19%. Our engineers selected the threshold and compressor model in 2 days, with another 2 days for integration.
What's Included in the Implementation
- Audit of your current RAG system: metrics, bottlenecks, scenarios
- Selection and calibration of the compressor (LLM / Embedding / Pipeline)
- Integration via LangChain or custom code
- Testing: faithfulness, relevancy, latency, cost
- Documentation and team training
- Guarantee on optimization results according to KPIs
We support the project post-deployment — fix thresholds for new data, add monitoring. Order optimization of your RAG system and get token reduction up to 4×. Contact us to discuss your case.
Timelines and Cost
- Basic integration: from 2 days
- Calibration and testing: 2–3 days
- Full cycle (including pipeline and reranker): 1 week
Cost is calculated individually based on data volume and requirements. Average token savings are 60–70%. Order your RAG system optimization – our engineers will help select the right compressor.







