Chao Bian

According to our database, Chao Bian authored at least 24 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Subset Selection for Evolutionary Multiobjective Optimization.

Yu-Ran Gu, Chao Bian, Miqing Li, Chao Qian

IEEE Trans. Evol. Comput., April, 2024

A First Running Time Analysis of the Strength Pareto Evolutionary Algorithm 2 (SPEA2).

Shengjie Ren, Chao Bian, Miqing Li, Chao Qian

Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

Maintaining Diversity Provably Helps in Evolutionary Multimodal Optimization.

Shengjie Ren, Zhijia Qiu, Chao Bian, Miqing Li, Chao Qian

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

An Archive Can Bring Provable Speed-ups in Multi-Objective Evolutionary Algorithms.

Chao Bian, Shengjie Ren, Miqing Li, Chao Qian

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Runtime Analysis of Population-based Evolutionary Neural Architecture Search for a Binary Classification Problem.

Zeqiong Lv, Chao Bian, Chao Qian, Yanan Sun

Proceedings of the Genetic and Evolutionary Computation Conference, 2024

Towards Running Time Analysis of Interactive Multi-Objective Evolutionary Algorithms.

Tianhao Lu, Chao Bian, Chao Qian

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms.

Chao Bian, Yawen Zhou, Miqing Li, Chao Qian

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Submodular Maximization under the Intersection of Matroid and Knapsack Constraints.

Yu-Ran Gu, Chao Bian, Chao Qian

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Running Time Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) using Binary or Stochastic Tournament Selection.

Chao Bian, Chao Qian

CoRR, 2022

Running Time Analysis of the (1+1)-EA Using Surrogate Models on OneMax and LeadingOnes.

Zi-An Zhang, Chao Bian, Chao Qian

Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Better Running Time of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) by Using Stochastic Tournament Selection.

Chao Bian, Chao Qian

Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Robust Subset Selection by Greedy and Evolutionary Pareto Optimization.

Chao Bian, Yawen Zhou, Chao Qian

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

On the robustness of median sampling in noisy evolutionary optimization.

Chao Bian, Chao Qian, Yang Yu, Ke Tang

Sci. China Inf. Sci., 2021

Analysis of Noisy Evolutionary Optimization When Sampling Fails.

Chao Qian, Chao Bian, Yang Yu, Ke Tang, Xin Yao

Algorithmica, 2021

Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints.

Chao Bian, Chao Qian, Frank Neumann, Yang Yu

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020

Running time analysis of the (1+1)-EA for robust linear optimization.

Chao Bian, Chao Qian, Ke Tang, Yang Yu

Theor. Comput. Sci., 2020

An Efficient Evolutionary Algorithm for Subset Selection with General Cost Constraints.

Chao Bian, Chao Feng, Chao Qian, Yang Yu

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Subset Selection by Pareto Optimization with Recombination.

Chao Qian, Chao Bian, Chao Feng

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

On the Robustness of Median Sampling in Noisy Evolutionary Optimization.

Chao Bian, Chao Qian, Yang Yu

CoRR, 2019

Running Time Analysis of the (1+1)-EA for Robust Linear Optimization.

Chao Bian, Chao Qian, Ke Tang

CoRR, 2019

Running Time Analysis of the ( $$1+1$$ 1 + 1 )-EA for OneMax and LeadingOnes Under Bit-Wise Noise.

Chao Qian, Chao Bian, Wu Jiang, Ke Tang

Algorithmica, 2019

2018

Towards a Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes Under General Bit-Wise Noise.

Chao Bian, Chao Qian, Ke Tang

Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

A General Approach to Running Time Analysis of Multi-objective Evolutionary Algorithms.

Chao Bian, Chao Qian, Ke Tang

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

Running time analysis of the (1+1)-EA for onemax and leadingones under bit-wise noise.

Chao Qian, Chao Bian, Wu Jiang, Ke Tang

Proceedings of the Genetic and Evolutionary Computation Conference, 2017