Google Research has introduced Retrieve-for-Train, or R4T, a framework designed to remove one of the more stubborn bottlenecks in complex AI search: using a large language model to reason through every query at inference time.
Rather than asking an LLM to generate and evaluate multiple search directions whenever a request arrives, R4T performs that expensive reasoning during training. The resulting behavior is transferred into a 53.9 million-parameter diffusion model that generates an entire set of retrieval embeddings without autoregressive text generation. Google reports a 12× to 20× speedup over autoregressive fan-out approaches while retaining most of the retrieval quality gained through reinforcement learning.
The Google Research announcement presents R4T as a route to fast, low-cost, “expert-level” search slates. The underlying Retrieve-for-Train paper, published at ICML 2026, supports the performance and latency claims across several retrieval datasets. However, “expert-level” needs qualification: the experiments measure property-aligned retrieval, not a head-to-head contest with human search experts.
Complex AI Search Has a Fan-Out Problem
Many search requests cannot be handled well by finding the documents or products most similar to a single query.
Consider a user asking for a “cross-functional team to launch a sustainable fashion brand.” A useful result needs to cover different roles, such as materials, design, manufacturing, marketing, and supply-chain management. Returning five variations of the same designer profile would produce individually relevant results but a poor overall slate.
This is a set-valued retrieval problem. The system is judged on the complete group of results, including properties such as:
- relevance to the original request,
- diversity across the slate,
- coverage of different parts of the user’s intent,
- grounding in items that actually exist in the database,
- coherence between the retrieved items.
Traditional embedding search ranks candidates independently by similarity. It has no direct mechanism for reasoning about how one selected item should affect the rest of the slate.
LLMs offer a more flexible approach called query fan-out. The model converts a broad request into several focused subqueries, retrieves candidates for each one, and combines them into a final result set. The problem is that generating every subquery token by token can be slow, especially when the application samples multiple candidate slates and scores them before choosing one.
Generic LLMs also tend to produce safe, repetitive search expansions. A request for “bohemian festival style,” for example, may yield several near-identical subqueries containing the same obvious terms. R4T instead optimizes the fan-out process against the properties required by a particular retrieval system.
How Retrieve-for-Train Moves Reasoning Into Training
Retrieve-for-Train divides the work into three stages. The first two happen offline. Only the small diffusion retriever is required for normal inference.
Reinforcement Learning Discovers Better Search Directions
R4T starts with a fan-out language model, or FOLM. In the experiments, the researchers used 4-billion-parameter variants of Gemma 3 and Qwen 3 and trained them with Group Relative Policy Optimization, a reinforcement-learning algorithm.
The model receives a broad query and generates a set of more specific subqueries. Those subqueries are converted into embeddings, matched against a database, and evaluated as one slate.
The reward depends on the task. For open-ended abstract retrieval, it combines alignment with the user’s intent, diversity, and grounding in the available collection. For weakly supervised compositional retrieval, the reward emphasizes reference coverage and slate diversity. The system also penalizes duplicated or collapsed subqueries.
This stage is expensive, but it does not run for every user request. Reinforcement learning acts as an offline search process for discovering useful fan-out behavior.
The Trained LLM Generates Synthetic Supervision
Once trained, the FOLM processes thousands of queries and produces reward-aligned subquery sets. These sets are mapped to their retrieved content embeddings and stored as synthetic training pairs.
The paper reports using 10,000 to 20,000 generated query examples per dataset. Because the reward can be computed from the collection, metadata, and retrieval objective, the training pipeline does not require people to manually label every ideal slate.
At this point, the large autoregressive model has completed its primary role. It has converted the desired retrieval properties into examples that a smaller model can imitate.
A Diffusion Model Learns the Complete Slate
The final stage trains a compact transformer-based diffusion model on those synthetic pairs. It receives an embedding of the original query and generates a complete set of target content embeddings.
This is not an image diffusion model. It operates within the retrieval system’s embedding space, gradually transforming noise into the vectors representing the desired result slate. The implementation described in the paper uses 100 deterministic DDIM denoising steps.
All positions in the slate are refined jointly rather than emitted as text one token at a time. After generation, maximum inner-product search maps each generated vector to a real item in the collection. Duplicate matches are removed, and the next-nearest candidates fill any empty positions.
The important distinction is that diffusion learns the relationship between the items in the slate. It is not simply predicting several independent nearest neighbors.
The Diffusion Retriever Cuts Fan-Out Latency by 12× to 20×
Google reports that R4T’s diffusion retriever delivers a 12× to 20× wall-clock speedup over autoregressive fan-out. Under larger contextual batches, the company says autoregressive latency approached 50 seconds, while the diffusion system remained between less than one second and a few seconds.
One experiment provides a more direct comparison. On an open-ended retrieval task, the RL-trained FOLM achieved a general retrieval score of 3.94 with 7.37 seconds of latency. The diffusion model scored 3.70 at 0.69 seconds, making it roughly 10.7 times faster in that particular configuration.
The diffusion system did not fully reproduce the teacher model’s quality, but it preserved substantially more of the RL improvement than simpler distillation methods. An autoencoder baseline scored 3.22, while a deterministic sequence model scored 3.08. Both were slightly faster than diffusion, but the retrieval-quality loss was larger.
Results across the main experiments followed a similar pattern:
- On the Vocation open-ended retrieval dataset, the general score increased from 2.64 for zero-shot LLM fan-out to 3.94 for R4T-FOLM and 3.70 for R4T-Diffusion.
- On the Ads dataset, the same score increased from 3.04 for zero-shot fan-out to 3.84 for FOLM and 3.67 for diffusion.
- On Polyvore compositional retrieval, Recall@5K rose from 0.273 for single-query retrieval to 0.424 for FOLM and 0.454 for diffusion.
- On the Video dataset, Recall@5K improved from 0.163 for single-query retrieval to 0.205 for FOLM and .
Frequently Asked Questions
5 questions
1What is Google Research’s Retrieve-for-Train framework?
Retrieve-for-Train is an AI retrieval framework that moves expensive search reasoning from inference into training. It first trains an LLM with reinforcement learning to generate property-aligned subqueries, uses that model to create synthetic supervision, and then trains a 53.9 million-parameter diffusion retriever to generate complete search slates from query embeddings.
