mlsanityData to 14 Oct 2026

Bayesian Beta-Bernoulli Process Sparse Coding with Deep Neural Networks

arXiv 2303.08230 ↗First posted 14 Mar 2023cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Several approximate inference methods have been proposed for deep discrete latent variable models. However, non-parametric methods which have previously been successfully employed for classical sparse coding models have largely been unexplored in the context of deep models. We propose a non-parametric iterative algorithm for learning discrete latent representations in such deep models. Additionally, to learn scale invariant discrete features, we propose local data scaling variables. Lastly, to encourage sparsity in our representations, we propose a Beta-Bernoulli process prior on the latent factors. We evaluate our spare coding model coupled with different likelihood models. We evaluate our method across datasets with varying characteristics and compare our results to current amortized approximate inference methods.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 20 references that are in the map. First posted on arXiv 14 Mar 2023.

Builds on

7 of 20 references.

References · 7

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2013Auto-Encoding Variational Bayescited by 4,053
  3. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
  4. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
  5. 2019An Introduction to Variational Autoencoderscited by 1,000
  6. 2018Do Deep Generative Models Know What They Don't Know?cited by 443
  7. 2018Inference Suboptimality in Variational Autoencoderscited by 132

Built on by

Not cited yet.