Hashing-Baseline: Rethinking Hashing in the Age of Pretrained Models

Ilyass Moummad, Kawtar Zaher, Lukas Rauch, Alexis Joly
9/17/2025
cs.LGcs.IR

No official code found. Best implementation: ilyassmoummad/hashing-baseline (2 stars, last commit 2026-04-04).

Abstract

Information retrieval with compact binary embeddings, also referred to as hashing, is crucial for scalable fast search applications, yet state-of-the-art hashing methods require expensive, scenario-specific training. In this work, we introduce Hashing-Baseline, a strong training-free hashing method leveraging powerful pretrained encoders that produce rich pretrained embeddings. We revisit classical, training-free hashing techniques: principal component analysis, random orthogonal projection, and threshold binarization, to produce a strong baseline for hashing. Our approach combines these techniques with frozen embeddings from state-of-the-art vision and audio encoders to yield competitive retrieval performance without any additional learning or fine-tuning. To demonstrate the generality and effectiveness of this approach, we evaluate it on standard image retrieval benchmarks as well as a newly introduced benchmark for audio hashing.

View on arXivView PDF

Code Implementations(1)

Pytorch implementation of the paper "Hashing-Baseline: Rethinking Hashing in the Age of Pretrained Models", ICASSP 2026

20PythonSep 14, 20256 months ago

Similar Papers

Cite this paper

@article{moummad2025hashingbaseline,
  title  = {Hashing-Baseline: Rethinking Hashing in the Age of Pretrained Models},
  author = {Ilyass Moummad and Kawtar Zaher and Lukas Rauch and Alexis Joly},
  year   = {2025},
  eprint = {2509.14427},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.14427v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2509.14427.svg)](https://codeofpaper.com/paper/2509.14427)

Discussion