%0 Journal Article %1 pakman2018discrete %A Pakman, Ari %A Wang, Yueqi %A Mitelut, Catalin %A Lee, JinHyung %A Paninski, Liam %D 2018 %K kernels readings stochastic %T Discrete Neural Processes %U http://arxiv.org/abs/1901.00409 %X Many data generating processes involve latent random variables over discrete combinatorial spaces whose size grows factorially with the dataset. In these settings, existing posterior inference methods can be inaccurate and/or very slow. In this work we develop methods for efficient amortized approximate Bayesian inference over discrete combinatorial spaces, with applications to probabilistic clustering (such as Dirichlet process mixture models),random communities (such as stochastic block models) and random permutations. The approach exploits the exchangeability of the generative models and is based on mapping distributed, permutation-invariant representations of discrete arrangements into conditional probabilities. The resulting algorithms parallelize easily, yield iid samples from the approximate posteriors along with a probability estimate of each sample (a quantity generally unavailable using Markov Chain Monte Carlo) and can easily be applied to both conjugate and non-conjugate models, as training only requires samples from the generative model. As a scientific application, we present a novel approach to spike sorting for high-density multielectrode probes.

@article{pakman2018discrete, abstract = {Many data generating processes involve latent random variables over discrete combinatorial spaces whose size grows factorially with the dataset. In these settings, existing posterior inference methods can be inaccurate and/or very slow. In this work we develop methods for efficient amortized approximate Bayesian inference over discrete combinatorial spaces, with applications to probabilistic clustering (such as Dirichlet process mixture models),random communities (such as stochastic block models) and random permutations. The approach exploits the exchangeability of the generative models and is based on mapping distributed, permutation-invariant representations of discrete arrangements into conditional probabilities. The resulting algorithms parallelize easily, yield iid samples from the approximate posteriors along with a probability estimate of each sample (a quantity generally unavailable using Markov Chain Monte Carlo) and can easily be applied to both conjugate and non-conjugate models, as training only requires samples from the generative model. As a scientific application, we present a novel approach to spike sorting for high-density multielectrode probes.}, added-at = {2019-10-21T16:18:25.000+0200}, author = {Pakman, Ari and Wang, Yueqi and Mitelut, Catalin and Lee, JinHyung and Paninski, Liam}, biburl = {https://www.bibsonomy.org/bibtex/27204d118444631165216da6742b3c8d9/kirk86}, description = {[1901.00409] Discrete Neural Processes}, interhash = {3b5b6783f02a268d6947d0fabd8e577f}, intrahash = {7204d118444631165216da6742b3c8d9}, keywords = {kernels readings stochastic}, note = {cite arxiv:1901.00409}, timestamp = {2019-10-21T16:18:43.000+0200}, title = {Discrete Neural Processes}, url = {http://arxiv.org/abs/1901.00409}, year = 2018 }