Chao Qian

Orcid: 0000-0001-6011-2512

Affiliations:
  • Nanjing University, State Key Laboratory for Novel Software Technology, China
  • University of Science and Technology of China, School of Computer Science and Technology, Hefei, China (former)
  • University of Science and Technology of China, School of Computer Science and Technology, Hefei, China
  • Nanjing University, State Key Laboratory for Novel Software Technology, China (PhD 2015)


According to our database1, Chao Qian authored at least 123 papers between 2010 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Open and real-world human-AI coordination by heterogeneous training with communication.
Frontiers Comput. Sci., April, 2025

2024
Analyzing the Expected Hitting Time of Evolutionary Computation-Based Neural Architecture Search Algorithms.
IEEE Trans. Emerg. Top. Comput. Intell., December, 2024

Benchmarking Analysis of Evolutionary Neural Architecture Search.
IEEE Trans. Evol. Comput., December, 2024

Can Evolutionary Clustering Have Theoretical Guarantees?
IEEE Trans. Evol. Comput., October, 2024

Effective and Imperceptible Adversarial Textual Attack Via Multi-objectivization.
ACM Trans. Evol. Learn. Optim., September, 2024

Margin distribution and structural diversity guided ensemble pruning.
Mach. Learn., June, 2024

Subset Selection for Evolutionary Multiobjective Optimization.
IEEE Trans. Evol. Comput., April, 2024

Stage-Wise Magnitude-Based Pruning for Recurrent Neural Networks.
IEEE Trans. Neural Networks Learn. Syst., February, 2024

Multi-class imbalance problem: A multi-objective solution.
Inf. Sci., 2024

Offline Model-Based Optimization by Learning to Rank.
CoRR, 2024

Neural Solver Selection for Combinatorial Optimization.
CoRR, 2024

Detection-Rate-Emphasized Multi-objective Evolutionary Feature Selection for Network Intrusion Detection.
CoRR, 2024

Escaping Local Optima in Global Placement.
CoRR, 2024

Reinforced In-Context Black-Box Optimization.
CoRR, 2024

A First Step Towards Runtime Analysis of Evolutionary Neural Architecture Search.
CoRR, 2024

A First Running Time Analysis of the Strength Pareto Evolutionary Algorithm 2 (SPEA2).
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

Biased Pareto Optimization for Subset Selection with Dynamic Cost Constraints.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

Maintaining Diversity Provably Helps in Evolutionary Multimodal Optimization.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Peptide Vaccine Design by Evolutionary Multi-Objective Optimization.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

An Archive Can Bring Provable Speed-ups in Multi-Objective Evolutionary Algorithms.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Quality-Diversity Algorithms Can Provably Be Helpful for Optimization.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Confidence-aware Contrastive Learning for Selective Classification.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Quality-Diversity with Limited Resources.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Offline Multi-Objective Optimization.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Sample-Efficient Quality-Diversity by Cooperative Coevolution.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Instance-Label Based Multi-Label Active Learning by Evolutionary Multi-Objective Optimization.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2024

Runtime Analysis of Population-based Evolutionary Neural Architecture Search for a Binary Classification Problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024

Towards Running Time Analysis of Interactive Multi-Objective Evolutionary Algorithms.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Stochastic Bayesian Optimization with Unknown Continuous Context Distribution via Kernel Density Estimation.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Special Issue on Theoretical Foundations of Evolutionary Computation.
Theor. Comput. Sci., March, 2023

Multi-objective evolutionary algorithms are generally good: Maximizing monotone submodular functions over sequences.
Theor. Comput. Sci., 2023

Migrant Resettlement by Evolutionary Multi-objective Optimization.
CoRR, 2023

Diversity from Human Feedback.
CoRR, 2023

Macro Placement by Wire-Mask-Guided Black-Box Optimization.
CoRR, 2023

Fast Teammate Adaptation in the Presence of Sudden Policy Change.
Proceedings of the Uncertainty in Artificial Intelligence, 2023

Macro Placement by Wire-Mask-Guided Black-Box Optimization.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Multi-objective Optimization-based Selection for Quality-Diversity by Non-surrounded-dominated Sorting.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Quality-Similar Diversity via Population Based Reinforcement Learning.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler.
Proceedings of the IEEE Congress on Evolutionary Computation, 2023

Robust Multi-Agent Coordination via Evolutionary Generation of Auxiliary Adversarial Attackers.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Human Assisted Learning by Evolutionary Multi-Objective Optimization.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Submodular Maximization under the Intersection of Matroid and Knapsack Constraints.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Analysis of Expected Hitting Time for Designing Evolutionary Neural Architecture Search Algorithms.
CoRR, 2022

Heterogeneous Multi-agent Zero-Shot Coordination by Coevolution.
CoRR, 2022

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

ZOOpt: a toolbox for derivative-free optimization.
Sci. China Inf. Sci., 2022

Result diversification by multi-objective evolutionary algorithms with theoretical guarantees.
Artif. Intell., 2022

Multi-objective Evolutionary Instance Selection for Multi-label Classification.
Proceedings of the PRICAI 2022: Trends in Artificial Intelligence, 2022

Running Time Analysis of the (1+1)-EA Using Surrogate Models on OneMax and LeadingOnes.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Robust Neural Network Pruning by Cooperative Coevolution.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Multi-objective Evolutionary Ensemble Pruning Guided by Margin Distribution.
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.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Monte Carlo Tree Search based Variable Selection for High Dimensional Bayesian Optimization.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Multi-agent Dynamic Algorithm Configuration.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Neural Network Pruning by Cooperative Coevolution.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Towards Theoretically Grounded Evolutionary Learning.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Robust Subset Selection by Greedy and Evolutionary Pareto Optimization.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Evolutionary Diversity Optimization with Clustering-based Selection for Reinforcement Learning.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Evolutionary submodular optimisation: tutorial.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

2021
Efficient Minimum Cost Seed Selection With Theoretical Guarantees for Competitive Influence Maximization.
IEEE Trans. Cybern., 2021

Multiobjective Evolutionary Algorithms Are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions.
Evol. Comput., 2021

HydraText: Multi-objective Optimization for Adversarial Textual Attack.
CoRR, 2021

On the robustness of median sampling in noisy evolutionary optimization.
Sci. China Inf. Sci., 2021

Analysis of Noisy Evolutionary Optimization When Sampling Fails.
Algorithmica, 2021

Evolutionary Gradient Descent for Non-convex Optimization.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Evolutionary submodular optimisation.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Prediction Guided Meta-Learning for Multi-Objective Reinforcement Learning.
Proceedings of the IEEE Congress on Evolutionary Computation, 2021

Multi-Objective Submodular Maximization by Regret Ratio Minimization with Theoretical Guarantee.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Distributed Pareto Optimization for Large-Scale Noisy Subset Selection.
IEEE Trans. Evol. Comput., 2020

Running time analysis of the (1+1)-EA for robust linear optimization.
Theor. Comput. Sci., 2020

Self-Guided Evolution Strategies with Historical Estimated Gradients.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Bayesian Optimization using Pseudo-Points.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

An Efficient Evolutionary Algorithm for Subset Selection with General Cost Constraints.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Subset Selection by Pareto Optimization with Recombination.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

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

Bayesian Optimization using Pseudo-Points.
CoRR, 2019

On the Robustness of Median Sampling in Noisy Evolutionary Optimization.
CoRR, 2019

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

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

Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms.
Artif. Intell., 2019

Unsupervised Feature Selection by Pareto Optimization.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Evolutionary Learning: Advances in Theories and Algorithms
Springer, ISBN: 978-981-13-5955-2, 2019

2018
Constrained Monotone k-Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee.
IEEE Trans. Evol. Comput., 2018

Analyzing Evolutionary Optimization in Noisy Environments.
Evol. Comput., 2018

On the Effectiveness of Sampling for Evolutionary Optimization in Noisy Environments.
Evol. Comput., 2018

Maximizing Monotone DR-submodular Continuous Functions by Derivative-free Optimization.
CoRR, 2018

ZOOpt/ZOOjl: Toolbox for Derivative-Free Optimization.
CoRR, 2018

Towards a Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes Under General Bit-Wise Noise.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Distributed Pareto Optimization for Subset Selection.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Sequence Selection by Pareto Optimization.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Optimization based Layer-wise Magnitude-based Pruning for DNN Compression.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Efficient DNN Neuron Pruning by Minimizing Layer-wise Nonlinear Reconstruction Error.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

A General Approach to Running Time Analysis of Multi-objective Evolutionary Algorithms.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Dynamic Mutation Based Pareto Optimization for Subset Selection.
Proceedings of the Intelligent Computing Methodologies - 14th International Conference, 2018

Improved Running Time Analysis of the (1+1)-ES on the Sphere Function.
Proceedings of the Intelligent Computing Theories and Application, 2018

On Multiset Selection With Size Constraints.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Maximizing Non-monotone/Non-submodular Functions by Multi-objective Evolutionary Algorithms.
CoRR, 2017

Dynamic and Adaptive Threshold for DNN Compression from Scratch.
Proceedings of the Simulated Evolution and Learning - 11th International Conference, 2017

Subset Selection under Noise.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Optimizing Ratio of Monotone Set Functions.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

On Subset Selection with General Cost Constraints.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Running time analysis of the (1+1)-EA for onemax and leadingones under bit-wise noise.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Evolutionary multi-objective optimization made faster by sequential decomposition.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

2016
Selection Hyper-heuristics Can Provably Be Helpful in Evolutionary Multi-objective Optimization.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Parallel Pareto Optimization for Subset Selection.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

A Lower Bound Analysis of Population-Based Evolutionary Algorithms for Pseudo-Boolean Functions.
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2016, 2016

Search based recommender system using many-objective evolutionary algorithm.
Proceedings of the IEEE Congress on Evolutionary Computation, 2016

2015
Switch Analysis for Running Time Analysis of Evolutionary Algorithms.
IEEE Trans. Evol. Comput., 2015

Variable solution structure can be helpful in evolutionary optimization.
Sci. China Inf. Sci., 2015

Subset Selection by Pareto Optimization.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

On Constrained Boolean Pareto Optimization.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Running time analysis: Convergence-based analysis reduces to switch analysis.
Proceedings of the IEEE Congress on Evolutionary Computation, 2015

Pareto Ensemble Pruning.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
On the Effectiveness of Sampling for Evolutionary Optimization in Noisy Environments.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

2013
An analysis on recombination in multi-objective evolutionary optimization.
Artif. Intell., 2013

2012
On Algorithm-Dependent Boundary Case Identification for Problem Classes.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012

2011
Towards Analyzing Crossover Operators in Evolutionary Search via General Markov Chain Switching Theorem
CoRR, 2011

Collisions are helpful for computing unique input-output sequences.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

2010
Towards Analyzing Recombination Operators in Evolutionary Search.
Proceedings of the Parallel Problem Solving from Nature, 2010


  Loading...