ColNanoVDR: Document-Free Query Distillation for Multi-Vector Visual Document Retrieval via Optimal Transport
Zhuchenyang Liu, Ziyi Wang, Yao Zhang, Yu Xiao
Aalto University · Independent Researcher
Published September 28, 2026 · on the feed September 29, 2026 · ▲ 7 · arXiv 2609.34899
The abstract
Multi-vector retrievers built on vision-language models lead visual document retrieval (VDR), but they run a multi-billion-parameter query encoder on every search. Distilling this encoder into a small student that queries the teacher's existing index would remove the bottleneck. The standard recipe, however, matches the teacher's MaxSim scores and so requires encoding and caching every training page, which can reach terabytes of page tokens. NanoVDR avoids pages entirely by training on the teacher's query embeddings alone, but only for single-vector retrievers. We present ColNanoVDR, to our knowledge the first framework to bring this document-free distillation to multi-vector VDR. Its objective, OTW (Optimal Transport with Learned Weights), aligns the student's query tokens with the teacher's by entropic optimal transport, with a learned weight for each student token, and needs no correspondence between the two tokenizations. We prove that the resulting alignment cost bounds the MaxSim score difference on every page. Distilled from five state-of-the-art teachers, the 149M text-only students retain about 95% of their teachers' NDCG@5 on ViDoRe v1-v3 while encoding queries up to 26x faster. Under identical training, OTW matches score distillation while encoding no page and reading 12.6x less cached teacher data.
The Brief
2:34A short podcast summary of the paper. Written and voiced by AI.
Transcript
ColNanoVDR. Document-Free Query Distillation for Multi-Vector Visual Document Retrieval via Optimal Transport. By Zhuchenyang Liu and three others, from Aalto University and Independent Researcher. Published on the twenty-eighth of September. It links to a code repository that is no longer there.
Multi-vector retrievers built on vision-language models lead visual document retrieval, but they run a query encoder with billions of parameters on every search. Distilling that encoder into a small student, one that queries the teacher's existing index, would remove the bottleneck. The standard recipe, though, matches the teacher's MaxSim scores, which means encoding and caching every training page, and that can reach terabytes of page tokens. An earlier approach, NanoVDR, avoided pages entirely by training on the teacher's query embeddings alone, but only for single-vector retrievers. Multi-vector models represent a query as many token embeddings rather than one, and that is exactly where the page-free trick had not yet been made to work.
ColNanoVDR brings that document-free distillation to multi-vector retrieval, a first as far as the authors know. Its objective is called OTW, for Optimal Transport with Learned Weights. It aligns the student's query tokens with the teacher's through entropic optimal transport, giving each student token a learned weight, and it needs no correspondence between the two tokenizations. That last property matters because a small student and a large teacher need not split a query into the same pieces. With this objective, nobody has to decide in advance which student token answers to which teacher token, and each student token carries a weight of its own that is learned rather than fixed.
The guarantee behind it is formal. The authors prove that the resulting alignment cost bounds the difference in MaxSim score on every page. Keeping that alignment cost low therefore keeps page scores close, and the pages themselves never have to be touched during training.
Students are distilled from five state-of-the-art teachers. At one hundred and forty-nine million parameters and text-only, they retain about ninety-five percent of their teachers' NDCG at five on ViDoRe versions one through three, while encoding queries up to twenty-six times faster.
The more direct comparison isolates the objective. Under identical training, OTW matches score distillation while encoding no page at all and reading twelve point six times less cached teacher data.
The shift is in what gets compared. Score matching compares pages, and so needs the pages. ColNanoVDR compares the queries themselves, and a bound carries that comparison back to every page in the index, which is where the terabytes of cached tokens drop out.
Paper Quest · 7 chapters · about 41 min
Play this paper
Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.
Chapter 1 🧩 · The problem
The index is built. The bottleneck is the giant that reads every query.
You run a visual document search engine. Pages were indexed offline once, but every search runs a multi-billion-parameter query encoder online. You want a small student to replace it and query the existing index.
The road ahead
- 1 · The problem ~7 min A huge query encoder slows every search, and the usual way to shrink it needs every training page encoded and cached.
- 2 · What came before ~3 min
- 3 · The key idea ~9 min Train the student to match the teacher's query token vectors by optimal transport with learned weights, which provably keeps page scores close without any page.
- 4 · Choose your own research ~3 min
- 5 · Build the method ~8 min Cache the teacher's query tokens, train the student to align with them by transport, then search the teacher's unchanged index.
- 6 · The experiment ~6 min You’ll guess: Distilled without encoding any document pages, what share of their teachers' NDCG@5 on ViDoRe did the 149M text-only query students keep?
- 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Free, with Google or an email address. Your stars and progress are kept.