AI Paper Atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

On the Optimal Bit Complexity of Circulant Binary Embedding

Saehoon Kim, Jungtaek Kim, Seungjin Choi

AAAI 2018 · Learning theory and algorithms › Matrix and tensor methods · approach: Randomized sketching for matrices · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Replace Gaussian random sequence with Rademacher sequence in circulant projection (ablation)CBE · MNIST, CIFAR-10 angle preservationrelative error of angle approximationImproved
Use circulant projection instead of unstructured projection for binary embeddingBinary embedding · MNIST, CIFAR-10 angle preservationrelative error of angle approximationNo clear effect
Use circulant projection instead of unstructured projection for binary embeddingBinary embedding · Hamming ranking, 100 nearest neighborsprecision-recallNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy