| Subset selection by Pareto optimization C Qian, Y Yu, ZH Zhou Advances in neural information processing systems 28, 2015 | 155 | 2015 |
| Pareto ensemble pruning C Qian, Y Yu, ZH Zhou Proceedings of the AAAI Conference on Artificial Intelligence 29 (1), 2015 | 112 | 2015 |
| An analysis on recombination in multi-objective evolutionary optimization C Qian, Y Yu, ZH Zhou Proceedings of the 13th annual conference on Genetic and evolutionary …, 2011 | 96 | 2011 |
| Evolutionary learning: Advances in theories and algorithms ZH Zhou, Y Yu, C Qian Springer Singapore, 2019 | 81 | 2019 |
| Subset selection under noise C Qian, JC Shi, Y Yu, K Tang, ZH Zhou Advances in neural information processing systems 30, 2017 | 60 | 2017 |
| On Subset Selection with General Cost Constraints. C Qian, JC Shi, Y Yu, K Tang IJCAI 17, 2613-2619, 2017 | 58 | 2017 |
| Optimization based layer-wise magnitude-based pruning for DNN compression. G Li, C Qian, C Jiang, X Lu, K Tang IJCAI, 2383-2389, 2018 | 53 | 2018 |
| Analyzing evolutionary optimization in noisy environments C Qian, Y Yu, ZH Zhou Evolutionary computation 26 (1), 1-41, 2018 | 52 | 2018 |
| Parallel Pareto Optimization for Subset Selection. C Qian, JC Shi, Y Yu, K Tang, ZH Zhou IJCAI, 1939-1945, 2016 | 48 | 2016 |
| Selection hyper-heuristics can provably be helpful in evolutionary multi-objective optimization C Qian, K Tang, ZH Zhou Parallel Problem Solving from Nature–PPSN XIV: 14th International Conference …, 2016 | 44 | 2016 |
| On the effectiveness of sampling for evolutionary optimization in noisy environments C Qian, Y Yu, K Tang, Y Jin, X Yao, ZH Zhou Evolutionary computation 26 (2), 237-267, 2018 | 43 | 2018 |
| Constrained Monotone-Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee C Qian, JC Shi, K Tang, ZH Zhou IEEE Transactions on Evolutionary Computation 22 (4), 595-608, 2017 | 43 | 2017 |
| Efficient DNN Neuron Pruning by Minimizing Layer-wise Nonlinear Reconstruction Error. C Jiang, G Li, C Qian, K Tang IJCAI 2018, 2-2, 2018 | 39 | 2018 |
| Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms C Qian, Y Yu, K Tang, X Yao, ZH Zhou Artificial Intelligence 275, 279-294, 2019 | 38* | 2019 |
| Switch analysis for running time analysis of evolutionary algorithms Y Yu, C Qian, ZH Zhou IEEE Transactions on Evolutionary Computation 19 (6), 777-792, 2014 | 37 | 2014 |
| On constrained boolean pareto optimization C Qian, Y Yu, ZH Zhou Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015 | 36 | 2015 |
| Running time analysis of the (1+ 1)-EA for OneMax and LeadingOnes under bit-wise noise C Qian, C Bian, W Jiang, K Tang Proceedings of the Genetic and Evolutionary Computation Conference, 1399-1406, 2017 | 29 | 2017 |
| Distributed Pareto optimization for large-scale noisy subset selection C Qian IEEE Transactions on Evolutionary Computation 24 (4), 694-707, 2019 | 28 | 2019 |
| Unsupervised feature selection by Pareto optimization C Feng, C Qian, K Tang Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 3534-3541, 2019 | 24 | 2019 |
| Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection. C Qian, Y Yu, K Tang IJCAI, 1478-1484, 2018 | 24 | 2018 |
