A New Paradigm for Contextual Embeddings: Perplexity Releases pplx-embed-v2 to Set New Benchmarks

Perplexity's new contextual embedding model encodes chunks with full-document context, targeting a core RAG retrieval pain point.
Perplexity has introduced a new training approach for contextual embedding models: when encoding document chunks, the model sees the entire document rather than treating each chunk in isolation. This design addresses the long-standing RAG problem of semantic distortion when chunks lose surrounding context. The preview model `pplx-embed-v2-context-9b-preview` (9B parameters) claims SOTA results on ConTEB and turbopuffer's privately held context-bench. However, the release remains in preview, lacks independent third-party verification, and raises open questions about inference costs and technical differentiation from related work.
A New Approach to Training Embedding Models
Perplexity has unveiled a new method for training contextual embedding models. The core idea: when encoding each chunk of a document, the model is allowed to "see" the entire document at once. This stands in sharp contrast to traditional embedding approaches, which typically treat each text chunk as an isolated unit, ignoring its position within the broader document context.
Building on this approach, Perplexity has released a preview model called pplx-embed-v2-context-9b-preview, claiming it achieves state-of-the-art results across multiple benchmarks.

Contextual embedding models represent a specialized branch of embedding research. Traditional embedding models map text fragments to fixed vectors without considering where those fragments appear in a larger document. Contextual embeddings, by contrast, incorporate surrounding text or full-document information as a conditioning input when generating vectors — meaning the same passage can produce different vector representations depending on which article it appears in, more accurately capturing its meaning within a specific context. The technical roots of this idea trace back to early contextualized word vector research like ELMo and BERT, but applying it to document-level retrieval chunking only gained serious attention in the past two years as RAG systems became widely deployed at scale. Anthropic's Contextual Retrieval (2024) and various academic works have explored similar paths; Perplexity's work represents a further push at engineering scale.
Why "Full-Document Visibility" During Encoding Matters
In applications like retrieval-augmented generation (RAG), long documents are typically split into smaller chunks, which are then individually converted into vectors and stored in a vector database. This chunking process introduces a persistent pain point: once a chunk is separated from its surrounding context, it can lose critical information.
For example, consider a passage containing pronouns or references like "it," "the company," or "the aforementioned solution." Without the preceding context, an embedding vector cannot accurately capture what these references actually mean. Traditional approaches either sacrifice context entirely or rely on manually engineered overlapping windows to partially mitigate the problem — with limited effectiveness.
Perplexity's contextual embeddings directly address this structural flaw. By referencing the entire document when encoding individual chunks, the model can generate vectors that "know the context they come from," enabling more precise semantic retrieval.
In RAG engineering practice, chunking strategy has long been an unsolved challenge. Common mitigation approaches include: overlapping window chunking (adjacent chunks share some tokens to preserve continuity), parent-child chunking (retrieving fine-grained child chunks but expanding to coarser parent chunks at generation time), and using LLMs to generate standalone contextual summaries for each chunk before encoding — the approach behind Anthropic's Contextual Retrieval. These methods are all essentially "patch fixes" for the chunk isolation problem and introduce extra inference costs or hand-crafted rules. Perplexity's approach instead aims to internalize full-document awareness during the embedding model's training phase, so that at inference time, no additional preprocessing steps are needed to produce context-aware vectors — sidestepping this engineering tradeoff at the architecture level.
Benchmark Performance: ConTEB and context-bench
According to official claims, pplx-embed-v2-context-9b-preview achieves new state-of-the-art results on two benchmarks:
- ConTEB: A publicly available contextual embedding evaluation benchmark.
- context-bench: A newly released, privately held benchmark from vector database provider turbopuffer.
The fact that turbopuffer's benchmark is privately held deserves attention. Private ownership means the test data is not publicly accessible, so models cannot have "seen" the evaluation set during training — providing a more authentic measure of generalization to unseen data and avoiding the benchmark contamination that plagues public leaderboards.
Technical Signals in the Model Name
The model name v2-context-9b itself carries meaningful information: this is the second generation (v2) of the embedding model, with an explicit emphasis on contextual capability (context), and approximately 9 billion parameters (9b). For an embedding model, 9B is a relatively large scale — a sign that Perplexity is willing to invest significant model capacity in exchange for improved retrieval quality.
ConTEB (Contextual Text Embedding Benchmark) is an evaluation suite specifically designed to test contextual embedding capabilities, distinct from the more general MTEB (Massive Text Embedding Benchmark). MTEB covers a wide range of tasks including classification, clustering, and semantic similarity, but its retrieval subtasks typically operate on standalone sentences or paragraphs, making it difficult to assess a model's ability to handle cross-chunk dependencies within documents. ConTEB is specifically designed with scenarios that require cross-chunk understanding for correct retrieval, making it a more targeted benchmark for contextual embedding ability. It's worth noting that public benchmarks face a long-standing risk of training data contamination — models may have indirectly encountered evaluation data during pretraining or fine-tuning, inflating scores. This is one of the main motivations behind turbopuffer's decision to keep context-bench privately held.
Potential Impact on RAG and Search Applications
As a company whose core business is AI-powered search, Perplexity's investment in embeddings and retrieval has clear product motivations. Better contextual embeddings translate to:
- Higher alignment between retrieval results and user intent;
- Less information loss when chunking and retrieving complex content like long documents, technical manuals, and legal contracts;
- More accurate downstream generated answers, reducing hallucinations caused by retrieval errors.
For developers building RAG systems, if this type of contextual embedding becomes available through a usable API or as an open-source release, it could directly address the quality bottleneck in long-document retrieval.
Reasons for Caution
This release is still in "preview" stage, and the information available primarily comes from a brief official announcement — independent third-party reproduction and comparative evaluation are not yet available. Several questions remain unanswered:
- The specific technical differences between this approach and existing contextual embedding methods (including other research that similarly emphasizes document-level context);
- Performance in real-world business scenarios beyond ConTEB and context-bench;
- Inference costs — the compute and latency burden of a 9B-scale embedding model during large-scale indexing.
Until a more complete technical report and community-driven testing emerge, the claim of "achieving SOTA" is better treated as a signal worth tracking than a settled conclusion. That said, the underlying direction — letting chunk encoding "see the full document" — does squarely address a core pain point in current RAG retrieval, and is worth continued attention.
The 9B parameter scale brings not just performance gains but also significant inference cost pressure. Mainstream embedding models (such as OpenAI's text-embedding-3-small or lightweight versions of the BGE series) typically operate in the 100M–500M parameter range, with low latency and high throughput as primary design goals. In large-scale document indexing scenarios where millions or even billions of chunks must be individually encoded, the per-inference cost of a 9B model is roughly tens of times that of a smaller model with equivalent precision, placing much higher demands on GPU memory and batch processing efficiency. Even if this model genuinely outperforms existing solutions on retrieval quality, its actual adoption rate in production environments will largely depend on whether Perplexity can offer a low-cost API, or distill and compress it into a lighter deployment configuration.
Related articles

JobRunner MCP Server: AI Agents Can Now Fix Failed Java Jobs
JobRunner launches an open-source MCP server enabling AI agents to view cluster status, diagnose failures, and recover Java jobs—incident response from any cloud coding environment or existing agent.

MLAI Digital Launches 9 Security Agents: MCP Server Safeguards the Full Lifecycle of Agentic AI
MLAI Digital launches Security MCP Server with nine built-in specialized security agents covering vulnerability discovery, attack simulation, prompt injection detection, API and infrastructure assessment, and accelerated remediation—embedding security validation across the full Agentic AI lifecycle from development to production.

Running Isaac Lab on H100 GPUs: Exploring Better Approaches
Exploring optimization methods for running Isaac Lab on NVIDIA H100 GPUs, including MIG configuration, mixed precision, TensorRT acceleration, and community experience to improve robotics simulation and reinforcement learning efficiency.