We introduce the hierarchical compositional network (HCN), a directed generative model able to discover and disentangle, without supervision, the building blocks of a set of binary images. The building blocks are binary features defined hierarchically as a composition of some of the features in the layer immediately below, arranged in a particular manner. At a high level, HCN is similar to a sigmoid belief network with pooling. Inference and learning in HCN are very challenging and existing variational approximations do not work satisfactorily. A main contribution of this work is to show that both can be addressed using max-product message passing (MPMP) with a particular schedule (no EM required). Also, using MPMP as an inference engine for HCN makes new tasks simple: adding supervision information, classifying images, or performing inpainting all correspond to clamping some variables of the model to their known values and running MPMP on the rest. When used for classification, fast inference with HCN has exactly the same functional form as a convolutional neural network (CNN) with linear activations and binary weights. However, HCN's features are qualitatively very different.
翻译:我们引入了等级构成网络(HCN),这是一个直接的基因模型,能够在没有监督的情况下发现和分解一组二进制图像的构件。构件是按等级界定的二进制特征,即下层某些特征的构成,以特定方式排列。在高层次上,HCN类似于集合的类形信仰网络。HCN的推论和学习非常具有挑战性,现有变异近点效果不尽如人意。这项工作的主要贡献是表明,两者都可以使用带有特定时间表(不需要EM)的最大产品信息传递(MP MP) (MP ) 来解决。此外,利用MPMP作为HCN的推断引擎使新任务变得简单:增加监管信息,对图像进行分类,或者将所有功能都与模型中的某些变量与已知值相匹配,并在休息时运行 MPMP。当用于分类时,与HCN的快速推断具有与带有线性激活和二进制重量的进制神经网络(CN)完全相同的功能形式。然而,HCN的特征在性质上是完全不同的。