Group variable selection via ℓp,0 regularization and application to optimal scoring

Argyriou, 2008, Convex multi-task feature learning, Machine Learing, 73, 243, 10.1007/s10994-007-5040-8 Bi, 2008, An improved multi-task learning approach with applications in medical diagnosis, 117 Blodel, 2013, Block coordinate descent algorithms for large-scale sparse multiclass classification, Machine Learning, 93, 31, 10.1007/s10994-013-5367-2 Boyd, 2011, Distributed optimization and statistical learning via the alternating direction method of multipliers, Foundations and Trends in Machine Learning, 3, 1, 10.1561/2200000016 Bradley, P. S., & Mangasarian, O. L. (1998). Feature selection via concave minimization and support vector machines. In Proceeding of international conference on machine learning. Calandriello, 2014, Sparse multi-task reinforcement learning Chen, 2006, Theoretical results on sparse representations of multiple-measurement vectors, IEEE Transactions on Signal Processing, 54, 4634, 10.1109/TSP.2006.881263 Clemmensen, 2007, A method for comparison of growth media in objective identification of penicillium based on multi-spectral imaging, Journal of Microbiological Methods, 69, 249, 10.1016/j.mimet.2006.12.020 Clemmensen, 2011, Sparse discriminant analysis, Technometrics, 53, 406, 10.1198/TECH.2011.08118 Cotter, 2005, Sparse solutions to linear inverse problems with multiple measurement vectors, IEEE Transactions on Signal Processing, 53, 2477, 10.1109/TSP.2005.849172 Danaher, 2014, The joint graphical lasso for inverse covariance estimation across multiple classes, Journal of the Royal Statistical Society. Series B. Statistical Methodology, 76, 373, 10.1111/rssb.12033 Eksioglu, 2014, Group sparse RLS algorithms, International Journal of Adaptive Control and Signal Processing, 28, 1398, 10.1002/acs.2449 Fan, 2001, Variable selection via nonconcave penalized likelihood and its oracle properties, Journal of the American Statistical Association, 96, 1348, 10.1198/016214501753382273 Fisher, 1936, The use of multiple measurements in taxonomic problems, Annal of Eugenics, 7, 179, 10.1111/j.1469-1809.1936.tb02137.x Friedman, 2007, Pathwise coordinate optimization, The Anals of Applied Statistics, 1, 302 Golub, 1999, Molecular classification of cancer: class discovery and class prediction by gene expression monitoring, Science, 286, 531, 10.1126/science.286.5439.531 Gu, 2011, Linear discriminant dimensionality reduction, 549 Hastie, 1995, Penalized discriminant analysis, The Annals of Statistics, 23, 73, 10.1214/aos/1176324456 Hastie, 1994, Flexible discriminant analysis by optimal scoring, Journal of the American Statistical Association, 89, 1255, 10.1080/01621459.1994.10476866 Hu, 2017, Group sparse optimization via lp,q regularization, Journal of Machine Learning Research, 18, 960 Huang, 2012, Semiparametric regression pursuit, Statistica Sinica, 22, 1403 Kha, 2015, Joint group sparse PCA for compressed hyperspectral imaging, IEEE Transactions on Image Processing, 24, 4934, 10.1109/TIP.2015.2472280 Khan, 2001, Classification and diagnostic prediction of cancers using expression profiling and artificial neural networks, Nature Medicine, 7, 673, 10.1038/89044 Lan, 2015, Joint sparse representation robust feature-level fusion for multi-cue visual tracking, IEEE Transactions on Image Processing, 24, 5826, 10.1109/TIP.2015.2481325 Le Thi, 2005 Le Thi, 2008, A DC programming approach for feature selection in support vector machines learning, Journal of Advances in Data Analysis and Classification, 2, 259, 10.1007/s11634-008-0030-7 Le Thi, 2014, Feature selection in machine learning: An exact penalty approachusing a difference of convex function algorithm, Machine Learning Le Thi, 2005, The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, Annals of Operations Research, 133, 23, 10.1007/s10479-004-5022-1 Le Thi, 2018, DC programming and DCA: thirty years of developments, Mathematical Programming, 169, 5, 10.1007/s10107-018-1235-y Le Thi, 2015, DC approximation approaches for sparse optimization, European Journal of Operational Research, 244, 26, 10.1016/j.ejor.2014.11.031 Le Thi, 2016, DC programming and DCA for sparse optimal scoring problem, Neurocomputing, 186, 170, 10.1016/j.neucom.2015.12.068 Le Thi, 2017, DC programming and DCA for sparse Fisher linear discriminant analysis, Neural Computing and Applications, 28, 2809, 10.1007/s00521-016-2216-9 Le Thi, 2014, Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms, Neural Networks, 59, 36, 10.1016/j.neunet.2014.06.011 Lee, 2016, Sparse optimization for nonconvex group penalized estimation, Journal of Statistical Computation and Simulation, 86, 597, 10.1080/00949655.2015.1026822 Leng, 2008, Sparse optimal scoring for multiclass cancer diagnosis and biomarker detection using microarray data, Computational Biology and Chemistry, 32, 417, 10.1016/j.compbiolchem.2008.07.015 Liu, 2009, Multi-task feature learning via efficient ℓ2,1-norm minimization Merchante, 2012, An efficient approach to sparse linear discriminant analysis Nie, 2010, Efficient and robust feature selection via joint ℓ2,1-norms minimization Obozinski, 2006, Multi-task feature selection Obozinski, 2010, Joint covariate selection and joint subspace selection for multiple classification problems, Statistics and Computing, 20, 231, 10.1007/s11222-008-9111-x Ong, 2013, Learning sparse classifiers with difference of convex functions algorithms, Optimization Methods & Software, 28, 830, 10.1080/10556788.2011.652630 Ong, 2013, Learning sparse classifers with difference of convex cunctions algorithms, Optimization Methods & Software, 28, 830, 10.1080/10556788.2011.652630 Peleg, 2008, A bilinear formulation for vector sparsity optimization, Signal Processing, 88, 375, 10.1016/j.sigpro.2007.08.015 Pham Dinh, 1997, Convex analysis approach to D.C. programming: Theory, algorithms and applications, Acta Mathematica Vietnamica, 22, 289 Pham Dinh, 1998, A DC optimization algorithm for solving the trust-region subproblem, SIAM Journal of Optimization, 8, 476, 10.1137/S1052623494274313 Pham Dinh, 2014, Recent advances in DC programming and DCA, Transactions on Computational Collective Intelligence, 8342, 1 Quattoni, 2009, An efficient projection for ℓ∞,1-regularization Sun, 2009, Efficient recovery of jointly sparse vectors Turlach, 2005, Simultaneous variable selection, Technometrics, 47, 349, 10.1198/004017005000000139 Wang, 2007, Group SCAD regression analysis for microarray time course gene expression data, Bioinformatics, 23, 1486, 10.1093/bioinformatics/btm125 Wei, 2010, Consistent group selection in high-dimensional linear regression, Bernoulli, 16, 1369, 10.3150/10-BEJ252 Wei, 2012, Group coordinate descent algorithms for nonconvex penalized regression, Computational Statistics & Data Analysis, 56, 316, 10.1016/j.csda.2011.08.007 Yeoh, 2002, Classification, subtype discovery, and prediction of outcome in pediatric lymphoblastic leukemia by gene expression profiling, Cancer Cell, 1, 133, 10.1016/S1535-6108(02)00032-6 Yuan, 2006, Model selection and estimation in regression with grouped variables, Journal of the Royal Statistical Society. Series B. Statistical Methodology, 68, 49, 10.1111/j.1467-9868.2005.00532.x Zhang, 2010, Nearly unbiased variable selection under minimax concave penalty, The Annals of Statistics, 38, 894, 10.1214/09-AOS729 Zhang, 2008, Variable selection for the multicategory SVM via adaptive sup-norm regularization, Electronic Journal of Statistics, 2, 149, 10.1214/08-EJS122 Zhang, 2010, Probabilistic multi-task feature selection Zou, 2006, Sparse principal component analysis, Journal of Computational and Graphical statistics, 15, 265, 10.1198/106186006X113430