Fighting with thecurse of dimensionalityby leveraging low-dimensional intrinsic structures has become an important guiding principle in modern data science.
We show that LSH based algorithms can be made fair, without a significant loss in efficiency. Specifically, we show an algorithm that reports a point in the rneighborhood of a query q with almost uniform probability.