World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
31
Citations
3755
World Ranking
13717
National Ranking
1665

Overview

Yang Yu is affiliated with Nanjing University in China and has contributed extensively to the field of computer science, with a specific focus on artificial intelligence. Their work spans several subfields including artificial intelligence, computational theory and mathematics, management science and operations research, control and systems engineering, and information systems.

Yang Yu's research topics cover several advanced areas such as:

  • Reinforcement Learning in Robotics
  • Evolutionary Algorithms and Applications
  • Data Stream Mining Techniques
  • Advanced Multi-Objective Optimization Algorithms
  • Metaheuristic Optimization Algorithms Research
  • Advanced Bandit Algorithms Research
  • Adversarial Robustness in Machine Learning

Among recent papers authored or co-authored by Yang Yu are:

  • "COVID-19 Asymptomatic Infection Estimation" (2020), bioRxiv (Cold Spring Harbor Laboratory)
  • "QPLEX: Duplex Dueling Multi-Agent Q-Learning" (2020), arXiv (Cornell University)
  • "A survey on model-based reinforcement learning" (2024), Science China Information Sciences
  • "An Efficient Evolutionary Algorithm for Subset Selection with General Cost Constraints" (2020), Proceedings of the AAAI Conference on Artificial Intelligence
  • "Error Bounds of Imitating Policies and Environments for Reinforcement Learning" (2021), IEEE Transactions on Pattern Analysis and Machine Intelligence

Yang Yu has published frequently in prominent venues, including:

  • arXiv (Cornell University)
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • Science China Information Sciences
  • Machine Learning

Frequent collaborators of Yang Yu include:

  • Yi-Qi Hu
  • Hong Qian
  • Zongzhang Zhang
  • Chao Qian
  • Fan-Ming Luo

Yang Yu has also contributed to academic literature through book publication, notably:

  • Derivative-Free Optimization (2025), published by Springer Nature

Best Publications

  • Chaotic Local Search-Based Differential Evolution Algorithms for Optimization

    Shangce Gao;Yang Yu;Yirui Wang;Jiahai Wang

  • Taking Human out of Learning Applications: A Survey on Automated Machine Learning

    Quanming Yao;Mengshuo Wang;Hugo Jair Escalante;Isabelle Guyon

  • A two-layer surrogate-assisted particle swarm optimization algorithm

    Chaoli Sun;Yaochu Jin;Jianchao Zeng;Yang Yu

  • Reinforcement Learning to Rank in E-Commerce Search Engine: Formalization, Analysis, and Application

    Yujing Hu;Qing Da;Anxiang Zeng;Yang Yu

  • Diversity regularized ensemble pruning

    Nan Li;Yang Yu;Zhi-Hua Zhou

  • A multi-layered gravitational search algorithm for function optimization and real-world problems

    Yirui Wang;Shangce Gao;Mengchu Zhou;Yang Yu

  • Performance Evaluation of Model-Based Gait on Multi-View Very Large Population Database With Pose Sequences

    Weizhi An;Shiqi Yu;Yasushi Makihara;Xinhui Wu

  • QPLEX: Duplex Dueling Multi-Agent Q-Learning

    Jianhao Wang;Zhizhou Ren;Terry Liu;Yang Yu

  • Ensembling local learners ThroughMultimodal perturbation

    Zhi-Hua Zhou;Yang Yu

  • Subset selection by Pareto optimization

    Chao Qian;Yang Yu;Zhi-Hua Zhou

  • Stabilizing Reinforcement Learning in Dynamic Environment with Application to Online Recommendation

    Shi-Yong Chen;Yang Yu;Qing Da;Jun Tan

  • QPLEX: Duplex Dueling Multi-Agent Q-Learning

    Jianhao Wang;Zhizhou Ren;Terry Liu;Yang Yu

  • Towards Sample Efficient Reinforcement Learning.

    Yang Yu

  • An analysis on recombination in multi-objective evolutionary optimization

    Chao Qian;Yang Yu;Zhi-Hua Zhou

  • Virtual-Taobao: Virtualizing Real-world Online Retail Environment for Reinforcement Learning

    Jing-Cheng Shi;Yang Yu;Qing Da;Shi-Yong Chen

  • Pareto ensemble pruning

    Chao Qian;Yang Yu;Zhi-Hua Zhou

  • Learning with augmented class by exploiting unlabeled data

    Qing Da;Yang Yu;Zhi-Hua Zhou

  • A new approach to estimating the expected first hitting time of evolutionary algorithms

    Yang Yu;Zhi-Hua Zhou

  • Multi-label hypothesis reuse

    Sheng-Jun Huang;Yang Yu;Zhi-Hua Zhou

  • Evolutionary Learning: Advances in Theories and Algorithms

    Zhi-Hua Zhou;Yang Yu;Chao Qian

  • Spectrum of variable-random trees

    Fei Tony Liu;Kai Ming Ting;Yang Yu;Zhi-Hua Zhou

  • Derivative-free optimization via classification

    Yang Yu;Hong Qian;Yi-Qi Hu

  • A survey on model-based reinforcement learning

    Unknown

  • On the approximation ability of evolutionary optimization with application to minimum set cover

    Yang Yu;Xin Yao;Zhi-Hua Zhou

  • Bridging Machine Learning and Logical Reasoning by Abductive Learning

    Wang-Zhou Dai;Qiuling Xu;Yang Yu;Zhi-Hua Zhou

  • On Subset Selection with General Cost Constraints

    Chao Qian;Jing-Cheng Shi;Yang Yu;Ke Tang

  • On Reinforcement Learning for Full-Length Game of StarCraft

    Zhen-Jia Pang;Ruo-Ze Liu;Zhou-Yu Meng;Yi Zhang

  • Analyzing evolutionary optimization in noisy environments

    Chao Qian;Yang Yu;Zhi-Hua Zhou

  • Solving High-Dimensional Multi-Objective Optimization Problems with Low Effective Dimensions

    Hong Qian;Yang Yu

  • Error Bounds of Imitating Policies and Environments

    Tian Xu;Ziniu Li;Yang Yu

Frequent Co-Authors

Zhi-Hua Zhou
Zhi-Hua Zhou Nanjing University
Ke Tang
Ke Tang Southern University of Science and Technology
Xin Yao
Xin Yao Lingnan University
Tong Lu
Tong Lu Nanjing University
Hugo Jair Escalante
Hugo Jair Escalante National Institute of Astrophysics, Optics and Electronics
Isabelle Guyon
Isabelle Guyon University of Paris-Saclay
Yaochu Jin
Yaochu Jin Westlake University
Kai Ming Ting
Kai Ming Ting Nanjing University
Qiang Yang
Qiang Yang Hong Kong University of Science and Technology
Han Yu
Han Yu Nanyang Technological University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

If you're considering studying Computer Science in the USA, various online degree options and career pathways can shape your future. Many students start with an online associate's degree, which offers a flexible entry point into the field and can often be completed in two years or less. This can be an affordable stepping stone before pursuing more advanced qualifications.

For those seeking to boost their credentials quickly, it's worth investigating the shortest master degree programs. These accelerated options allow working professionals or undergraduates to earn a master’s degree in as little as one year. Additionally, targeting the most worthwhile masters degrees ensures your investment leads to in-demand skills and strong job prospects.

Cost is always an important factor. The most budget-conscious students can find options by researching the cheapest online colleges, making a quality Computer Science education accessible without significant financial burden. These pathways open doors to a broad range of tech careers while offering flexibility and value.

Best Scientists Citing Yang Yu

Trending Scientists