Subset selection by Pareto optimization

Advances in Neural Information Processing Systems

Volumn 2015-January, Issue , 2015, Pages 1774-1782

  Qian, Chao ^a   Yu, Yang ^a   Zhou, Zhi Hua ^a  

^a NANJING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SCIENCE; RELAXATION PROCESSES;

APPROXIMATION PERFORMANCE; CONVEX RELAXATION; DICTIONARY LEARNING; EMPIRICAL STUDIES; EXPONENTIAL DECAYS; OPTIMAL SOLUTIONS; PARETO OPTIMIZATION; SPARSE REGRESSION;

PARETO PRINCIPLE;

EID: 84965150147     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. C. Boutsidis, M. W. Mahoney, and P. Drineas. An improved approximation algorithm for the column subset selection problem. In SODA, pages 968-977, New York, NY, 2009.
2. A. Das and D. Kempe. Algorithms for subset selection in linear regression. In STOC, pages 45-54, Victoria, Canada, 2008.
3. A. Das and D. Kempe. Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. In ICML, pages 1057-1064, Bellevue, WA, 2011.
4. G. Davis, S. Mallat, and M. Avellaneda. Adaptive greedy approximations. Constructive Approximation, 13(1):57-98, 1997.
5. J. Demšar. Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7:1-30, 2006.
6. G. Diekhoff. Statistics for the Social and Behavioral Sciences: Univariate, Bivariate, Multivariate. William C Brown Pub, 1992.
7. D. L. Donoho, M. Elad, and V. N. Temlyakov. Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Transactions on Information Theory, 52(1):6-18, 2006.
8. J. Fan and R. Li. Variable selection via nonconcave penalized likelihood and its oracle properties. Journal of the American Statistical Association, 96(456):1348-1360, 2001.
9. A. C. Gilbert, S. Muthukrishnan, and M. J. Strauss. Approximation of functions over redundant dictionaries using coherence. In SODA, pages 243-252, Baltimore, MD, 2003.
10. I. Guyon, J. Weston, S. Barnhill, and V. Vapnik. Gene selection for cancer classification using support vector machines. Machine Learning, 46(1-3):389-422, 2002.
11. R. A. Johnson and D. W. Wichern. Applied Multivariate Statistical Analysis. Pearson, 6th edition, 2007.
12. A. Miller. Subset Selection in Regression. Chapman and Hall/CRC, 2nd edition, 2002.
13. B. K. Natarajan. Sparse approximate solutions to linear systems. SIAM Journal on Computing, 24(2):227-234, 1995.
14. C. Qian, Y. Yu, and Z.-H. Zhou. An analysis on recombination in multi-objective evolutionary optimization. Artificial Intelligence, 204:99-119, 2013.
15. C. Qian, Y. Yu, and Z.-H. Zhou. On constrained Boolean Pareto optimization. In IJCAI, pages 389-395, Buenos Aires, Argentina, 2015.
16. C. Qian, Y. Yu, and Z.-H. Zhou. Pareto ensemble pruning. In AAAI, pages 2935-2941, Austin, TX, 2015.
17. M. Tan, I. Tsang, and L. Wang. Matching pursuit LASSO Part I: Sparse recovery over big dictionary. IEEE Transactions on Signal Processing, 63(3):727-741, 2015.
18. R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society: Series B (Methodological), 58(1):267-288, 1996.
19. J. A. Tropp. Greed is good: Algorithmic results for sparse approximation. IEEE Transactions on Information Theory, 50(10):2231-2242, 2004.
20. J. A. Tropp, A. C. Gilbert, S. Muthukrishnan, and M. J. Strauss. Improved sparse approximation over quasiincoherent dictionaries. In ICIP, pages 37-40, Barcelona, Spain, 2003.
21. L. Xiao and T. Zhang. A proximal-gradient homotopy method for the sparse least-squares problem. SIAM Journal on Optimization, 23(2):1062-1091, 2013.
22. Y. Yu, X. Yao, and Z.-H. Zhou. On the approximation ability of evolutionary optimization with application to minimum set cover. Artificial Intelligence, 180-181:20-33, 2012.
23. Y. Yu and Z.-H. Zhou. On the usefulness of infeasible solutions in evolutionary search: A theoretical study. In IEEE CEC, pages 835-840, Hong Kong, China, 2008.
24. C.-H. Zhang. Nearly unbiased variable selection under minimax concave penalty. The Annals of Statistics, 38(2):894-942, 2010.
25. T. Zhang. On the consistency of feature selection using greedy least squares regression. Journal of Machine Learning Research, 10:555-568, 2009.
26. T. Zhang. Adaptive forward-backward greedy algorithm for learning sparse representations. IEEE Transactions on Information Theory, 57(7):4689-4708, 2011.
27. H. Zhou. Matlab SparseReg Toolbox Version 0.0.1. Available Online, 2013.
28. H. Zhou, A. Armagan, and D. Dunson. Path following and empirical Bayes model selection for sparse regression. arXiv:1201.3528, 2012.
29. H. Zou and T. Hastie. Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 67(2):301-320, 2005.