Department of EECS, UC Berkeley; Microsoft Research New England; Department of Computer Science, Harvard University and Department of EECS, MIT
Abhishek Shetty, Raaz Dwivedi, Lester Mackey
Distribution compression;linear time;thinning;i.i.d. sampling;Markov chain Monte Carlo;maximum mean discrepancy;reproducing kernel Hilbert space
Distribution Compression in Near-Linear Time