Learning with Hierarchical-Deep Models

被引:163
作者
Salakhutdinov, Ruslan [1 ]
Tenenbaum, Joshua B. [2 ]
Torralba, Antonio [3 ]
机构
[1] Univ Toronto, Dept Stat & Comp Sci, Toronto, ON M5S 3G3, Canada
[2] MIT, Dept Brain & Cognit Sci, Cambridge, MA 02139 USA
[3] MIT, Comp Sci & Artificial Intelligence Lab, Cambridge, MA 02139 USA
基金
加拿大自然科学与工程研究理事会;
关键词
Deep networks; deep Boltzmann machines; hierarchical Bayesian models; one-shot learning; OBJECT;
D O I
10.1109/TPAMI.2012.269
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We introduce HD (or "Hierarchical-Deep") models, a new compositional learning architecture that integrates deep learning models with structured hierarchical Bayesian (HB) models. Specifically, we show how we can learn a hierarchical Dirichlet process (HDP) prior over the activities of the top-level features in a deep Boltzmann machine (DBM). This compound HDP-DBM model learns to learn novel concepts from very few training example by learning low-level generic features, high-level features that capture correlations among low-level features, and a category hierarchy for sharing priors over the high-level features that are typical of different kinds of concepts. We present efficient learning and inference algorithms for the HDP-DBM model and show that it is able to learn new concepts from very few examples on CIFAR-100 object recognition, handwritten character recognition, and human motion capture datasets.
引用
收藏
页码:1958 / 1971
页数:14
相关论文
共 44 条
[1]  
[Anonymous], P ADV NEUR INF PROC
[2]  
[Anonymous], 2010, Bayesian Nonparametrics
[3]  
[Anonymous], 2009, P INT C ART INT STAT
[4]  
[Anonymous], P 28 INT C MACH LEAR
[5]  
[Anonymous], P ADV NEUR INF PROC
[6]  
[Anonymous], 2011, P 33 ANN C COGN SCI
[7]  
[Anonymous], 2011, P 28 INT C MACH LEAR, DOI DOI 10.5555/3104482.3104528
[8]  
BABENKO B, 2009, P IEEE INT C COMP VI
[9]  
Bart E, 2005, PROC CVPR IEEE, P672
[10]   Impact of casinos on criminogenic patterns [J].
Barthe, Emmanuel ;
Stitt, B. Grant .
POLICE PRACTICE AND RESEARCH, 2009, 10 (03) :255-269