Johnson-Lindenstrauss Lemma

Rishikesh will present An Elementary Proof of a Theorem of Johnson and Lindenstrauss (http://www.cs.cmu.edu/~anupamg/papers/jl.pdf) by Dasgupta and Gupta, with additional material from Ailon and Chazelle's The Fast Johnson-Lindenstrauss Transform and Approximate Nearest Neighbors (https://www.cs.princeton.edu/~chazelle/pubs/FJLT-sicomp09.pdf).

The Johnson-Lindenstrauss Lemma (http://en.wikipedia.org/wiki/Johnson%E2%80%93Lindenstrauss_lemma) is pretty awesome, and with the advent of the Fast Johnson-Lindenstrauss Transform (https://www.cs.princeton.edu/~chazelle/pubs/FJLT-sicomp09.pdf) this has become a practical tool for dimensionality reduction, approximate nearest neighbors, collision detection, among other things. There are applications for everyone who's dealing with the curse of dimensionality (http://en.wikipedia.org/wiki/Curse_of_dimensionality), from machine learning to realtime videogames.

Note that this talk will be hosted at Autodesk and will begin at 7pm.