2026-08-14T17:35:08Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:8254 2024-03-06T10:41:49Z ddc:004 open_access

On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms Freksen, Casper Benjamin Larsen, Kasper Green dimensionality reduction Johnson-Lindenstrauss Toeplitz matrices The Johnson-Lindenstrauss lemma is one of the corner stone results in dimensionality reduction. It says that given N, for any set of N, vectors X \subset R^n, there exists a mapping f : X --> R^m such that f(X) preserves all pairwise distances between vectors in X to within(1 ± \eps) if m = O(\eps^{-2} lg N). Much effort has gone into developing fast embedding algorithms, with the Fast Johnson-Lindenstrauss transform of Ailon and Chazelle being one of the most well-known techniques. The current fastest algorithm that yields the optimal m = O(\eps{-2}lg N) dimensions has an embedding time of O(n lg n + \eps^{-2} lg^3 N). An exciting approach towards improving this, due to Hinrichs and Vybíral, is to use a random m times n Toeplitz matrix for the embedding. Using Fast Fourier Transform, the embedding of a vector can then be computed in O(n lg m) time. The big question is of course whether m = O(\eps^{-2} lg N) dimensions suffice for this technique. If so, this would end a decades long quest to obtain faster and faster Johnson-Lindenstrauss transforms. The current best analysis of the embedding of Hinrichs and Vybíral shows that m = O(\eps^{-2} lg^2 N) dimensions suffice. The main result of this paper, is a proof that this analysis unfortunately cannot be tightened any further, i.e., there exists a set of N vectors requiring m = \Omega(\eps^{-2} lg^2 N) for the Toeplitz approach to work. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Casper Benjamin Freksen and Kasper Green Larsen 2017 Is Part Of LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ISAAC.2017.32 urn:nbn:de:0030-drops-82540 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.32 eng https://creativecommons.org/licenses/by/3.0/legalcode