AI Paper Atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Towards Optimal Binary Code Learning via Ordinal Embedding

AAAI 2016 · Learning theory and algorithms › Prediction and decision losses · approach: Locality-sensitive hashing · 45 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
use OEH ordinal-embedding hashing instead of ITQunsupervised hashing · CIFAR10 8 bitsmAP: 0.1512 -> 0.1682Helped
use OEH instead of ITQ at 8 bitsunsupervised hashing · LabelMe 8 bitsmAP: 0.3516 -> 0.3022Hurt
use OEH instead of ITQ at 64 bitsunsupervised hashing · LabelMe 64 bitsmAP: 0.4467 -> 0.4512Helped
use OEH instead of DTW-only matching in query by hummingquery by humming · MIR-QBSHquery time: 17.071 -> 0.695 s (OEH+DTW)Helped
replace EMD with OEH as first-stage filter before DTWquery by humming · MIR-QBSHTop-10 hit rate: 0.914 -> 0.907No clear effect
replace LSH/ITQ with OEH as first-stage filterOEH+DTW · MIR-QBSHTop-10 hit rate: 0.586 (LSH) / 0.872 (ITQ) -> 0.907Helped
increase number of nearest neighbours k from 10 to 20 (ablation)OEH · CIFAR10 and LabelMe 16 bitsmAPHelped

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