Sparse projections onto the simplex

Anastasios Kyrillidis, Stephen Becker, Volkan Cevher and +1

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 le…