Chao Bian

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 31

Top Topics

Multi Objective

Evolutionary Algorithm

Subset Selection

Top Venues

Publications

Shengjie Ren, Chao Bian, Miqing Li, Chao Qian
A First Running Time Analysis of the Strength Pareto Evolutionary Algorithm 2 (SPEA2). CoRR (2024)
Zeqiong Lv, Chao Bian, Chao Qian, Yanan Sun
Runtime Analysis of Population-based Evolutionary Neural Architecture Search for a Binary Classification Problem. GECCO (2024)
Tianhao Lu, Chao Bian, Chao Qian
Towards Running Time Analysis of Interactive Multi-Objective Evolutionary Algorithms. AAAI (2024)
Shengjie Ren, Zhijia Qiu, Chao Bian, Miqing Li, Chao Qian
Maintaining Diversity Provably Helps in Evolutionary Multimodal Optimization. CoRR (2024)
Yu-Ran Gu, Chao Bian, Miqing Li, Chao Qian
Subset Selection for Evolutionary Multiobjective Optimization. IEEE Trans. Evol. Comput. 28 (2) (2024)
Chao Bian, Shengjie Ren, Miqing Li, Chao Qian
An Archive Can Bring Provable Speed-ups in Multi-Objective Evolutionary Algorithms. CoRR (2024)
Chao Bian, Yawen Zhou, Miqing Li, Chao Qian
Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms. IJCAI (2023)
Yu-Ran Gu, Chao Bian, Chao Qian
Submodular Maximization under the Intersection of Matroid and Knapsack Constraints. AAAI (2023)
Yu-Ran Gu, Chao Bian, Chao Qian
Submodular Maximization under the Intersection of Matroid and Knapsack Constraints. CoRR (2023)
Tianhao Lu, Chao Bian, Chao Qian
Towards Running Time Analysis of Interactive Multi-objective Evolutionary Algorithms. CoRR (2023)
Chao Bian, Yawen Zhou, Miqing Li, Chao Qian
Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms. CoRR (2023)
Chao Bian, Chao Qian
Running Time Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) using Binary or Stochastic Tournament Selection. CoRR (2022)
Chao Bian, Yawen Zhou, Chao Qian
Robust Subset Selection by Greedy and Evolutionary Pareto Optimization. CoRR (2022)
Chao Bian, Yawen Zhou, Chao Qian
Robust Subset Selection by Greedy and Evolutionary Pareto Optimization. IJCAI (2022)
Chao Bian, Chao Qian
Better Running Time of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) by Using Stochastic Tournament Selection. PPSN (2) (2022)
Zi-An Zhang, Chao Bian, Chao Qian
Running Time Analysis of the (1+1)-EA Using Surrogate Models on OneMax and LeadingOnes. PPSN (2) (2022)
Chao Bian, Chao Qian, Frank Neumann, Yang Yu
Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints. IJCAI (2021)
Chao Qian, Chao Bian, Yang Yu, Ke Tang, Xin Yao
Analysis of Noisy Evolutionary Optimization When Sampling Fails. Algorithmica 83 (4) (2021)
Chao Bian, Chao Qian, Yang Yu, Ke Tang
On the robustness of median sampling in noisy evolutionary optimization. Sci. China Inf. Sci. 64 (5) (2021)
Chao Bian, Chao Feng, Chao Qian, Yang Yu
An Efficient Evolutionary Algorithm for Subset Selection with General Cost Constraints. AAAI (2020)
Chao Bian, Chao Qian, Ke Tang, Yang Yu
Running time analysis of the (1+1)-EA for robust linear optimization. Theor. Comput. Sci. 843 (2020)
Chao Qian, Chao Bian, Chao Feng
Subset Selection by Pareto Optimization with Recombination. AAAI (2020)
Chao Bian, Chao Qian, Yang Yu
On the Robustness of Median Sampling in Noisy Evolutionary Optimization. CoRR (2019)
Chao Bian, Chao Qian, Ke Tang
Running Time Analysis of the (1+1)-EA for Robust Linear Optimization. CoRR (2019)
Chao Qian, Chao Bian, Wu Jiang, Ke Tang
Running Time Analysis of the ( $$1+1$$ 1 + 1 )-EA for OneMax and LeadingOnes Under Bit-Wise Noise. Algorithmica 81 (2) (2019)
Chao Bian, Chao Qian, Ke Tang
Towards a Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes Under General Bit-Wise Noise. PPSN (2) (2018)
Chao Qian, Chao Bian, Yang Yu, Ke Tang, Xin Yao
Analysis of noisy evolutionary optimization when sampling fails. GECCO (2018)
Chao Qian, Chao Bian, Yang Yu, Ke Tang, Xin Yao
Analysis of Noisy Evolutionary Optimization When Sampling Fails. CoRR (2018)
Chao Bian, Chao Qian, Ke Tang
A General Approach to Running Time Analysis of Multi-objective Evolutionary Algorithms. IJCAI (2018)
Chao Qian, Chao Bian, Wu Jiang, Ke Tang
Running time analysis of the (1+1)-EA for onemax and leadingones under bit-wise noise. GECCO (2017)
Chao Qian, Chao Bian, Wu Jiang, Ke Tang
Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes under Bit-wise Noise. CoRR (2017)