Sciweavers

178 search results - page 1 / 36
» A Simple Algorithm for Nuclear Norm Regularized Problems
Sort
View
ICML
2010
IEEE
13 years 5 months ago
A Simple Algorithm for Nuclear Norm Regularized Problems
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
Martin Jaggi, Marek Sulovský
JMLR
2010
147views more  JMLR 2010»
12 years 11 months ago
Spectral Regularization Algorithms for Learning Large Incomplete Matrices
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
Rahul Mazumder, Trevor Hastie, Robert Tibshirani
CDC
2010
IEEE
166views Control Systems» more  CDC 2010»
12 years 8 months ago
Nuclear norm regularization for overparametrized Hammerstein systems
—In this paper we study the overparametrization scheme for Hammerstein systems [1] in the presence of regularization. The quality of the convex approximation is analysed, that is...
Tillmann Falck, Johan A. K. Suykens, Johan Schouke...
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
13 years 4 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
SIAMREV
2010
174views more  SIAMREV 2010»
12 years 11 months ago
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo