tokens: Problem encompasses several DL - based formulations of practical interest , corresponding to different choices of the fidelity functions , regularizers , and feasible sets ; examples include the elastic net sparse DL , sparse PCA , non - negative matrix factorization and low - rank approximation , supervised DL , sparse singular value decomposition , non - negative sparse coding , principal component pursuit , robust non - negative sparse matrix factorization , and discriminative label consistent learning .