liveBook · Manning

Contrastive divergence

As explained in Data Without Labels

Contrastive divergence is a stochastic approximation technique that estimates the gradient of a generative model's log-likelihood using short Gibbs-sampling chains.

Contrastive divergence is a stochastic approximation technique for estimating a generative model’s log-likelihood gradient. It makes Boltzmann learning more practical by replacing its computationally expensive basic procedure with a faster approximation. section 8.8.2 section 8.9.1

A contrastive-divergence update follows this pattern:

  • Start with a sample from the visible layer. section 8.9.1
  • Use Gibbs sampling to update the hidden layer and then the visible layer iteratively. section 8.9.1
  • Use the resulting stochastic estimate to adjust weights toward modeling the input-data distribution. section 8.9.1

Layer-wise RBM pretraining

During DBN pretraining, train each RBM independently with contrastive divergence. Earlier layers capture low-level features, while later layers learn increasingly abstract representations without labeled data. section 8.9.1

How Data Without Labels covers it

How deep it goes
Explains stochastic gradient estimation through alternating Gibbs updates, without detailing equations or implementation code.
Examples
Uses alternating visible-hidden Gibbs updates and layer-wise RBM pretraining within deep belief networks.
What it assumes
Builds on visible and hidden layers, Boltzmann learning, energy-based models, and Gibbs sampling.
What you can do after
Evaluate/understand how RBM layers estimate log-likelihood gradients and learn increasingly abstract features without labels.
How it connects
Connects Boltzmann machines, Boltzmann learning, Gibbs sampling, restricted Boltzmann machines, deep belief networks, and log-likelihood.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Data Without Labels. The section links point to the parts of the book it draws on.