ForestDSH: A Universal Hash Design for Discrete Probability Distributions

no code implementations • 11 May 2019 • Arash Gholami Davoodi, Sean Chang, Hyun Gon Yoo, Anubhav Baweja, Mihir Mongia, Hosein Mohimani

To solve our high dimensional classification problem, we introduce distribution sensitive hashes that map jointly generated pairs $(x, y)\sim P$ to the same bucket with probability higher than random pairs $x\sim P^A$ and $y\sim P^B$, where $P^A$ and $P^B$ are the marginal probability distributions of $P$.

Dimensionality Reduction General Classification