No more meta-parameter tuning in unsupervised sparse feature learning
classification
💻 cs.LG
cs.CV
keywords
featurelearningmeta-parameterunsupervisedalgorithmdiscriminativeexperimentsexploits
read the original abstract
We propose a meta-parameter free, off-the-shelf, simple and fast unsupervised feature learning algorithm, which exploits a new way of optimizing for sparsity. Experiments on STL-10 show that the method presents state-of-the-art performance and provides discriminative features that generalize well.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.