A Semi-Supervised Predictive Sparse Decomposition Based on Task-Driven Dictionary Learning

被引:1
作者
Le Lv
Dongbin Zhao
Qingqiong Deng
机构
[1] Institute of Automation,College of Information Science and Technology
[2] Chinese Academy of Sciences,undefined
[3] University of Chinese Academy of Sciences,undefined
[4] Beijing Normal University,undefined
来源
Cognitive Computation | 2017年 / 9卷
关键词
Semi-supervised learning; Predictive sparse decomposition; Neural networks; Dictionary learning;
D O I
暂无
中图分类号
学科分类号
摘要
In feature learning field, many methods are inspired by advances in neuroscience. Among them, neural network and sparse coding have been broadly studied. Predictive sparse decomposition (PSD) is a practical variant of these two methods. It trains a neural network to estimate the sparse codes. After training, the neural network is fine-tuned to achieve higher performance on object recognition tasks. It is widely believed that introducing discriminative information can make the features more useful for classification task. Hence, in this work, we propose applying the task-driven dictionary learning framework to the PSD and demonstrate that this new model can be optimized by the stochastic gradient descent (SGD) algorithm. Before our work, the semi-supervised auto-encoder framework has already been proposed to guide neural network to extract discriminative representations. But it does not improve the classification performance of neural network. In the experiments, we compare the proposed method with the semi-supervised auto-encoder method. The performance of PSD is used as the baseline for these two methods. On the MNIST and USPS datasets, our method can generate more discriminative and predictable sparse codes than other methods. Furthermore, the recognition accuracy of neural network can be improved.
引用
收藏
页码:115 / 124
页数:9
相关论文
共 41 条
[1]  
Gros C(2009)Cognitive computation with autonomously active neural networks: An emerging field Cogn Comput 1 77-90
[2]  
He B(2014)Fast face recognition via sparse coding and extreme learning machine Cogn Comput 6 264-277
[3]  
Xu D(2012)Task-driven learning IEEE Trans Pattern Anal Mach Intell 34 791-804
[4]  
Nian R(1993)Matching pursuits with time-frequency dictionaries IEEE Trans Signal Process 41 3397-3415
[5]  
Heeswijk M(1994)Regression shrinkage and selection via the lasso J R Stat Soc 58 267-288
[6]  
Yu Q(2001)Atomic decomposition by basis pursuit SIAM Rev 43 129-159
[7]  
Yoan M(2011)Stochastic methods for l1-regularized loss minimization J Mach Learn Res 12 1865-1892
[8]  
Amaury L(2004)Least angle regression Ann Stat 32 2004-684
[9]  
Mairal J(2002)The curvelet transform for image denoising IEEE Trans Image Process 11 670-2106
[10]  
Bach FR(2005)The contourlet transform: an efficient directional multiresolution image representation IEEE Trans Image Process 14 2091-4322