On the Optimal Bit Complexity of Circulant Binary Embedding
Lists
Only you see this
Abstract
Binary embedding refers to methods for embedding points in R d into vertices of a Hamming cube of dimension k, such that the normalized Hamming distance well preserves the pre-defined similarity between vectors in the original space. A common approach to binary embedding is to use random projection with unstructured projection, followed by one-bit quantization to produce binary codes, which has been proven that k
BibTeX
@inproceedings{kim2018optimal,
author = {Saehoon Kim and Jungtaek Kim and Seungjin Choi},
title = {{On the Optimal Bit Complexity of Circulant Binary Embedding}},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2018},
doi = {10.1609/aaai.v32i1.11818},
}Loading related content...