paper-with-me

홈 › Papers

Using Inherent Structures to design Lean 2-layer RBMs

2018-06-12 · ICML 2018 7 · Abhishek Bansal, Abhinav Anand, Chiranjib Bhattacharyya

Understanding the representational power of Restricted Boltzmann Machines (RBMs) with multiple layers is an ill-understood problem and is an area of active research. Motivated from the approach of \emph{Inherent Structure formalism} (Stillinger & Weber, 1982), extensively used in analysing Spin Glasses, we propose a novel measure called \emph{Inherent Structure Capacity} (ISC), which characterizes the representation capacity of a fixed architecture RBM by the expected number of modes of distributions emanating from the RBM with parameters drawn from a prior distribution. Though ISC is intractable, we show that for a single layer RBM architecture ISC approaches a finite constant as number of hidden units are increased and to further improve the ISC, one needs to add a second layer. Furthermore, we introduce \emph{Lean} RBMs, which are multi-layer RBMs where each layer can have at-most $O(n)$ units with the number of visible units being n. We show that for every single layer RBM with $\Omega(n^{2+r}), r \ge 0$, hidden units there exists a two-layered \emph{lean} RBM with $\Theta(n^2)$ parameters with the same ISC, establishing that 2 layer RBMs can achieve the same representational power as single-layer RBMs but using far fewer number of parameters. To the best of our knowledge, this is the first result which quantitatively establishes the need for layering.

📄 PDF Abstract BibTeX arXiv:1806.04577

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Properties and Bayesian fitting of restricted Boltzmann machines

2016-12-04 · Andee Kaplan, Daniel Nordman, Stephen Vardeman

A restricted Boltzmann machine (RBM) is an undirected graphical model constructed for discrete or continuous random variables, with two layers, one hidden and one visible, and no conditional dependency within a layer. In…

Uncertainty Quantification

Combining Learned Representations for Combinatorial Optimization

2019-09-09 · ICLR 2019 5 · Saavan Patel, Sayeef Salahuddin

We propose a new approach to combine Restricted Boltzmann Machines (RBMs) that can be used to solve combinatorial optimization problems. This allows synthesis of larger models from smaller RBMs that have been pretrained,…

Combinatorial Optimization

Gaussian-Bernoulli RBMs Without Tears

2022-10-19 · Renjie Liao, Simon Kornblith, Mengye Ren, David J. Fleet 외

We revisit the challenging problem of training Gaussian-Bernoulli restricted Boltzmann machines (GRBMs), introducing two innovations. We propose a novel Gibbs-Langevin sampling algorithm that outperforms existing methods…

Solving MaxSAT with Matrix Multiplication

2023-11-01 · David Warde-Farley, Vinod Nair, Yujia Li, Ivan Lobov 외

We propose an incomplete algorithm for Maximum Satisfiability (MaxSAT) specifically designed to run on neural network accelerators such as GPUs and TPUs. Given a MaxSAT problem instance in conjunctive normal form, our pr…

CPU

A topological insight into restricted Boltzmann machines

2016-04-20 · Decebal Constantin Mocanu, Elena Mocanu, Phuong H. Nguyen, Madeleine Gibescu 외

Restricted Boltzmann Machines (RBMs) and models derived from them have been successfully used as basic building blocks in deep artificial neural networks for automatic features extraction, unsupervised weights initializa…