3049 search results - page 386 / 610 » On the Convergence of Bound Optimization Algorithms |
188
click to vote
SIAMSC
2010
15 years 5 months ago
2010
Abstract. We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate G...
187
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
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...
162
click to vote
ICML
2000
IEEE
16 years 7 months ago
2000
IEEE
This paper discusses theoretical and experimental aspects of gradient-based approaches to the direct optimization of policy performance in controlled ??? ?s. We introduce ??? ?, a...
161
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper addresses source separation from a linear mixture under two assumptions: source sparsity and orthogonality of the mixing matrix. We propose efficient sparse separation...
194
click to vote
STACS
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...