Sciweavers

2295 search results - page 17 / 459
» Learning Overcomplete Representations
Sort
View
COLT
1995
Springer
14 years 4 days ago
Learning Internal Representations
Jonathan Baxter
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
13 years 3 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy
ICTAI
2003
IEEE
14 years 1 months ago
Q-Concept-Learning: Generalization with Concept Lattice Representation in Reinforcement Learning
One of the very interesting properties of Reinforcement Learning algorithms is that they allow learning without prior knowledge of the environment. However, when the agents use al...
Marc Ricordeau
ICIP
2009
IEEE
14 years 9 months ago
Sparsity And Morphological Diversity For Hyperspectral Data Analysis
Recently morphological diversity and sparsity have emerged as new and effective sources of diversity for Blind Source Separation. Based on these new concepts, novel methods such a...