arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1704.01897cs.CVcs.LG
收藏

在线哈希

Online Hashing

Sun Yat-sen University(中山大学);Nanyang Technological University(南洋理工大学)

Long-Kai Huang, Qiang Yang, Wei-Shi Zheng

摘要:

虽然散列函数学习算法近年来取得了很大的成功,但现有的散列模型大多是离线的,不适合处理序列或在线数据。为了解决这个问题,这项工作提出了一个在线哈希模型,以适应数据流中的在线学习。具体地,提出了一种新的损失函数来度量汉明空间中一对数据样本之间的相似性损失。然后,一个结构化的哈希模型推导和优化的被动攻击的方式。对提出的在线哈希模型的累积损失上界进行了理论分析。此外,我们将我们的在线哈希从单一模型扩展到多模型在线哈希,训练多个模型,以保留不同的在线哈希模型,以避免有偏见的更新。通过在几个大规模数据集上的大量实验,与相关的哈希方法相比,所提出的在线哈希模型的竞争效率和有效性得到了验证。

英文摘要:

Although hash function learning algorithms have achieved great success in recent years, most existing hash models are off-line, which are not suitable for processing sequential or online data. To address this problem, this work proposes an online hash model to accommodate data coming in stream for online learning. Specifically, a new loss function is proposed to measure the similarity loss between a pair of data samples in hamming space. Then, a structured hash model is derived and optimized in a passive-aggressive way. Theoretical analysis on the upper bound of the cumulative loss for the proposed online hash model is provided. Furthermore, we extend our online hashing from a single-model to a multi-model online hashing that trains multiple models so as to retain diverse online hashing models in order to avoid biased update. The competitive efficiency and effectiveness of the proposed online hash models are verified through extensive experiments on several large-scale datasets as compared to related hashing methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑