Embeddings only
No LLM calls are required for tree construction or navigation.
A project by ServiceNow Research
Hierarchical retrieval that keeps the interpretability of tree-based search without giving up the speed of dense retrieval.
1ServiceNow Research · 2Université Laval · 3Mila - Québec AI Institute · 4McGill University
Motivation
ReTreever learns a binary tree directly over embeddings. The hierarchy is optimized for retrieval, not clustering, so it can produce strong nearest-neighbor representations while exposing semantic retrieval paths.
No LLM calls are required for tree construction or navigation.
Any tree level can be used as a representation.
Queries and documents can be traced through the learned tree.
Single-index and multi-index retrieval both come from one learned hierarchy.
Key findings
| Dataset | RAPTOR latency | RAPTOR NDCG@10 | ReTreever latency | ReTreever NDCG@10 |
|---|---|---|---|---|
| NQ | 1758.05 | 40.28 | 10.65 | 54.48 |
| HotpotQA | 2246.51 | 59.37 | 10.01 | 85.04 |
| TopiOCQA | 701.61 | 18.69 | 9.66 | 31.00 |
| RepLiQA | 1647.18 | 49.58 | 9.47 | 80.23 |
Showcase
The trees below are intentionally large: they are the main visual evidence for ReTreever's inspectability.
Browse paths and semantic groupings directly in the demo.


Resources
Open the ICML 2026 paper.
PosterICML poster PDFView the final poster.
SlidesTalk slides PDFOpen the original provided slides.
InspectorInteractive tree demoExplore learned paths and semantic groups.
CodeComing soonPublic release will be added here.
@inproceedings{gupta2026retreever,
title = {Hierarchical Retrieval at Scale: Bridging Interpretability and Efficiency},
author = {Gupta, Shubham and Li, Zichao and Chen, Tianyi and Subakan, Cem and Reddy, Siva and Taslakian, Perouz and Zantedeschi, Valentina},
booktitle = {Proceedings of the 43rd International Conference on Machine Learning},
year = {2026}
}