Qiqi Duan

Qiqi Duan

Auto-generated profile, based on publicly available information

Qiqi Duan

Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 September 2024 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
QZQi Zhao
Qi Zhao
TLTengfei Liu
Tengfei Liu
BYBai Yan
Bai Yan
QDQiqi Duan
Qiqi Duan
JYJian Yang
Jian Yang
YSYuhui Shi
Yuhui Shi
Automated design of metaheuristic algorithms offers an attractive avenue to reduce human effort and gain enhanced performance beyond human intuition. Current automated methods design algorithms within a fixed structure and operate from scratch. This poses a clear gap towards fully discovering potentials over the metaheuristic family and fertilizing from prior design experience. To bridge the gap, this paper proposes an autoregressive learning-based designer for automated design of metaheuristic algorithms. Our designer formulates metaheuristic algorithm design as a sequence generation task, and harnesses an autoregressive generative network to handle the task. This offers two advances. First, through autoregressive inference, the designer generates algorithms with diverse lengths and structures, enabling to fully discover potentials over the metaheuristic family. Second, prior design knowledge learned and accumulated in neurons of the designer can be retrieved for designing algorithms for future problems, paving the way to continual design of algorithms for open-ended problem-solving. Extensive experiments on numeral benchmarks and real-world problems reveal that the proposed designer generates algorithms that outperform all human-created baselines on 24 out of 25 test problems. The generated algorithms display various structures and behaviors, reasonably fitting for different problem-solving contexts. Code is available at https://github.com/auto4opt/ALDeshttps://github.com/auto4opt/ALDes.

15 August 2022
Verified
Book Chapter
Closed access
PDF file
QDQiqi Duan
Qiqi Duan
GZGuochen Zhou
Guochen Zhou
CSChang Shao
Chang Shao
YYYijun Yang
Yijun Yang
YSYuhui Shi
Yuhui Shi

2 August 2024 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
QDQiqi Duan
Qiqi Duan
CSChang Shao
Chang Shao
GZGuochen Zhou
Guochen Zhou
MZMinghan Zhang
Minghan Zhang
QZQi Zhao
Qi Zhao
YSYuhui Shi
Yuhui Shi
In the post-Moore era, main performance gains of black-box optimizers are increasingly depending on parallelism, especially for large-scale optimization (LSO). Here we propose to parallelize the well-established covariance matrix adaptation evolution strategy (CMA-ES) and in particular its one latest LSO variant called limited-memory CMA-ES (LM-CMA). To achieve efficiency while approximating its powerful invariance property, we present a multilevel learning-based meta-framework for distributed LM-CMA. Owing to its hierarchically organized structure, Meta-ES is well-suited to implement our distributed meta-framework, wherein the outer-ES controls strategy parameters while all parallel inner-ESs run the serial LM-CMA with different settings. For the distribution mean update of the outer-ES, both the elitist and multi-recombination strategy are used in parallel to avoid stagnation and regression, respectively. To exploit spatiotemporal information, the global step-size adaptation combines Meta-ES with the parallel cumulative step-size adaptation. After each isolation time, our meta-framework employs both the structure and parameter learning strategy to combine aligned evolution paths for CMA reconstruction. Experiments on a set of large-scale benchmarking functions with memory-intensive evaluations, arguably reflecting many data-driven optimization problems, validate the benefits (e.g., effectiveness w.r.t. solution quality, and adaptability w.r.t. second-order learning) and costs of our meta-framework.

12 September 2024 in Applied Soft Computing
Verified
Journal Article
Closed access
QDQiqi Duan
Qiqi Duan
CSChang Shao
Chang Shao
GZGuochen Zhou
Guochen Zhou
HYHaobin Yang
Haobin Yang
QZQi Zhao
Qi Zhao
YSYuhui Shi
Yuhui Shi

21 February 2024 in arXiv
Verified
Preprint
Open access
PDF file
QZQi Zhao
Qi Zhao
QDQiqi Duan
Qiqi Duan
BYBai Yan
Bai Yan
SCShi Cheng
Shi Cheng
YSYuhui Shi
Yuhui Shi
Metaheuristics have gained great success in academia and practice because their search logic can be applied to any problem with available solution representation, solution quality evaluation, and certain notions of locality. Manually designing metaheuristic algorithms for solving a target problem is criticized for being laborious, error-prone, and requiring intensive specialized knowledge. This gives rise to increasing interest in automated design of metaheuristic algorithms. With computing power to fully explore potential design choices, the automated design could reach and even surpass human-level design and could make high-performance algorithms accessible to a much wider range of researchers and practitioners. This paper presents a broad picture of automated design of metaheuristic algorithms, by conducting a survey on the common grounds and representative techniques in terms of design space, design strategies, performance evaluation strategies, and target problems in this field.

2 November 2023 in arXiv
Verified
Preprint
Open access
PDF file
QDQiqi Duan
Qiqi Duan
GZGuochen Zhou
Guochen Zhou
CSChang Shao
Chang Shao
ZWZhuowei Wang
Zhuowei Wang
MFMingyang Feng
Mingyang Feng
YSYuhui Shi
Yuhui Shi
In this paper, we present a pure-Python library called PyPop7 for black-box optimization (BBO). As population-based methods are becoming increasingly popular for BBO, our design goal is to provide a unified API and elegant implementations for them, particularly in high-dimensional cases. Since population-based methods suffer easily from the curse of dimensionality owing to their random sampling nature, various improvements have been proposed to alleviate this issue via exploiting possible problem structures: such as space decomposition, low-memory approximation, low-rank metric learning, variance reduction, ensemble of random subspaces, model self-adaptation, and smoothing. Now PyPop7 has covered these advances with $>72$ versions and variants of 13 BBO algorithm families from different research communities. Its open-source code and full-fledged documents are available at https://github.com/Evolutionary-Intelligence/pypop and https://pypop.readthedocs.io, respectively.