Unsupervised feature learning from finite data by message passing: discontinuous versus continuous phase transition
Haiping Huang, Taro Toyoizumi

TL;DR
This paper investigates unsupervised feature learning from finite data using message passing in restricted Boltzmann machines, revealing phase transitions and data requirements, with implications for deep learning pretraining.
Contribution
It introduces an efficient message passing algorithm to analyze finite data unsupervised learning and uncovers phase transition phenomena affecting learning efficiency.
Findings
Learning requires few data for salient features
Entropy decreases and becomes negative before instability, indicating a discontinuous phase transition
In an approximate Hopfield model, only continuous transitions occur
Abstract
Unsupervised neural network learning extracts hidden features from unlabeled training data. This is used as a pretraining step for further supervised learning in deep networks. Hence, understanding unsupervised learning is of fundamental importance. Here, we study the unsupervised learning from a finite number of data, based on the restricted Boltzmann machine learning. Our study inspires an efficient message passing algorithm to infer the hidden feature, and estimate the entropy of candidate features consistent with the data. Our analysis reveals that the learning requires only a few data if the feature is salient and extensively many if the feature is weak. Moreover, the entropy of candidate features monotonically decreases with data size and becomes negative (i.e., entropy crisis) before the message passing becomes unstable, suggesting a discontinuous phase transition. In terms of…
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
MethodsRestricted Boltzmann Machine
