CountSketches, Feature Hashing and the Median of Three

Autor: Kasper Green Larsen, Rasmus Pagh, Jakub Tetek

Publikováno v: Larsen, K G, Pagh, R & Tetek, J 2021, CountSketches, Feature Hashing and the Median of Three . in M Meila & T Zhang (eds), Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event . Proceedings of Machine Learning Research, vol. 139, pp. 6011-6020, International Conference on Machine Learning, 18-24 July 2021, Virtual, 18/07/2021 . < http://proceedings.mlr.press/v139/larsen21a.html >
Larsen, K G, Pagh, R & Tetek, J 2021, CountSketches, Feature Hashing and the Median of Three . in M Meila & T Zhang (eds), Proceedings of the 38 th International Conference on Machine Learning . PMLR, Proceedings of Machine Learning Research, vol. 139, pp. 6011-6020, 38th International Conference on Machine Learning (ICML), Virtual, 18/07/2021 . < https://proceedings.mlr.press/v139/ >
University of Copenhagen

In this paper, we revisit the classic CountSketch method, which is a sparse, random projection that transforms a (high-dimensional) Euclidean vector $v$ to a vector of dimension $(2t-1) s$, where $t, s > 0$ are integer parameters. It is known that ev

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f28cf13f4e4642f3e34b22680076b0d1
https://pure.au.dk/portal/da/publications/countsketches-feature-hashing-and-the-median-of-three(993c82ad-30f6-470a-bea1-75885c3ca97b).html