SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2010.00712 · ICLR · 2021

Faster Binary Embeddings for Preserving Euclidean Distances

Jinjie Zhang, Rayan Saab

arXiv · PDF · Open in the Atlas

Code that ran

3 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 failures of our instrument; 0 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2010.00712.json · badge: /api/ran/2010.00712.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
jayzhang0727/Faster-Binary-Embeddings-for-Preserving-Euclidean-Distances marked official in Papers with Code
Papers with Code archive
3 ran · 0 no recorded run
FunctionStatusWhere it lives
convolve Ran
ran; our contract draft was wrong, not the code
jayzhang0727/Faster-Binary-Embeddings-for-Preserving-Euclidean-Distances/quantizer.py
pointer only (licence: NONE) · get_code("fb3b17dd2381266d")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, jayzhang0727/Faster-Binary-Embeddings-for-Preserving-Euclidean-Distances when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

first_quantizer Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
jayzhang0727/Faster-Binary-Embeddings-for-Preserving-Euclidean-Distances/quantizer.py
pointer only (licence: NONE) · get_code("f8ff3eb05259e239")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, jayzhang0727/Faster-Binary-Embeddings-for-Preserving-Euclidean-Distances when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

sign Ran
ran, honoured the contract we drafted
jayzhang0727/Faster-Binary-Embeddings-for-Preserving-Euclidean-Distances/quantizer.py
pointer only (licence: NONE) · get_code("902d718e6fa622f5")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, jayzhang0727/Faster-Binary-Embeddings-for-Preserving-Euclidean-Distances when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 3 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

We propose a fast, distance-preserving, binary embedding algorithm to transform a high-dimensional dataset T ⊆ R n into binary sequences in the cube {±1} m . When T consists of well-spread (i.e., non-sparse) vectors, our embedding method applies a stable noise-shaping quantization scheme to Ax where A ∈ R m×n is a sparse Gaussian random matrix. This contrasts with most binary embedding methods, which usually use x → sign(Ax) for the embedding. Moreover, we show that Euclidean distances among the elements of T are approximated by the 1 norm on the images of {±1} m under a fast linear transformation. This again contrasts with standard methods, where the Hamming distance is used instead. Our method is both fast and memory efficient, with time complexity O(m) and space complexity O(m) on well-spread data. When the data is not well-spread, we show that the approach still works provided that data is transformed via a Walsh-Hadamard matrix, but now the cost is O(n log n) per data point. Further, we prove that the method is accurate and its associated error is comparable to that of a continuous valued Johnson-Lindenstrauss embedding plus a quantization error that admits a polynomial decay as the embedding dimension m increases. Thus the length of the binary codes required to achieve a desired accuracy is quite small, and we show it can even be compressed further without compromising the accuracy. To illustrate our results, we test the proposed method on natural images and show that it achieves strong performance.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2010.00712")
get_code_for_paper("2010.00712")
have("2010.00712")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2010.00712.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2010.00712.svg)](https://syntology.ai/paper/2010.00712)

Connect an agent — have() is free.