Why do some embeddings work for search and others do not?

Two sentences can be close in meaning while only one answers a question. “Refunds are available within 24 hours” and “Contact us with refund questions” concern the same topic. A retriever needs to learn more than broad topical similarity if the user asks for the deadline.

Before you begin: Understand similarity metrics and encoder pooling.

Ask what the model was trained to bring together

An embedding model maps inputs to vectors. Its training objective shapes which relationships those vectors express. A model trained for sentence paraphrase similarity may behave differently from one trained to match short queries with answer passages.

In contrastive training, the model is encouraged to score suitable pairs above unsuitable pairs. A query and a relevant passage form a positive pair. Other passages act as negatives. The choice of negatives matters: an unrelated recipe is easy to separate from a refund question, while a near-matching but non-answering policy paragraph is harder.

Some negatives may actually be relevant but unlabeled. Treating them as definitely wrong can teach a misleading boundary. Data quality and task definition remain important even when the loss function is mathematically clear.

Distinguish symmetric and asymmetric tasks

Comparing two sentences for paraphrase is roughly symmetric. Matching “When can I cancel?” to a long policy paragraph is asymmetric: the query and document play different roles. Some models use query/document prefixes, separate encoders, or training procedures designed for this distinction.

Use the model's documented encoding procedure. Omitting a required prefix can degrade retrieval while still producing the expected vector shape. Shape validation catches some bugs, but it does not prove the representation is being used correctly.

Inspect a small neighborhood

Create a query and four passages: the exact answer, a paraphrase of the answer, a topically related non-answer, and an unrelated passage. Compute their scores with your chosen model and inspect the ranking.

Do not supply expected numerical scores from a tutorial unless they were actually measured under the documented setup. The useful observation is which candidate outranks which and whether that relationship serves the task.

Add a negated policy and an exact identifier. These cases often reveal a gap between semantic closeness and answer usefulness. A hybrid search or reranking stage may help, but test the specific failure before adding components.

Consider dimensions and storage

Vector width affects storage and computation, but more dimensions do not guarantee better retrieval. Some models support documented dimension reduction or truncation procedures; arbitrary truncation of an unrelated model is not necessarily valid.

For a rough raw-storage estimate, one million vectors with 384 float32 coordinates require about 1.536 billion bytes for coordinates alone. IDs, text, metadata, indexes, replicas, and runtime overhead add more. This arithmetic is not a database capacity promise.

Normalization and dtype also affect behavior. Quantized vector storage may save space while changing ranking accuracy. Compare against the original representation on a held-out query set.

Plan an embedding migration

When replacing a model, create a separate index with the new vectors and its configuration. Evaluate both indexes using the same questions and relevance judgments. Do not mix vectors from incompatible spaces in one collection just because their dimensions match.

Keep source records and stable IDs independent of vector implementation. That makes re-embedding, rollback, and comparison easier. Record the model revision, preprocessing, chunking, and metric with the index version.

Diagnose a misleading improvement

A new model ranks related documents more closely together in a two-dimensional visualization, but question-answer retrieval gets worse. Which evidence should guide the decision?

Next, we will compare database options through a reproducible workload and an operational decision record.

Sources

Dense Passage Retrieval studies query-passage representation learning. Sentence-BERT studies sentence-level representations. The raw-storage calculation above is a transparent estimate, not a reported benchmark.

Continue to the next lesson.