Chao Bian

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