Making Online Sketching Hashing Even Faster

10/10/2020
by   Xixian Chen, et al.
0

Data-dependent hashing methods have demonstrated good performance in various machine learning applications to learn a low-dimensional representation from the original data. However, they still suffer from several obstacles: First, most of existing hashing methods are trained in a batch mode, yielding inefficiency for training streaming data. Second, the computational cost and the memory consumption increase extraordinarily in the big data setting, which perplexes the training procedure. Third, the lack of labeled data hinders the improvement of the model performance. To address these difficulties, we utilize online sketching hashing (OSH) and present a FasteR Online Sketching Hashing (FROSH) algorithm to sketch the data in a more compact form via an independent transformation. We provide theoretical justification to guarantee that our proposed FROSH consumes less time and achieves a comparable sketching precision under the same memory cost of OSH. We also extend FROSH to its distributed implementation, namely DFROSH, to further reduce the training time cost of FROSH while deriving the theoretical bound of the sketching precision. Finally, we conduct extensive experiments on both synthetic and real datasets to demonstrate the attractive merits of FROSH and DFROSH.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/28/2019

Supervised Online Hashing via Hadamard Codebook Learning

In recent years, binary code learning, a.k.a hashing, has received exten...
research
09/09/2021

Online Enhanced Semantic Hashing: Towards Effective and Efficient Retrieval for Streaming Multi-Modal Data

With the vigorous development of multimedia equipment and applications, ...
research
06/30/2023

Hashing-Based Distributed Clustering for Massive High-Dimensional Data

Clustering analysis is of substantial significance for data mining. The ...
research
09/16/2020

Weakly-Supervised Online Hashing

With the rapid development of social websites, recent years have witness...
research
10/02/2017

Online and Distributed Robust Regressions under Adversarial Data Corruption

In today's era of big data, robust least-squares regression becomes a mo...
research
05/31/2019

Supervised Online Hashing via Similarity Distribution Learning

Online hashing has attracted extensive research attention when facing st...
research
06/23/2020

Learning Based Distributed Tracking

Inspired by the great success of machine learning in the past decade, pe...

Please sign up or login with your details

Forgot password? Click here to reset