Sparse projections onto the simplex.

Anastasios Kyrillidis, Stephen Becker, Volkan Cevher, Christoph Koch

Abstract: Most learning methods with rank or sparsity constraints use convex relaxations, which lead to optimization with the nuclear norm or the \ell_1-norm. However, several important learning applications...