Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs.
Edith CohenJelani NelsonTamás SarlósUri StemmerPublished in: CoRR (2022)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- np hard
- worst case
- branch and bound
- optimal solution
- objective function
- lower and upper bounds
- upper and lower bounds
- lower bounding
- similarity search
- data structure
- linear programming relaxation
- file organization
- input data
- neural network
- nearest neighbor search
- constant factor
- order preserving