Robust sparse coding via self-paced learning for data representation
From MaRDI portal
Recommendations
- NAGSC: Nesterov's accelerated gradient methods for sparse coding
- Smooth sparse coding via marginal regression for learning sparse representations
- Online learning for matrix factorization and sparse coding
- Robust sparse principal component analysis
- Bag of pursuits and neural gas for improved sparse coding
Cites work
- scientific article; zbMATH DE number 1149423 (Why is no real title available?)
- A theoretical understanding of self-paced learning
- Graph Regularized Sparse Coding for Image Representation
- Graph dual regularization non-negative matrix factorization for co-clustering
- Hyperplane-based nonnegative matrix factorization with label information
- Least angle regression. (With discussion)
- Parameter convergence for EM and MM algorithms
Cited in
(5)- Autoencoding slow representations for semi-supervised data-efficient regression
- Deep random walk of unitary invariance for large-scale data representation
- On convergence properties of implicit self-paced objective
- A theoretical understanding of self-paced learning
- Collaborative linear coding for robust image classification
This page was built for publication: Robust sparse coding via self-paced learning for data representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055547)
