Chao Qian
56 papers · 2015–2026 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+16 more ↓ Show less ↑
π§ Keyword Pioneer π Conference Polyglot (6) πΊοΈ Taxonomy Completionist (10) π Interdisciplinary Bridge π Academic Marathon (10)
πΊοΈ
Taxonomy Completionist
(10)
π£
Hot Topic Early Bird
π§
Keyword Pioneer
π
Conference Loyalist
(26)
π
Grand Slam
π
Triple Crown
π
Keyword Champion
(2)
π€
Dynamic Duo
(22)
π¬
Deep Specialist
(26)
π§¬
Topic Evolution
π
Conference Pioneer
ποΈ
Keyword Collector
(134)
π
Trend Setter
β‘
Prolific Year
(13)
π₯
Unstoppable
(11)
π
Century Club
(55)
Conferences
IJCAI (26)
AAAI (11)
ICML (7)
NIPS (7)
ICLR (4)
UAI (1)
Top co-authors
Keywords
evolutionary algorithm
(17)
multi-objective optimization
(11)
subset selection
(9)
pareto optimization
(8)
greedy algorithm
(6)
black-box optimization
(4)
approximation guarantee
(4)
approximation algorithm
(4)
reinforcement learning
(4)
bayesian optimization
(4)
runtime analysis
(3)
model compression
(3)
feature selection
(3)
multi-agent reinforcement learning
(3)
influence maximization
(3)
pareto front
(3)
combinatorial optimization
(3)
deep neural network
(3)
submodular function
(3)
approximation ratio
(3)
Papers
Not Just for Archiving: Provable Benefits of Reusing the Archive in Evolutionary Multi-objective Optimization
AAAI 2026
A Theoretical Perspective on Why Stochastic Population Update Needs an Archive in Evolutionary Multi-objective Optimization
IJCAI 2025
Improved Theoretically-Grounded Evolutionary Algorithms for Subset Selection with a Linear Cost Constraint
ICML 2025
Neural Solver Selection for Combinatorial Optimization
ICML 2025
Runtime Analysis of Evolutionary NAS for Multiclass Classification
ICML 2025
Reinforced In-Context Black-Box Optimization
IJCAI 2025
Towards Universal Offline Black-Box Optimization via Learning Language Model Embeddings
ICML 2025
Pareto Set Learning for Multi-Objective Reinforcement Learning
AAAI 2025
Offline Model-Based Optimization by Learning to Rank
ICLR 2025
Towards Running Time Analysis of Interactive Multi-Objective Evolutionary Algorithms
AAAI 2024
Quality-Diversity Algorithms Can Provably Be Helpful for Optimization
IJCAI 2024
Peptide Vaccine Design by Evolutionary Multi-Objective Optimization
IJCAI 2024
Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy
IJCAI 2024
Monte Carlo Tree Search based Space Transfer for Black Box Optimization
NIPS 2024
Reinforcement Learning Policy as Macro Regulator Rather than Macro Placer
NIPS 2024
An Archive Can Bring Provable Speed-ups in Multi-Objective Evolutionary Algorithms
IJCAI 2024
Stochastic Bayesian Optimization with Unknown Continuous Context Distribution via Kernel Density Estimation
AAAI 2024
Maintaining Diversity Provably Helps in Evolutionary Multimodal Optimization
IJCAI 2024
Sample-Efficient Quality-Diversity by Cooperative Coevolution
ICLR 2024
Quality-Diversity with Limited Resources
ICML 2024
Confidence-aware Contrastive Learning for Selective Classification
ICML 2024
Offline Multi-Objective Optimization
ICML 2024
Fast Teammate Adaptation in the Presence of Sudden Policy Change
UAI 2023
Macro Placement by Wire-Mask-Guided Black-Box Optimization
NIPS 2023
Robust Multi-Agent Coordination via Evolutionary Generation of Auxiliary Adversarial Attackers
AAAI 2023
Submodular Maximization under the Intersection of Matroid and Knapsack Constraints
AAAI 2023
Quality-Similar Diversity via Population Based Reinforcement Learning
ICLR 2023
Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms
IJCAI 2023
Human Assisted Learning by Evolutionary Multi-Objective Optimization
AAAI 2023
Multi-objective Optimization-based Selection for Quality-Diversity by Non-surrounded-dominated Sorting
IJCAI 2023
Robust Subset Selection by Greedy and Evolutionary Pareto Optimization
IJCAI 2022
Multi-agent Dynamic Algorithm Configuration
NIPS 2022
Monte Carlo Tree Search based Variable Selection for High Dimensional Bayesian Optimization
NIPS 2022
Evolutionary Diversity Optimization with Clustering-based Selection for Reinforcement Learning
ICLR 2022
Towards Theoretically Grounded Evolutionary Learning
IJCAI 2022
Neural Network Pruning by Cooperative Coevolution
IJCAI 2022
Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints
IJCAI 2021
Multi-Objective Submodular Maximization by Regret Ratio Minimization with Theoretical Guarantee
AAAI 2021
Evolutionary Gradient Descent for Non-convex Optimization
IJCAI 2021
An Efficient Evolutionary Algorithm for Subset Selection with General Cost Constraints
AAAI 2020
Bayesian Optimization using Pseudo-Points
IJCAI 2020
Self-Guided Evolution Strategies with Historical Estimated Gradients
IJCAI 2020
Subset Selection by Pareto Optimization with Recombination
AAAI 2020
Unsupervised Feature Selection by Pareto Optimization
AAAI 2019
Efficient DNN Neuron Pruning by Minimizing Layer-wise Nonlinear Reconstruction Error
IJCAI 2018
Distributed Pareto Optimization for Subset Selection
IJCAI 2018
Optimization based Layer-wise Magnitude-based Pruning for DNN Compression
IJCAI 2018
Sequence Selection by Pareto Optimization
IJCAI 2018
Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection
IJCAI 2018
A General Approach to Running Time Analysis of Multi-objective Evolutionary Algorithms
IJCAI 2018
Subset Selection under Noise
NIPS 2017
On Subset Selection with General Cost Constraints
IJCAI 2017
Optimizing Ratio of Monotone Set Functions
IJCAI 2017
Parallel Pareto Optimization for Subset Selection
IJCAI 2016
On Constrained Boolean Pareto Optimization
IJCAI 2015
Subset Selection by Pareto Optimization
NIPS 2015