Xin Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xin Liu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Jianyong Sun
Xi'an Jiaotong University, Xi'an, China
3 shared publications Zongben Xu
School of Mathematics and Statistics, Xian Jiaotong University, Xian, China
2 shared publications- Qingfu Zhang
City University of Hong Kong, Hong Kong, China
1 shared publication - Thomas Bäck
Leiden University
1 shared publication - Zhenkun Wang
Southern University of Science and Technology
1 shared publication - Zongben Xu
Xi’an Jiaotong University
1 shared publication
Latest Publications
- 29 April 2024
- Published by Springer Nature in Science China Mathematics
- Vol. 67 (6) , 1317-1340
Learning to sample initial solution for solving 0–1 discrete optimization problem by local search
- 29 April 2024
- Published by Springer Nature in Science China Mathematics
- Vol. 67 (6) , 1317-1340
Learning to sample initial solution for solving 0–1 discrete optimization problem by local search
- 13 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 7 (6) , 1605-1620
Learning to Learn Evolutionary Algorithm: A Learnable Differential Evolution
Research on evolutionary optimization has flourished for several decades. Now it has come to a turning point. With the advancement of artificial intelligence, especially deep learning and reinforcement learning, it is becoming appealing to rethink the design and development of evolutionary algorithm (EA). From our perspective, a new-generation EA should be learned rather than manually designed, based on learning from optimization experiences (such as obtained from optimizing a family of optimization problems), the deep understanding of the roles of recombination operators, and the usage of experiences extracted through history optimization trajectories, so as to intelligently decide the control parameters that can adapt to the problem landscape changes. This learning can be conducted by strongly coupling with reinforcement learning since an evolutionary search procedure can be modeled as a Markov Decision Process (MDP). In this paper we propose a framework for automatic learning of EA, and present an exemplar study on learning a differential evolution (DE). Experimental results show that the learned adaptive DE is very competitive to some recent EAs on a commonly-used test suite, which indicates that the proposed learning framework has a great potential for the automatic design of promising EAs.
- 13 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 7 (6) , 1605-1620
Learning to Learn Evolutionary Algorithm: A Learnable Differential Evolution
Research on evolutionary optimization has flourished for several decades. Now it has come to a turning point. With the advancement of artificial intelligence, especially deep learning and reinforcement learning, it is becoming appealing to rethink the design and development of evolutionary algorithm (EA). From our perspective, a new-generation EA should be learned rather than manually designed, based on learning from optimization experiences (such as obtained from optimizing a family of optimization problems), the deep understanding of the roles of recombination operators, and the usage of experiences extracted through history optimization trajectories, so as to intelligently decide the control parameters that can adapt to the problem landscape changes. This learning can be conducted by strongly coupling with reinforcement learning since an evolutionary search procedure can be modeled as a Markov Decision Process (MDP). In this paper we propose a framework for automatic learning of EA, and present an exemplar study on learning a differential evolution (DE). Experimental results show that the learned adaptive DE is very competitive to some recent EAs on a commonly-used test suite, which indicates that the proposed learning framework has a great potential for the automatic design of promising EAs.
- 19 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 25 (4) , 666-680
Learning Adaptive Differential Evolution Algorithm From Optimization Experiences by Policy Gradient
Differential evolution is one of the most prestigious population-based stochastic optimization algorithm for black-box problems. The performance of a differential evolution algorithm depends highly on its mutation and crossover strategy and associated control parameters. However, the determination process for the most suitable parameter setting is troublesome and time consuming. Adaptive control parameter methods that can adapt to problem landscape and optimization environment are more preferable than fixed parameter settings. This article proposes a novel adaptive parameter control approach based on learning from the optimization experiences over a set of problems. In the approach, the parameter control is modeled as a finite-horizon Markov decision process. A reinforcement learning algorithm, named policy gradient, is applied to learn an agent (i.e., parameter controller) that can provide the control parameters of a proposed differential evolution adaptively during the search procedure. The differential evolution algorithm based on the learned agent is compared against nine well-known evolutionary algorithms on the CEC'13 and CEC'17 test suites. Experimental results show that the proposed algorithm performs competitively against these compared algorithms on the test suites.
- 19 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 25 (4) , 666-680
Learning Adaptive Differential Evolution Algorithm From Optimization Experiences by Policy Gradient
Differential evolution is one of the most prestigious population-based stochastic optimization algorithm for black-box problems. The performance of a differential evolution algorithm depends highly on its mutation and crossover strategy and associated control parameters. However, the determination process for the most suitable parameter setting is troublesome and time consuming. Adaptive control parameter methods that can adapt to problem landscape and optimization environment are more preferable than fixed parameter settings. This article proposes a novel adaptive parameter control approach based on learning from the optimization experiences over a set of problems. In the approach, the parameter control is modeled as a finite-horizon Markov decision process. A reinforcement learning algorithm, named policy gradient, is applied to learn an agent (i.e., parameter controller) that can provide the control parameters of a proposed differential evolution adaptively during the search procedure. The differential evolution algorithm based on the learned agent is compared against nine well-known evolutionary algorithms on the CEC'13 and CEC'17 test suites. Experimental results show that the proposed algorithm performs competitively against these compared algorithms on the test suites.