On Binary Embedding using Circulant Matrices
JOURNAL OF MACHINE LEARNING RESEARCH(2017)
摘要
Binary embeddings provide efficient and powerful ways to perform operations on large scale data. However binary embedding typically requires long codes in order to preserve the discriminative power of the input space. Thus binary coding methods traditionally suffer from high computation and storage costs in such a scenario. To address this problem, we propose Circulant Binary Embedding (CBE) which generates binary codes by projecting the data with a circulant matrix. The circulant structure allows us to use Fast Fourier Transform algorithms to speed up the computation. For obtaining k-bit binary codes from d-dimensional data, our method improves the time complexity from O(dk) to O(dlog d), and the space complexity from O (dk) to O (d).
更多查看译文
关键词
structured matrix,circulant matrix,dimensionality reduction,binary embedding,FFT
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络