On Adaptive Distance Estimation
Authors: Yeshwanth Cherapanamjeri, Jelani Nelson
NeurIPS 2020 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | In Figure 1, we illustrate the results of our attack on the JL sketch as well as an implementation of our algorithm when d = 5000 and k = 250 (for computational reasons, we chose a much smaller value of l = 200 to implement our data structure). |
| Researcher Affiliation | Academia | Yeshwanth Cherapanamjeri Electrical Engineering and Computer Science University of California at Berkeley Berkeley, CA 94720 yeshwanth@berkeley.edu Jelani Nelson Electrical Engineering and Computer Science University of California at Berkeley Berkeley, CA 94720 minilek@berkeley.edu |
| Pseudocode | Yes | Algorithm 1 Compute Data Structure ( p space for 0 < p < 2, based on [Ind06]) and Algorithm 2 Process Query ( p space for 0 < p < 2, based on [Ind06]) are presented with clear algorithm blocks. |
| Open Source Code | No | The paper does not provide concrete access to source code for the methodology described. There is no explicit code release statement or repository link. |
| Open Datasets | No | The paper uses a custom, small dataset for its experimental evaluation, described as "{ e1, 0, e1}" for an attack, but does not provide any access information (link, DOI, citation) for a publicly available or open dataset. |
| Dataset Splits | No | The paper does not provide specific dataset split information (exact percentages, sample counts, citations to predefined splits, or detailed splitting methodology) for training, validation, or testing. |
| Hardware Specification | No | The paper does not provide specific hardware details (exact GPU/CPU models, processor types, memory amounts, or detailed computer specifications) used for running its experiments. |
| Software Dependencies | No | The paper does not provide specific ancillary software details with version numbers (e.g., library or solver names with version numbers) needed to replicate the experiment. |
| Experiment Setup | Yes | In Figure 1, we illustrate the results of our attack on the JL sketch as well as an implementation of our algorithm when d = 5000 and k = 250 (for computational reasons, we chose a much smaller value of l = 200 to implement our data structure). ... The attack we describe can be carried out for any database of at least two points; for the sake of simplicity, we describe our attack applied to the database of three points { e1, 0, e1} where e1 is the 1st standard basis vector. |