25 search results - page 4 / 5 » Convex and Semi-Nonnegative Matrix Factorizations |
COLT
2007
Springer
13 years 11 months ago
2007
Springer
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
EMMCVPR
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse ...
CIKM
2010
Springer
13 years 3 months ago
2010
Springer
Matrix factorization methods are among the most common techniques for detecting latent components in data. Popular examples include the Singular Value Decomposition or Nonnegative...
SIAMMAX
2011
12 years 8 months ago
2011
A sufficient condition for the convexity of a finite product of positive definite quadratic forms is given in terms of the condition numbers of the underlying matrices. When only...
CORR
2011
Springer
13 years 10 days ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...