Entropy-based bounds on dimension reduction in L1

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^{\Omega (1/{D^2})}}$$, 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 $${N^{\Omega (1/{D^2})}}$$). 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.

[1]  J. R. Lee,et al.  Embedding the diamond graph in Lp and dimension reduction in L1 , 2004, math/0407520.

[2]  Ashwin Nayak,et al.  Optimal lower bounds for quantum automata and random access codes , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[3]  Alexandr Andoni,et al.  Near Linear Lower Bound for Dimension Reduction in L1 , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[4]  Kenneth Ward Church,et al.  Nonlinear Estimators and Tail Bounds for Dimension Reduction in l1 Using Cauchy Random Projections , 2006, J. Mach. Learn. Res..

[5]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .