Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2509.14427v1

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2509.14427v1 (cs)
[Submitted on 17 Sep 2025 ]

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

Title: 哈希基线:在预训练模型时代重新思考哈希

Authors:Ilyass Moummad, Kawtar Zaher, Lukas Rauch, Alexis Joly
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.
Abstract: 使用紧凑二进制嵌入的信息检索,也称为哈希,对于可扩展的快速搜索应用至关重要,但最先进的哈希方法需要昂贵且场景特定的训练。 在本工作中,我们引入了Hashing-Baseline,这是一种强大的无需训练的哈希方法,利用产生丰富预训练嵌入的强大预训练编码器。 我们重新审视经典的、无需训练的哈希技术:主成分分析、随机正交投影和阈值二值化,以生成哈希的强大基线。 我们的方法将这些技术与最先进的视觉和音频编码器的冻结嵌入相结合,以在没有任何额外学习或微调的情况下获得具有竞争力的检索性能。 为了展示这种方法的通用性和有效性,我们在标准图像检索基准以及一个新的音频哈希基准上进行了评估。
Subjects: Machine Learning (cs.LG) ; Information Retrieval (cs.IR)
Cite as: arXiv:2509.14427 [cs.LG]
  (or arXiv:2509.14427v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2509.14427
arXiv-issued DOI via DataCite

Submission history

From: Ilyass Moummad [view email]
[v1] Wed, 17 Sep 2025 20:58:43 UTC (604 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2025-09
Change to browse by:
cs
cs.IR

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号