Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs

Cite

Text

Cohen et al. "Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs." AAAI Conference on Artificial Intelligence, 2023. doi:10.1609/AAAI.V37I6.25882

Markdown

[Cohen et al. "Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs." AAAI Conference on Artificial Intelligence, 2023.](https://mlanthology.org/aaai/2023/cohen2023aaai-tricking/) doi:10.1609/AAAI.V37I6.25882

BibTeX

@inproceedings{cohen2023aaai-tricking,
  title     = {{Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs}},
  author    = {Cohen, Edith and Nelson, Jelani and Sarlós, Tamás and Stemmer, Uri},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2023},
  pages     = {7235-7243},
  doi       = {10.1609/AAAI.V37I6.25882},
  url       = {https://mlanthology.org/aaai/2023/cohen2023aaai-tricking/}
}