495 search results - page 15 / 99 » Sparse representation algorithms based on mean-field approxi... |
ICAI
2009
14 years 7 months ago
2009
- We address the issues of improving the feature generation methods for the value-function approximation and the state space approximation. We focus the improvement of feature gene...
JMLR
2006
2006
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
14 years 10 months ago
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we examine the problem of overcomplete representations and provide new insights into the problem of stable recovery of sparse solutions in noisy environments. We es...
UAI
2001
14 years 11 months ago
2001
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
ICIP
2007
IEEE
15 years 11 months ago
2007
IEEE
Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NPhard problem. In the case of a dictionary whose elements form ...