Better Mixing via Deep Representations
Yoshua Bengio, Gr\'egoire Mesnil, Yann Dauphin, Salah Rifai

TL;DR
This paper investigates how deep representations that better disentangle underlying factors can lead to faster mixing of Markov chains, supported by experiments showing improved sampling efficiency at higher representation levels.
Contribution
It proposes and tests the hypothesis that higher-level representations facilitate faster Markov chain mixing by better filling the space and unfolding high-density manifolds.
Findings
Higher-level representations improve mixing efficiency.
Samples at higher levels fill space more uniformly.
High-density manifolds tend to unfold in deeper representations.
Abstract
It has previously been hypothesized, and supported with some experimental evidence, that deeper representations, when well trained, tend to do a better job at disentangling the underlying factors of variation. We study the following related conjecture: better representations, in the sense of better disentangling, can be exploited to produce faster-mixing Markov chains. Consequently, mixing would be more efficient at higher levels of representation. To better understand why and how this is happening, we propose a secondary conjecture: the higher-level samples fill more uniformly the space they occupy and the high-density manifolds tend to unfold when represented at higher levels. The paper discusses these hypotheses and tests them experimentally through visualization and measurements of mixing and interpolating between samples.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGenerative Adversarial Networks and Image Synthesis · Bayesian Methods and Mixture Models · Markov Chains and Monte Carlo Methods
