Rational reciprocity law

Diagram of a restricted Boltzmann machine with three visible units and four hidden units (no bias units).

A restricted Boltzmann machine (RBM) is a generative stochastic neural network that can learn a probability distribution over its set of inputs. RBMs were initially invented under the name Harmonium by Paul Smolensky in 1986, but only rose to prominence after Geoffrey Hinton and collaborators invented fast learning algorithms for them in the mid-2000s. RBMs have found applications in dimensionality reduction, classification, collaborative filtering, feature learning and topic modelling. They can be trained in either supervised or unsupervised ways, depending on the task.

As their name implies, RBMs are a variant of Boltzmann machines, with the restriction that their neurons must form a bipartite graph: they have input units, corresponding to features of their inputs, hidden units that are trained, and each connection in an RBM must connect a visible unit to a hidden unit. (By contrast, "unrestricted" Boltzmann machines may have connections between hidden units, making them recurrent networks.) This restriction allows for more efficient training algorithms than are available for the general class of Boltzmann machines, in particular the gradient-based contrastive divergence algorithm.

Restricted Boltzmann machines can also be used in deep learning networks. In particular, deep belief networks can be formed by "stacking" RBMs and optionally fine-tuning the resulting deep network with gradient descent and backpropagation.

Structure

The standard type of RBM has binary-valued (Boolean) hidden and visible units, and consists of a symmetric matrix of weights $W=(w_{i,j})$ associated with the connection between hidden unit $h_j$ and visible unit $v_i$, as well as bias weights (offsets) $a_i$ for the visible units and $b_j$ for the hidden units. Given these, the energy of a configuration $(v,h)$ can be computed as

$E(v,h)=-\sum _i{a}_i{v}_i-\sum _j{b}_j{h}_j-\sum _i\sum _j{h}_j{w}_{i,j}{v}_i$

or, in vector form,

$E(v,h)=-a^{\mathrm{T}}v-b^{\mathrm{T}}h-h^{\mathrm{T}}Wv$

This energy function is analogous to that of a Hopfield network. As in general Boltzmann machines, probability distributions over hidden and/or visible vectors are defined in terms of the energy function:

$P(v,h)=\frac{1}{Z}{e}^{-E(v,h)}$

where $Z$ is a partition function defined as the sum of $e^{-E(v,h)}$ over all possible configurations (in other words, just a normalizing constant to ensure the probability distribution sums to 1). Similarly, the (marginal) probability of a visible (input) vector of booleans is the sum over all possible hidden layer configurations:

$P(v)=\frac{1}{Z}\sum _h{e}^{-E(v,h)}$

Since the RBM has the shape of a bipartite graph, with no intra-layer connections, the hidden unit activations are mutually independent given the visible unit activations and conversely, the visible unit activations are mutually independent given the hidden unit activations. That is, for $m$ visible units and $n$ hidden units,

$P(v|h)=\prod _{i=1}^{m}P(v_i|h)$

$P(h|v)=\prod _{j=1}^{n}P(h_j|v)$

and the individual activation probabilities are given by

$P(h_j=1|v)=\sigma (b_j+\sum _{i=1}^m{w}_{i,j}{v}_i)$

and

$P(v_i=1|h)=\sigma (a_i+\sum _{j=1}^n{w}_{i,j}{h}_j)$

where $\sigma$ denotes the logistic sigmoid.

Relation to other models

Restricted Boltzmann machines are a special case of Boltzmann machines and Markov random fields. Their graphical model corresponds to that of factor analysis.

Training algorithm

Restricted Boltzmann machines are trained to maximize the product of probabilities assigned to some training set $V$ (a matrix, each row of which is treated as a visible vector $v$),

$\arg {\max }_W\prod _{v\in V}P(v)$

or equivalently, to maximize the expected log probability of $V$:

$\arg {\max }_W\mathbb{𝔼}[\sum _{v\in V}\log P(v)]$

The algorithm most often used to train RBMs, that is, to optimize the weight vector $W$, is the contrastive divergence (CD) algorithm due to Hinton, originally developed to train product of experts models. The algorithm performs Gibbs sampling and is used inside a gradient descent procedure (similar to the way backpropagation is used inside such a procedure when training feedforward neural nets) to compute weight update.

The basic, single-step contrastive divergence (CD-1) procedure for a single sample can be summarized as follows:

1. Take a training sample $v$, compute the probabilities of the hidden units and sample a hidden activation vector $h$ from this probability distribution.
2. Compute the outer product of $v$ and $h$ and call this the positive gradient.
3. From $h$, sample a reconstruction $v^{\prime }$ of the visible units, then resample the hidden activations $h^{\prime }$ from this.
4. Compute the outer product of $v^{\prime }$ and $h^{\prime }$ and call this the negative gradient.
5. Let the weight update to $w_{i,j}$ be the positive gradient minus the negative gradient, times some learning rate.

See also

• Autoencoder
• Deep learning
• Helmholtz machine
• Hopfield network

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

External links

• Introduction to Restricted Boltzmann Machines. Edwin Chen's blog, July 18, 2011.