AI & ML
Learning Binary Codes with Spiking Neural Networks for Cross-Modal Hashing Retrieval
arXiv cs.IR0 views
arXiv:2606.00740v2 Announce Type: replace Abstract: Cross-modal hashing (CMH) uses compact binary codes for efficient image-text retrieval. Most methods learn image-text relationships in a continuous space and binarize the representation only at the end. Semantic learning and bit decisions thus remain largely separate. This work addresses two key questions concerning hash-bit generation: \textbf{(1) How to determine hash bits?} We leverage the discrete nature of spiking activity and determine each bit through competition between positive and negative spikes accumulated over time, rather than through a single firing event or subsequent thresholding of continuous representations. \textbf{(2) How to generate such hash bits?} We propose an unsupervised spiking framework for cross-modal hashing, in which image and text jointly contribute to hash-bit generation through temporal interaction. An activation constraint further prevents unsupported decisions caused by silent channel pairs. Extensive experiments on three benchmarks demonstrate the effectiveness of our approach and support temporal spike competition as a design principle for hash-code generation.
Source:https://arxiv.org/abs/2606.00740PreviousVariance-Optimal Counterfactual Policy Design for Sample-Efficient Online A/B TestingNextKnow Before You Fetch: When Does Confidence-Based Retrieval-Budget Allocation Pay Off?
Related posts
How to detect user frustration in chatbot conversations
0dev.to
Mình Đã Biến Gemini Thành Trợ Lý Cá Nhân Như Thế Nào (Lịch, Drive, Gmail và Những Lần Suýt Toang)
0dev.to
Im looking fr any free ai models / tools are there?, leaVE UR Lights💡
0dev.to
I checked 10 SEO agency websites for AI-search readiness. The real bugs were the boring ones.
0dev.to

How much GPU memory does an LLM need? The whole sum, worked out on real cards
0dev.to

Routing Upscaling Jobs by Output Size, Not Input Size
0dev.to