Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lindong Xie

dblp:346/9758 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2025
0009-0004-2497-2338ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › black-box optimization
algorithm configuration
0.912025
Co-Evolution of Large Language Models and Configuration Strategies to Enhance Surrogate-Assisted Evolutionary Algorithm · KDD (2) 2025
Mathematical optimization › multi-objective optimization
evolutionary algorithm
0.912025
Co-Evolution of Large Language Models and Configuration Strategies to Enhance Surrogate-Assisted Evolutionary Algorithm · KDD (2) 2025
Mathematical optimization › evolutionary computation
surrogate-assisted evolutionary algorithm
0.912025
Co-Evolution of Large Language Models and Configuration Strategies to Enhance Surrogate-Assisted Evolutionary Algorithm · KDD (2) 2025
Mathematical optimization
black-box optimization
0.312025
Co-Evolution of Large Language Models and Configuration Strategies to Enhance Surrogate-Assisted Evolutionary Algorithm · KDD (2) 2025
Mathematical optimization › evolutionary computation
evolutionary optimization
0.312025
Co-Evolution of Large Language Models and Configuration Strategies to Enhance Surrogate-Assisted Evolutionary Algorithm · KDD (2) 2025

Methods — techniques the papers use, named apart from their topics

surrogate model · 0.9large language model · 0.9co-evolution · 0.9
YearPublicationVenuePosition
2025 Co-Evolution of Large Language Models and Configuration Strategies to Enhance Surrogate-Assisted Evolutionary Algorithm
abstract
Surrogate-assisted evolutionary algorithms (SAEAs) are well-suited for optimizing computationally expensive black-box problems in diverse real-world scenarios. The sample efficiency of SAEAs depends largely on the configuration of the surrogate model and sampling criteria. However, configuring these core components requires substantial manual effort and expert knowledge, limiting the broader applicability of SAEAs. To address these challenges, we propose CoE-SAEA, a novel paradigm that co-evolves large language models (LLMs) and configuration strategies to enhance SAEAs. Specifically, the paradigm consists of three populations with distinct roles: one evolves LLM prompts to generate robust configuration strategy instructions, another optimizes the configuration strategies, and the third solves the optimization problem using the selected algorithm configuration. Additionally, an exploration-exploitation module is incorporated to decide whether to explore new configuration strategies via LLMs or exploit existing ones. We empirically validate the efficacy of CoE-SAEA by comparing it to state-of-the-art algorithms across various benchmark problems and a real-world traffic signal optimization task. The source code of the proposed CoE-SAEA is publicly available at: https://github.com/ForrestXie9/CoE-SAEA.
Lindong Xie, Yang Zhang 0072, Zhixian Tang, Edward Chung 0001, Genghui Li, Zhenkun Wang 0001
KDD (2)1
2025 Customized Evolutionary Expensive Optimization: Efficient Search and Surrogate Strategies for Continuous and Categorical Variables
abstract
Surrogate-assisted evolutionary algorithms for addressing expensive optimization problems with both continuous and categorical variables (EOPCCVs) are still in the early stages of development. This study makes significant advancements by leveraging the mixed-variable nature of EOPCCVs in two crucial ways. First, it introduces a novel hybrid approach combining differential evolution and upper confidence bound sampling (DEUCB), designed to explore the mixed search space effectively. Second, a specialized value distance metric (VDM) is proposed, integrating continuous and categorical variables, to enhance the accuracy of the radial basis function (RBF) model approximation. Finally, we present a customized evolutionary expensive optimization algorithm (CEEO), which seamlessly incorporates DEUCB and RBF-VDM into the widely utilized global and local surrogate-assisted evolutionary optimization framework. Experimental results, compared against state-of-the-art counterparts on three distinct sets of benchmark problems and a convolutional neural network hyperparameter optimization task, consistently affirm the efficacy of the proposed CEEO in addressing EOPCCVs. The source code for the proposed CEEO algorithm is available athttps://github.com/CIAM-Group/EvolutionaryAlgorithm_Codes/tree/main/CEEO_Code.
Zhenkun Wang 0001, Lindong Xie, Genghui Li, Weifeng Gao, Maoguo Gong, Ling Wang 0001
IEEE Trans. Syst. Man Cybern. Syst.2
2024 Surrogate-Assisted Evolutionary Algorithm With Model and Infill Criterion Auto-Configuration
abstract
Surrogate-assisted evolutionary algorithms (SAEAs) have proven to be effective in solving computationally expensive optimization problems (EOPs). However, the performance of SAEAs heavily relies on the surrogate model and infill criterion used. To improve the generalization of SAEAs and enable them to solve a wide range of EOPs, this paper proposes an SAEA called AutoSAEA, which features model and infill criterion auto-configuration. Specifically, AutoSAEA formulates model and infill criterion selection as a two-level multi-armed bandit problem (TL-MAB). The first and second levels cooperate in selecting the surrogate model and infill criterion, respectively. A two-level reward (TL-R) measures the value of the surrogate model and infill criterion, while a two-level upper confidence bound (TL-UCB) selects the model and infill criterion in an online manner. Numerous experiments validate the superiority of AutoSAEA over some state-of-the-art SAEAs on complex benchmark problems and a real-world oil reservoir production optimization problem.
Lindong Xie, Genghui Li, Zhenkun Wang 0001, Laizhong Cui, Maoguo Gong
IEEE Trans. Evol. Comput.1
2023 Evolutionary algorithm with individual-distribution search strategy and regression-classification surrogates for expensive optimization
Genghui Li, Lindong Xie, Zhenkun Wang 0001, Maoguo Gong
Inf. Sci.2