no code implementations • 7 Jun 2012 • Anastasios Kyrillidis, Stephen Becker, Volkan Cevher and, Christoph Koch
Most learning methods with rank or sparsity constraints use convex relaxations, which lead to optimization with the nuclear norm or the $\ell_1$-norm.