Chao Qian
Title
Cited by
Cited by
Year
Subset selection by Pareto optimization
C Qian, Y Yu, ZH Zhou
Advances in Neural Information Processing Systems 28, 1774-1782, 2015
922015
Pareto ensemble pruning
C Qian, Y Yu, ZH Zhou
Proceedings of the AAAI Conference on Artificial Intelligence 29 (1), 2015
802015
An analysis on recombination in multi-objective evolutionary optimization
C Qian, Y Yu, ZH Zhou
Artificial Intelligence 204, 99-119, 2013
752013
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
46*2018
Analyzing evolutionary optimization in noisy environments
C Qian, Y Yu, ZH Zhou
Evolutionary computation 26 (1), 1-41, 2018
362018
Subset Selection under Noise.
C Qian, JC Shi, Y Yu, K Tang, ZH Zhou
NIPS, 3560-3570, 2017
322017
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
322014
Selection hyper-heuristics can provably be helpful in evolutionary multi-objective optimization
C Qian, K Tang, ZH Zhou
International Conference on Parallel Problem Solving from Nature, 835-846, 2016
312016
On Subset Selection with General Cost Constraints.
C Qian, JC Shi, Y Yu, K Tang
IJCAI 17, 2613-2619, 2017
302017
Parallel Pareto Optimization for Subset Selection.
C Qian, JC Shi, Y Yu, K Tang, ZH Zhou
IJCAI, 1939-1945, 2016
302016
On constrained boolean pareto optimization
C Qian, Y Yu, ZH Zhou
Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
252015
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
242017
Optimization based Layer-wise Magnitude-based Pruning for DNN Compression.
G Li, C Qian, C Jiang, X Lu, K Tang
IJCAI, 2383-2389, 2018
212018
Evolutionary learning: Advances in theories and algorithms
ZH Zhou, Y Yu, C Qian
Springer, 2019
20*2019
Running Time Analysis of the ( 1 + 1 )-EA for OneMax and LeadingOnes Under Bit-Wise Noise
C Qian, C Bian, W Jiang, K Tang
Algorithmica 81 (2), 749-795, 2019
202019
Variable solution structure can be helpful in evolutionary optimization
C Qian, Y Yu, ZH Zhou
Science China Information Sciences 58 (11), 1-17, 2015
172015
Efficient DNN Neuron Pruning by Minimizing Layer-wise Nonlinear Reconstruction Error.
C Jiang, G Li, C Qian, K Tang
IJCAI 2018, 2-2, 2018
162018
Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection.
C Qian, Y Yu, K Tang
IJCAI, 1478-1484, 2018
142018
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
12*2019
On multiset selection with size constraints
C Qian, Y Zhang, K Tang, X Yao
Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018
112018
The system can't perform the operation now. Try again later.
Articles 1–20