GO TO A SECTION

↑ ↓ to navigate · Enter to openExplore all sections →
FDEInterviews logo
arXiv preprint

Gemini Embedding: Generalizable Embeddings from Gemini

Gemini Embedding combines a language-model foundation with task-aware contrastive training. Learn its data recipe, false-negative handling and benchmark caveats.

Breakdown by FDE Interviews · 10 min read · Updated

About the original · 2025
AUTHORS
Lee, Chen, Dua, Cer, et al.
FROM
Gemini Embedding Team, Google
PUBLISHED
Mar 2025 · arXiv preprint
IN THIS BREAKDOWN · 10 SECTIONS

You can read 17% of this breakdown.

01

The paper in one minute

Gemini Embedding adapts a Gemini foundation into a model that produces reusable text vectors. The report uses bidirectional attention, mean pooling over token representations and a learned projection into the output embedding space. Task prompts help define what relationship the vector should capture.

The model is trained in stages. Broad, noisy pairs first adapt the foundation toward encoding. More targeted training then uses task mixtures and hard negatives. Gemini also helps create, filter and judge training examples, and the final recipe averages selected fine-tuned checkpoints.

The result is one embedding space evaluated across multilingual, English and code tasks, along with cross-lingual retrieval. In the March 2025 comparison, the model leads several aggregate measures. That historical result does not imply that it wins every task or that a current API artifact is identical to the research checkpoint.

For an FDE, the most useful contribution is the data and evaluation discipline. A nearby passage may be another valid answer rather than a negative. A benchmark average depends on how tasks are weighted. A shorter vector changes storage, but its quality must still be measured. Those lessons remain useful when comparing later models or adapting a private retrieval system.

THE IDEA, VISUALLY
A NEARBY DOCUMENT MAY BE ANOTHER RIGHT ANSWER Synthetic training example: two records point to the same valid policy. Do not train them apart. Designated positive Retain in the denominator Duplicate positive Exclude from the negative set Incorrect alternative Check before using as a negative Positive logit: 3 Duplicate logit: 3 Negative logit: 0 Our NCE example: loss 0.717736 → 0.048587 after removing the duplicate negative Illustration of false-negative handling; synthetic logits, not Gemini measurements or a training reproduction.
Our contrastive-loss example shows why another valid positive should not be treated as a negative. The numbers are from the maintained toy, and the designated positive remains in its conventional softmax denominator.
Research notes: the problem, approach and results
68.32

multilingual mean task score, Table 1

3,072

full output dimensions, section 3.2

768

smallest stated MRL dimension, section 3.2

THE PROBLEM

A single embedding model must represent relevance across tasks, languages and code without merely fitting familiar benchmark datasets.

THE IDEA

Adapt a Gemini foundation with bidirectional encoding, task-aware contrastive training, curated synthetic data and checkpoint averaging.

THE RESULT

The March 2025 report improves several aggregate benchmarks, while its ablations show that task mix and data quality materially affect transfer.

02

Why it matters to an FDE

An enterprise corpus may mix English policy documents, local-language support queries and code. A shared embedding space can simplify that system, but a single overall score cannot establish that every language pair or task behaves acceptably. The customer needs evidence for the cases they actually serve.

This report makes training-data quality a concrete engineering topic. Incorrect positive pairs and false negatives can teach the wrong geometry even when the foundation model is strong. A synthetic query also does not prove its source passage is the best answer; relevance needs to be checked independently.

Use the paper to design a better embedding evaluation and a controlled model migration. Keep the source text, query task, vector dimension and evaluation slices explicit. Then compare the entire retrieval path, including filters and index settings, before deciding that a benchmark improvement justifies re-encoding the corpus.

THE FULL BREAKDOWN

Understand the mechanism. Try it on a real problem.

Unlock this breakdown and 199 more papers.

Premium opens every paper in full, plus every answer, concept, course and guide on the site. One payment for six months of access.

6 months · One payment · No auto-renewal

Get Premium · ₹2,000 / $25
  • ◇1 architecture diagram
  • </>2 runnable code blocks
  • ▦3 results tables
  1. 03Key takeaways

    Six lessons about task prompts, negative examples, dimensions and aggregate benchmark scores

    Free account
  2. 04How it works

    Follow the encoding architecture, contrastive supervision and data-curation stages

    Premium
  3. 05The numbers that matter

    Keep dimensions, benchmark subsets and aggregation rules attached to reported values

    Premium
  4. 06Try it yourself

    Test duplicate-negative handling and see why benchmark aggregation changes the headline

    Premium
  5. 07Where it breaks

    Recognize incomplete reproduction details and transfer failures hidden by broad benchmarks

    Premium
  6. 08Using it on a deployment

    Evaluate the current artifact while preserving the paper's lessons about data and task coverage

    Premium
  7. 09Interview angles

    Explain false negatives, task weighting and why model lineage does not determine an API contract

    Premium
Back to the paper library →