Name
Abstract | ||
|---|---|---|
A process centric view of robust PCA (RPCA) allows its fast approximate implementation based on a special form o a deep neural network with weights shared across all layers. However, empirically this fast approximation to RPCA fails to find representations that are parsemonious. We resolve these bad local minima by relaxing the elementwise L1 and L2 priors and instead utilize a structure inducing k-sparsity prior. In a discriminative classification task the newly learned representations outperform these from the original approximate RPCA formulation significantly. |
Year | Venue | Field |
|---|---|---|
2014 | CoRR | Pattern recognition,Computer science,Maxima and minima,Artificial intelligence,Artificial neural network,Prior probability,Discriminative model,Machine learning |
DocType | Volume | Citations |
Journal | abs/1412.8291 | 1 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maximilian Karl | 1 | 1 | 0.68 |
| Christian Osendorfer | 2 | 21 | 2.15 |