4 citations · 5 across the 3 of their papers we have counts for
4 papers
An Introduction to Johnson-Lindenstrauss Transforms
Casper Benjamin Freksen
Johnson--Lindenstrauss Transforms are powerful tools for reducing the dimensionality of data while preserving key characteristics of that data, and they have found use in many fiel…
Lower Bounds for Multiplication via Network Coding
Peyman Afshani, Casper Benjamin Freksen, Lior Kamma +1
Multiplication is one of the most fundamental computational problems, yet its true complexity remains elusive. The best known upper bound, by Fürer, shows that two -bit numbers…
Fully Understanding the Hashing Trick
Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen
Feature hashing, also known as {\em the hashing trick}, introduced by Weinberger et al. (2009), is one of the key techniques used in scaling-up machine learning algorithms. Loosely…
On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms
Casper Benjamin Freksen, Kasper Green Larsen
The Johnson-Lindenstrauss lemma is one of the corner stone results in dimensionality reduction. It says that given , for any set of vectors , there e…