Towards Analyzing Recombination Operators in Evolutionary Search. - Yang Yu 001; Chao Qian 001; Zhi-Hua Zhou (PPSN (1), 2010)

Collisions are helpful for computing unique input-output sequences. - Chao Qian 001; Yang Yu 001; Zhi-Hua Zhou (GECCO (Companion), 2011)

Towards Analyzing Crossover Operators in Evolutionary Search via General Markov Chain Switching Theorem - Yang Yu 001; Chao Qian 001; Zhi-Hua Zhou (CoRR, 2011)

On Algorithm-Dependent Boundary Case Identification for Problem Classes. - Chao Qian 001; Yang Yu 001; Zhi-Hua Zhou (PPSN (1), 2012)

An analysis on recombination in multi-objective evolutionary optimization. - Chao Qian 001; Yang Yu 001; Zhi-Hua Zhou (Artif. Intell., 2013)

On the Effectiveness of Sampling for Evolutionary Optimization in Noisy Environments. - Chao Qian 001; Yang Yu 001; Yaochu Jin; Zhi-Hua Zhou (PPSN, 2014)

Pareto Ensemble Pruning. - Chao Qian 001; Yang Yu 001; Zhi-Hua Zhou (AAAI, 2015)

Running time analysis: Convergence-based analysis reduces to switch analysis. - Yang Yu 001; Chao Qian 001 (CEC, 2015)

On Constrained Boolean Pareto Optimization. - Chao Qian 001; Yang Yu 001; Zhi-Hua Zhou (IJCAI, 2015)

Subset Selection by Pareto Optimization. - Chao Qian 001; Yang Yu 001; Zhi-Hua Zhou (NIPS, 2015)

Variable solution structure can be helpful in evolutionary optimization. - Chao Qian 001; Yang Yu 001; Zhi-Hua Zhou (Sci. China Inf. Sci., 2015)

Switch Analysis for Running Time Analysis of Evolutionary Algorithms. - Yang Yu 001; Chao Qian 001; Zhi-Hua Zhou (IEEE Trans. Evol. Comput., 2015)

Search based recommender system using many-objective evolutionary algorithm. - Bingdong Li; Chao Qian 001; Jinlong Li 001; Ke Tang 001; Xin Yao 001 (CEC, 2016)

A Lower Bound Analysis of Population-Based Evolutionary Algorithms for Pseudo-Boolean Functions. - Chao Qian 001; Yang Yu 001; Zhi-Hua Zhou (IDEAL, 2016)

Parallel Pareto Optimization for Subset Selection. - Chao Qian 001; Jing-Cheng Shi; Yang Yu 001; Ke Tang 001; Zhi-Hua Zhou (IJCAI, 2016)

Selection Hyper-heuristics Can Provably Be Helpful in Evolutionary Multi-objective Optimization. - Chao Qian 001; Ke Tang 001; Zhi-Hua Zhou (PPSN, 2016)

Evolutionary multi-objective optimization made faster by sequential decomposition. - Jing-Cheng Shi; Chao Qian 001; Yang Yu 001 (CEC, 2017)

Running time analysis of the (1+1)-EA for onemax and leadingones under bit-wise noise. - Chao Qian 001; Chao Bian 002; Wu Jiang; Ke Tang 001 (GECCO, 2017)

On Subset Selection with General Cost Constraints. - Chao Qian 001; Jing-Cheng Shi; Yang Yu 001; Ke Tang 001 (IJCAI, 2017)

Optimizing Ratio of Monotone Set Functions. - Chao Qian 001; Jing-Cheng Shi; Yang Yu 001; Ke Tang 001; Zhi-Hua Zhou (IJCAI, 2017)

Subset Selection under Noise. - Chao Qian 001; Jing-Cheng Shi; Yang Yu 001; Ke Tang 001; Zhi-Hua Zhou (NIPS, 2017)

Dynamic and Adaptive Threshold for DNN Compression from Scratch. - Chunhui Jiang; Guiying Li; Chao Qian 001 (SEAL, 2017)

Maximizing Non-monotone/Non-submodular Functions by Multi-objective Evolutionary Algorithms. - Chao Qian 001; Yang Yu 001; Ke Tang 001; Xin Yao 001; Zhi-Hua Zhou (CoRR, 2017)

On Multiset Selection With Size Constraints. - Chao Qian 001; Yibo Zhang; Ke Tang 001; Xin Yao 001 (AAAI, 2018)

Improved Running Time Analysis of the (1+1)-ES on the Sphere Function. - Wu Jiang; Chao Qian 001; Ke Tang 001 (ICIC (1), 2018)

Dynamic Mutation Based Pareto Optimization for Subset Selection. - Mengxi Wu; Chao Qian 001; Ke Tang 001 (ICIC (3), 2018)

A General Approach to Running Time Analysis of Multi-objective Evolutionary Algorithms. - Chao Bian 002; Chao Qian 001; Ke Tang 001 (IJCAI, 2018)

Efficient DNN Neuron Pruning by Minimizing Layer-wise Nonlinear Reconstruction Error. - Chunhui Jiang; Guiying Li; Chao Qian 001; Ke Tang 001 (IJCAI, 2018)

Optimization based Layer-wise Magnitude-based Pruning for DNN Compression. - Guiying Li; Chao Qian 001; Chunhui Jiang; Xiaofen Lu; Ke Tang 001 (IJCAI, 2018)

Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection. - Chao Qian 001; Yang Yu 001; Ke Tang 001 (IJCAI, 2018)

Sequence Selection by Pareto Optimization. - Chao Qian 001; Chao Feng 006; Ke Tang 001 (IJCAI, 2018)

Distributed Pareto Optimization for Subset Selection. - Chao Qian 001; Guiying Li; Chao Feng 006; Ke Tang 001 (IJCAI, 2018)

Towards a Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes Under General Bit-Wise Noise. - Chao Bian 002; Chao Qian 001; Ke Tang 001 (PPSN (2), 2018)

ZOOpt/ZOOjl: Toolbox for Derivative-Free Optimization. - Yu-Ren Liu; Yi-Qi Hu; Hong Qian; Yang Yu 001; Chao Qian 001 (CoRR, 2018)

Maximizing Monotone DR-submodular Continuous Functions by Derivative-free Optimization. - Yibo Zhang; Chao Qian 001; Ke Tang 001 (CoRR, 2018)

On the Effectiveness of Sampling for Evolutionary Optimization in Noisy Environments. - Chao Qian 001; Yang Yu 001; Ke Tang 001; Yaochu Jin; Xin Yao 001; Zhi-Hua Zhou (Evol. Comput., 2018)

Analyzing Evolutionary Optimization in Noisy Environments. - Chao Qian 001; Yang Yu 001; Zhi-Hua Zhou (Evol. Comput., 2018)

Constrained Monotone k-Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee. - Chao Qian 001; Jing-Cheng Shi; Ke Tang 001; Zhi-Hua Zhou (IEEE Trans. Evol. Comput., 2018)

Evolutionary Learning: Advances in Theories and Algorithms - Zhi-Hua Zhou; Yang Yu 001; Chao Qian 001 (Springer, 2019)

Unsupervised Feature Selection by Pareto Optimization. - Chao Feng 006; Chao Qian 001; Ke Tang 001 (AAAI, 2019)

Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms. - Chao Qian 001; Yang Yu 001; Ke Tang 001; Xin Yao 001; Zhi-Hua Zhou (Artif. Intell., 2019)

Running Time Analysis of the ( $$1+1$$ 1 + 1 )-EA for OneMax and LeadingOnes Under Bit-Wise Noise. - Chao Qian 001; Chao Bian 002; Wu Jiang; Ke Tang 001 (Algorithmica, 2019)

Running Time Analysis of the (1+1)-EA for Robust Linear Optimization. - Chao Bian 002; Chao Qian 001; Ke Tang 001 (CoRR, 2019)

On the Robustness of Median Sampling in Noisy Evolutionary Optimization. - Chao Bian 002; Chao Qian 001; Yang Yu 001 (CoRR, 2019)

Bayesian Optimization using Pseudo-Points. - Chao Qian 001; Hang Xiong (CoRR, 2019)

Multi-objective Evolutionary Algorithms are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions. - Chao Qian 001 (CoRR, 2019)

Subset Selection by Pareto Optimization with Recombination. - Chao Qian 001; Chao Bian 002; Chao Feng 006 (AAAI, 2020)

An Efficient Evolutionary Algorithm for Subset Selection with General Cost Constraints. - Chao Bian 002; Chao Feng 006; Chao Qian 001; Yang Yu 001 (AAAI, 2020)

Bayesian Optimization using Pseudo-Points. - Chao Qian 001; Hang Xiong; Ke Xue 001 (IJCAI, 2020)

Self-Guided Evolution Strategies with Historical Estimated Gradients. - Fei-Yu Liu; Zi-Niu Li; Chao Qian 001 (IJCAI, 2020)

Running time analysis of the (1+1)-EA for robust linear optimization. - Chao Bian 002; Chao Qian 001; Ke Tang 001; Yang Yu 001 (Theor. Comput. Sci., 2020)

Distributed Pareto Optimization for Large-Scale Noisy Subset Selection. - Chao Qian 001 (IEEE Trans. Evol. Comput., 2020)

Multi-Objective Submodular Maximization by Regret Ratio Minimization with Theoretical Guarantee. - Chao Feng 006; Chao Qian 001 (AAAI, 2021)

Prediction Guided Meta-Learning for Multi-Objective Reinforcement Learning. - Fei-Yu Liu; Chao Qian 001 (CEC, 2021)

Evolutionary submodular optimisation. - Aneta Neumann; Frank Neumann 001; Chao Qian 001 (GECCO Companion, 2021)

Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints. - Chao Bian 002; Chao Qian 001; Frank Neumann 001; Yang Yu 001 (IJCAI, 2021)

Evolutionary Gradient Descent for Non-convex Optimization. - Ke Xue 001; Chao Qian 001; Ling Xu; Xudong Fei (IJCAI, 2021)

Analysis of Noisy Evolutionary Optimization When Sampling Fails. - Chao Qian 001; Chao Bian 002; Yang Yu 001; Ke Tang 001; Xin Yao 001 (Algorithmica, 2021)

On the robustness of median sampling in noisy evolutionary optimization. - Chao Bian 002; Chao Qian 001; Yang Yu 001; Ke Tang 001 (Sci. China Inf. Sci., 2021)

HydraText: Multi-objective Optimization for Adversarial Textual Attack. - Shengcai Liu; Ning Lu 006; Cheng Chen; Chao Qian 001; Ke Tang 001 (CoRR, 2021)

Multiobjective Evolutionary Algorithms Are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions. - Chao Qian 001 (Evol. Comput., 2021)

Efficient Minimum Cost Seed Selection With Theoretical Guarantees for Competitive Influence Maximization. - Wenjing Hong; Chao Qian 001; Ke Tang 001 (IEEE Trans. Cybern., 2021)

Evolutionary submodular optimisation: tutorial. - Aneta Neumann; Frank Neumann 001; Chao Qian 001 (GECCO Companion, 2022)

Evolutionary Diversity Optimization with Clustering-based Selection for Reinforcement Learning. - Yutong Wang; Ke Xue 001; Chao Qian 001 (ICLR, 2022)

Robust Subset Selection by Greedy and Evolutionary Pareto Optimization. - Chao Bian 002; Yawen Zhou; Chao Qian 001 (IJCAI, 2022)

Towards Theoretically Grounded Evolutionary Learning. - Chao Qian 001 (IJCAI, 2022)

Neural Network Pruning by Cooperative Coevolution. - Haopu Shang; Jia-Liang Wu; Wenjing Hong; Chao Qian 001 (IJCAI, 2022)

Multi-agent Dynamic Algorithm Configuration. - Ke Xue 001; Jiacheng Xu 003; Lei Yuan 005; Miqing Li; Chao Qian 001; Zongzhang Zhang; Yang Yu 001 (NeurIPS, 2022)

Monte Carlo Tree Search based Variable Selection for High Dimensional Bayesian Optimization. - Lei Song; Ke Xue 001; Xiaobin Huang; Chao Qian 001 (NeurIPS, 2022)

Better Running Time of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) by Using Stochastic Tournament Selection. - Chao Bian 002; Chao Qian 001 (PPSN (2), 2022)

Multi-objective Evolutionary Ensemble Pruning Guided by Margin Distribution. - Yu-Chang Wu; Yi-Xiao He; Chao Qian 001; Zhi-Hua Zhou (PPSN (1), 2022)

Robust Neural Network Pruning by Cooperative Coevolution. - Jia-Liang Wu; Haopu Shang; Wenjing Hong; Chao Qian 001 (PPSN (1), 2022)

Running Time Analysis of the (1+1)-EA Using Surrogate Models on OneMax and LeadingOnes. - Zi-An Zhang; Chao Bian 002; Chao Qian 001 (PPSN (2), 2022)

Multi-objective Evolutionary Instance Selection for Multi-label Classification. - Dingming Liu; Haopu Shang; Wenjing Hong; Chao Qian 001 (PRICAI (1), 2022)

Result diversification by multi-objective evolutionary algorithms with theoretical guarantees. - Chao Qian 001; Dan-Xuan Liu; Zhi-Hua Zhou (Artif. Intell., 2022)

ZOOpt: a toolbox for derivative-free optimization. - Yu-Ren Liu; Yi-Qi Hu; Hong Qian; Chao Qian 001; Yang Yu 001 (Sci. China Inf. Sci., 2022)

Running Time Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) using Binary or Stochastic Tournament Selection. - Chao Bian 002; Chao Qian 001 (CoRR, 2022)

Heterogeneous Multi-agent Zero-Shot Coordination by Coevolution. - Ke Xue 001; Yutong Wang; Lei Yuan 005; Cong Guan; Chao Qian 001; Yang Yu 001 (CoRR, 2022)

Analysis of Expected Hitting Time for Designing Evolutionary Neural Architecture Search Algorithms. - Zeqiong Lv; Chao Qian 001; Gary G. Yen; Yanan Sun 001 (CoRR, 2022)

Submodular Maximization under the Intersection of Matroid and Knapsack Constraints. - Yu-Ran Gu; Chao Bian 002; Chao Qian 001 (AAAI, 2023)

Human Assisted Learning by Evolutionary Multi-Objective Optimization. - Dan-Xuan Liu; Xin Mu; Chao Qian 001 (AAAI, 2023)

Robust Multi-Agent Coordination via Evolutionary Generation of Auxiliary Adversarial Attackers. - Lei Yuan 005; Ziqian Zhang; Ke Xue 001; Hao Yin; Feng Chen 042; Cong Guan; Lihe Li; Chao Qian 001; Yang Yu 001 (AAAI, 2023)

Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler. - Frank Neumann 001; Aneta Neumann; Chao Qian 001; Anh Viet Do; Jacob de Nobel; Diederick Vermetten; Saba Sadeghi Ahouei; Furong Ye; Hao Wang 025; Thomas Bäck (CEC, 2023)

Quality-Similar Diversity via Population Based Reinforcement Learning. - Shuang Wu; Jian Yao 008; Haobo Fu; Ye Tian; Chao Qian 001; Yaodong Yang 001; Qiang Fu 016; Wei Yang 032 (ICLR, 2023)

Multi-objective Optimization-based Selection for Quality-Diversity by Non-surrounded-dominated Sorting. - Ren-Jian Wang; Ke Xue 001; Haopu Shang; Chao Qian 001; Haobo Fu; Qiang Fu 016 (IJCAI, 2023)

Macro Placement by Wire-Mask-Guided Black-Box Optimization. - Yunqi Shi; Ke Xue 001; Song Lei; Chao Qian 001 (NeurIPS, 2023)

Fast Teammate Adaptation in the Presence of Sudden Policy Change. - Ziqian Zhang; Lei Yuan 005; Lihe Li; Ke Xue 001; Chengxing Jia; Cong Guan; Chao Qian 001; Yang Yu 001 (UAI, 2023)

Macro Placement by Wire-Mask-Guided Black-Box Optimization. - Yunqi Shi; Ke Xue 001; Lei Song; Chao Qian 001 (CoRR, 2023)

Diversity from Human Feedback. - Ren-Jian Wang; Ke Xue 001; Yutong Wang; Peng Yang 008; Haobo Fu; Qiang Fu 016; Chao Qian 001 (CoRR, 2023)

Migrant Resettlement by Evolutionary Multi-objective Optimization. - Dan-Xuan Liu; Yu-Ran Gu; Chao Qian 001; Xin Mu; Ke Tang 001 (CoRR, 2023)

Multi-objective evolutionary algorithms are generally good: Maximizing monotone submodular functions over sequences. - Chao Qian 001; Dan-Xuan Liu; Chao Feng 006; Ke Tang 001 (Theor. Comput. Sci., 2023)

Special Issue on Theoretical Foundations of Evolutionary Computation. - Per Kristian Lehre; Aneta Neumann; Chao Qian 001 (Theor. Comput. Sci., 2023)

Stochastic Bayesian Optimization with Unknown Continuous Context Distribution via Kernel Density Estimation. - Xiaobin Huang; Lei Song; Ke Xue 001; Chao Qian 001 (AAAI, 2024)

Towards Running Time Analysis of Interactive Multi-Objective Evolutionary Algorithms. - Tianhao Lu; Chao Bian 002; Chao Qian 001 (AAAI, 2024)

Runtime Analysis of Population-based Evolutionary Neural Architecture Search for a Binary Classification Problem. - Zeqiong Lv; Chao Bian 002; Chao Qian 001; Yanan Sun 001 (GECCO, 2024)

Instance-Label Based Multi-Label Active Learning by Evolutionary Multi-Objective Optimization. - Yuheng Zhou; Haopu Shang; Yu-Chang Wu; Chao Qian 001 (GECCO Companion, 2024)

Sample-Efficient Quality-Diversity by Cooperative Coevolution. - Ke Xue 001; Ren-Jian Wang; Pengyi Li 001; Dong Li 016; Jianye Hao; Chao Qian 001 (ICLR, 2024)

Offline Multi-Objective Optimization. - Ke Xue 001; Rong-Xi Tan; Xiaobin Huang; Chao Qian 001 (ICML, 2024)

Quality-Diversity with Limited Resources. - Ren-Jian Wang; Ke Xue 001; Cong Guan; Chao Qian 001 (ICML, 2024)

Confidence-aware Contrastive Learning for Selective Classification. - Yu-Chang Wu; Shen-Huan Lyu; Haopu Shang; Xiangyu Wang; Chao Qian 001 (ICML, 2024)

Quality-Diversity Algorithms Can Provably Be Helpful for Optimization. - Chao Qian 001; Ke Xue 001; Ren-Jian Wang (IJCAI, 2024)

An Archive Can Bring Provable Speed-ups in Multi-Objective Evolutionary Algorithms. - Chao Bian 002; Shengjie Ren; Miqing Li; Chao Qian 001 (IJCAI, 2024)

Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy. - Chengrui Gao; Haopu Shang; Ke Xue 001; Dong Li 016; Chao Qian 001 (IJCAI, 2024)

Peptide Vaccine Design by Evolutionary Multi-Objective Optimization. - Dan-Xuan Liu; Yi-Heng Xu; Chao Qian 001 (IJCAI, 2024)

Maintaining Diversity Provably Helps in Evolutionary Multimodal Optimization. - Shengjie Ren; Zhijia Qiu; Chao Bian 002; Miqing Li; Chao Qian 001 (IJCAI, 2024)

Reinforcement Learning Policy as Macro Regulator Rather than Macro Placer. - Ke Xue 001; Ruo-Tong Chen; Xi Lin 001; Yunqi Shi; Shixiong Kai; Siyuan Xu; Chao Qian 001 (NeurIPS, 2024)

Monte Carlo Tree Search based Space Transfer for Black Box Optimization. - Shukuan Wang; Ke Xue 001; Song Lei; Xiaobin Huang; Chao Qian 001 (NeurIPS, 2024)

Biased Pareto Optimization for Subset Selection with Dynamic Cost Constraints. - Dan-Xuan Liu; Chao Qian 001 (PPSN (4), 2024)

A First Running Time Analysis of the Strength Pareto Evolutionary Algorithm 2 (SPEA2). - Shengjie Ren; Chao Bian 002; Miqing Li; Chao Qian 001 (PPSN (3), 2024)

A First Step Towards Runtime Analysis of Evolutionary Neural Architecture Search. - Zeqiong Lv; Chao Qian 001; Yanan Sun 001 (CoRR, 2024)

Reinforced In-Context Black-Box Optimization. - Lei Song; Chenxiao Gao; Ke Xue 001; Chenyang Wu 001; Dong Li 016; Jianye Hao; Zongzhang Zhang; Chao Qian 001 (CoRR, 2024)

Escaping Local Optima in Global Placement. - Ke Xue 001; Xi Lin 001; Yunqi Shi; Shixiong Kai; Siyuan Xu; Chao Qian 001 (CoRR, 2024)

Detection-Rate-Emphasized Multi-objective Evolutionary Feature Selection for Network Intrusion Detection. - Zi-Hang Cheng; Haopu Shang; Chao Qian 001 (CoRR, 2024)

Neural Solver Selection for Combinatorial Optimization. - Chengrui Gao; Haopu Shang; Ke Xue 001; Chao Qian 001 (CoRR, 2024)

Monte Carlo Tree Search based Space Transfer for Black-box Optimization. - Shukuan Wang; Ke Xue 001; Lei Song; Xiaobin Huang; Chao Qian 001 (CoRR, 2024)

Multi-class imbalance problem: A multi-objective solution. - Yi-Xiao He; Dan-Xuan Liu; Shen-Huan Lyu; Chao Qian 001; Zhi-Hua Zhou (Inf. Sci., 2024)

One by One, Continual Coordinating with Humans via Hyper-Teammate Identification. - Cong Guan; Feng Chen 042; Ke Xue 001; Chunpeng Fan; Lichao Zhang; Ziqian Zhang; Pengyao Zhao; Zongzhang Zhang; Chao Qian 001; Lei Yuan 005; Yang Yu 001 (Trans. Mach. Learn. Res., 2024)

Stage-Wise Magnitude-Based Pruning for Recurrent Neural Networks. - Guiying Li; Peng Yang 008; Chao Qian 001; Richang Hong; Ke Tang 001 (IEEE Trans. Neural Networks Learn. Syst., 2024)

Subset Selection for Evolutionary Multiobjective Optimization. - Yu-Ran Gu; Chao Bian 002; Miqing Li; Chao Qian 001 (IEEE Trans. Evol. Comput., 2024)

Margin distribution and structural diversity guided ensemble pruning. - Yi-Xiao He; Yu-Chang Wu; Chao Qian 001; Zhi-Hua Zhou (Mach. Learn., 2024)

Effective and Imperceptible Adversarial Textual Attack Via Multi-objectivization. - Shengcai Liu; Ning Lu 006; Wenjing Hong; Chao Qian 001; Ke Tang 001 (ACM Trans. Evol. Learn. Optim., 2024)

Can Evolutionary Clustering Have Theoretical Guarantees? - Chao Qian 001 (IEEE Trans. Evol. Comput., 2024)

Benchmarking Analysis of Evolutionary Neural Architecture Search. - Zeqiong Lv; Chao Qian 001; Yanan Sun 001 (IEEE Trans. Evol. Comput., 2024)

Analyzing the Expected Hitting Time of Evolutionary Computation-Based Neural Architecture Search Algorithms. - Zeqiong Lv; Chao Qian 001; Gary G. Yen; Yanan Sun 001 (IEEE Trans. Emerg. Top. Comput. Intell., 2024)

Pareto Set Learning for Multi-Objective Reinforcement Learning. - Erlong Liu; Yu-Chang Wu; Xiaobin Huang; Chengrui Gao; Ren-Jian Wang; Ke Xue 001; Chao Qian 001 (AAAI, 2025)

Timing-Driven Global Placement by Efficient Critical Path Extraction. - Yunqi Shi; Siyuan Xu; Shixiong Kai; Xi Lin 001; Ke Xue 001; Mingxuan Yuan; Chao Qian 001 (DATE, 2025)

Offline Model-Based Optimization by Learning to Rank. - Rong-Xi Tan; Ke Xue 001; Shen-Huan Lyu; Haopu Shang; Yao Wang; Yaoyuan Wang; Sheng Fu; Chao Qian 001 (ICLR, 2025)

Stochastic population update can provably be helpful in multi-objective evolutionary algorithms. - Chao Bian 002; Yawen Zhou; Miqing Li; Chao Qian 001 (Artif. Intell., 2025)

Pareto Optimization with Robust Evaluation for Noisy Subset Selection. - Yi-Heng Xu; Dan-Xuan Liu; Chao Qian 001 (CoRR, 2025)

Stochastic Population Update Provably Needs An Archive in Evolutionary Multi-objective Optimization. - Shengjie Ren; Zimin Liang; Miqing Li; Chao Qian 001 (CoRR, 2025)

Migrant Resettlement by Evolutionary Multiobjective Optimization. - Dan-Xuan Liu; Yu-Ran Gu; Chao Qian 001; Xin Mu; Ke Tang 001 (IEEE Trans. Artif. Intell., 2025)

Open3DBench: Open-Source Benchmark for 3D-IC Backend Implementation and PPA Evaluation. - Yunqi Shi; Chengrui Gao; Wanqi Ren; Siyuan Xu; Ke Xue 001; Mingxuan Yuan; Chao Qian 001; Zhi-Hua Zhou (CoRR, 2025)

Open and real-world human-AI coordination by heterogeneous training with communication. - Cong Guan; Ke Xue 001; Chunpeng Fan; Feng Chen 042; Lichao Zhang; Lei Yuan 005; Chao Qian 001; Yang Yu 001 (Frontiers Comput. Sci., 2025)

Runtime Analysis of Evolutionary NAS for Multiclass Classification. - Zeqiong Lv; Chao Qian 001; Yun Liu; Jiahao Fan; Yanan Sun 001 (CoRR, 2025)

Towards Universal Offline Black-Box Optimization via Learning Language Model Embeddings. - Rong-Xi Tan; Ming Chen; Ke Xue 001; Yao Wang; Yaoyuan Wang; Sheng Fu; Chao Qian 001 (CoRR, 2025)

Quality-Diversity Red-Teaming: Automated Generation of High-Quality and Diverse Attackers for Large Language Models. - Ren-Jian Wang; Ke Xue 001; Zeyu Qin; Ziniu Li; Sheng Tang; Hao-Tian Li; Shengcai Liu; Chao Qian 001 (CoRR, 2025)