PPaperPicks

Chao Qian

Nanjing University, State Key Laboratory for Novel Software Technology, China

41 papers at tracked venues · 16 at CORE A* · active 20242026

Venues

Frequent coauthors

Papers

  1. Budget-aware Algorithm Selection for Black-box Optimization
  2. Hot off the Press: A Theoretical Perspective on Why Stochastic Population Update Needs an Archive in Evolutionary Multi-objective Optimization
  3. Hot off the Press: Improved Theoretically-Grounded Evolutionary Algorithms for Subset Selection with a Linear Cost Constraint
  4. Hot off the Press: Migrant Resettlement by Evolutionary Multi-objective Optimization
  5. Hot off the Press: Sequential Multi-Agent Dynamic Algorithm Configuration
  6. Hot off the Press: Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms
  7. Hot off the Press: Towards Universal Offline Black-Box Optimization via Learning Language Model Embeddings
  8. Not Just for Archiving: Provable Benefits of Reusing the Archive in Evolutionary Multi-objective Optimization
  9. Pareto Optimization with Robust Evaluation for Noisy Subset Selection
  10. A Theoretical Perspective on Why Stochastic Population Update Needs an Archive in Evolutionary Multi-objective Optimization
  11. An Archive Can Bring Provable Speed-ups in Multi-Objective Evolutionary Algorithms
  12. Hot off the Press: Can Evolutionary Clustering Have Theoretical Guarantees?
    GECCO 2025 · Chao Qian
  13. Hot off the Press: Quality-Diversity Algorithms Can Provably Be Helpful for Optimization
    GECCO 2025 · Chao Qian
  14. How to Train Algorithm Selection Models: Insights from Black-box Continuous Optimization
  15. Improved Theoretically-Grounded Evolutionary Algorithms for Subset Selection with a Linear Cost Constraint
  16. MGDA/D: A Multiple Gradient Descent Algorithm Based on Decomposition
  17. Maintaining Diversity Provably Helps in Evolutionary Multimodal Optimization
  18. Neural Solver Selection for Combinatorial Optimization
  19. Offline Model-Based Optimization by Learning to Rank
  20. Pareto Optimization for Subset Selection: Theories and Practical Algorithms
    GECCO 2025 · Chao Qian
  21. Pareto Set Learning for Multi-Objective Reinforcement Learning
  22. Reinforced In-Context Black-Box Optimization
  23. Runtime Analysis of Evolutionary NAS for Multiclass Classification
  24. Sequential Multi-Agent Dynamic Algorithm Configuration
  25. Towards Running Time Analysis of Interactive Multi-objective Evolutionary Algorithms
  26. Towards Universal Offline Black-Box Optimization via Learning Language Model Embeddings
  27. A First Running Time Analysis of the Strength Pareto Evolutionary Algorithm 2 (SPEA2)
  28. An Archive Can Bring Provable Speed-ups in Multi-Objective Evolutionary Algorithms
  29. Biased Pareto Optimization for Subset Selection with Dynamic Cost Constraints
  30. Confidence-aware Contrastive Learning for Selective Classification
  31. Maintaining Diversity Provably Helps in Evolutionary Multimodal Optimization
  32. Monte Carlo Tree Search based Space Transfer for Black Box Optimization
  33. Offline Multi-Objective Optimization
  34. Peptide Vaccine Design by Evolutionary Multi-Objective Optimization
  35. Quality-Diversity Algorithms Can Provably Be Helpful for Optimization
    IJCAI 2024 · Chao Qian
  36. Quality-Diversity with Limited Resources
  37. Reinforcement Learning Policy as Macro Regulator Rather than Macro Placer
  38. Sample-Efficient Quality-Diversity by Cooperative Coevolution
  39. Stochastic Bayesian Optimization with Unknown Continuous Context Distribution via Kernel Density Estimation
  40. Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy
  41. Towards Running Time Analysis of Interactive Multi-Objective Evolutionary Algorithms