Entropy-based Bounds on Dimension Reduction in L1

Abstract

We show that for every large enough integer N, there exists an N-point subset of L1 such that for every D>1, embedding it into 1d with distortion D requires dimension d at least N(1/D2), and that for every >0 and large enough integer N, there exists an N-point subset of L1 such that embedding it into 1d with distortion 1+ requires dimension d at least N1-O(1/(1/)). These results were previously proven by Brinkman and Charikar [JACM, 2005] and by Andoni, Charikar, Neiman, and Nguyen [FOCS 2011]. We provide an alternative and arguably more intuitive proof based on an entropy argument.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…