Sciweavers

36 search results - page 1 / 8
» Learning Fast Approximations of Sparse Coding
Sort
View
ICML
2010
IEEE
13 years 5 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
CORR
2010
Springer
253views Education» more  CORR 2010»
13 years 4 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...
ECCV
2010
Springer
13 years 9 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
ICA
2007
Springer
13 years 11 months ago
Dictionary Learning for L1-Exact Sparse Coding
We have derived a new algorithm for dictionary learning for sparse coding in the ℓ1 exact sparse framework. The algorithm does not rely on an approximation residual to operate, b...
Mark D. Plumbley
ICML
2009
IEEE
14 years 5 months ago
Online dictionary learning for sparse coding
Sparse coding--that is, modelling data vectors as sparse linear combinations of basis elements--is widely used in machine learning, neuroscience, signal processing, and statistics...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...