Estimate unresolved retrieval-tail hardness from small samples
Develop a reliable method for estimating the per-query hardness values of retrieval positives with hardness x_q less than or approximately equal to 1/S, and therefore invisible in a distractor sample of size S, so that large-gallery retrieval accuracy can be predicted without indexing the full gallery.
References
The queries that dominate large-$N$ accuracy have $x_q\lesssim1/S$ and are invisible in the sample ($K{=}0$); counting returns $0$, so we estimate their hardness from the fitted upper tail---the gap posed as open by \citet{madigan2003retrieval}.
— Web Scale on a Budget: Tail-Aware Retrieval Evaluation
(2610.17986 - Meivar et al., 13 Oct 2026) in Appendix, Section “Error analysis of the mAP estimator,” paragraph “Estimation term: the unresolved tail needs the model”