Abstract
Evolutionary multitask optimization (EMTO) is an emerging field focusing on solving multiple optimization tasks concurrently by sharing common knowledge. However, existing knowledge transfer mechanisms are often limited to aligned dimensions between tasks and frequently overlook correlations within the same task. This article proposes the Block-Level Knowledge Transfer (BLKT) framework to address these limitations. BLKT partitions individuals into blocks and clusters similar blocks—regardless of their task or dimension origin—to facilitate more rational knowledge transfer. Integrated with Differential Evolution (BLKT-DE), the framework demonstrates superior performance across CEC benchmarks and real-world kinematic arm control problems.
The Alignment Trap in EMTO
The primary goal of EMTO is to leverage insights from one task to accelerate the optimization of others. Despite its potential, traditional EMTO algorithms often fall into two "alignment traps":
- The Index Trap: Knowledge transfer is typically restricted to dimensions with identical indices. This assumes that dimension $i$ in Task A is inherently related to dimension $i$ in Task B, which is often not the case in complex, real-world scenarios.
- Intratask Neglect: Most frameworks focus exclusively on inter-task transfer, ignoring valuable correlations between different dimensions within a single task.
These constraints can lead to "negative transfer," where the exchange of irrelevant information hinders the optimization process.
The BLKT Framework
To overcome these hurdles, the BLKT framework introduces a more flexible, block-based approach to knowledge transfer. Instead of transferring information between whole individuals or fixed indices, BLKT operates on segments of the solution space.
The BLKT-DE algorithm follows a cyclic five-step process:
- Divide: Each individual is partitioned into multiple blocks of a specified length $B$.
- Get Block Population: Blocks from all tasks are aggregated into a single global block population.
- K-means Clustering: The algorithm groups similar blocks into $K$ clusters. This step is crucial as it identifies related dimensions dynamically, whether they belong to the same task or different ones.
- Mutation and Crossover: Evolutionary operations occur within these clusters. Since the blocks in a cluster are mathematically similar, the resulting knowledge transfer is highly relevant and effective.
- Reconstruct: Evolved blocks are reassembled into their original positions to form the next generation of individuals.
To maintain efficiency, the authors implemented a Feedback-based Adaptive Strategy (FAS) to dynamically adjust the hyperparameters $B$ (block size) and $K$ (number of clusters) based on the algorithm's performance in each generation.
Experimental Results
The BLKT-DE framework was rigorously tested against state-of-the-art algorithms on several benchmarks:
- CEC17M & CEC22M: BLKT-DE consistently outperformed competitors like MFEA-AKT and ASCMFDE.
- cMTOP: On this "compositive" suite designed specifically to test unaligned dimensions, BLKT-DE showed significant robustness, winning 19 out of 20 task comparisons.
- Real-World Scaling: In planar kinematic arm control tasks, the framework maintained peak performance as the number of tasks scaled from 2 to 100.
- Single-Task Optimization: Interestingly, BLKT-DE also proved competitive in single-task scenarios (CEC17S/22S), suggesting that treating internal problem components as "tasks" can accelerate convergence.
Conclusion
The BLKT framework represents a significant shift in evolutionary multitask optimization by prioritizing functional similarity over arbitrary indexing. By enabling both inter-task and intra-task transfer at the block level, it provides a more robust and flexible mechanism for knowledge sharing. Future research may explore non-consecutive block structures and the integration of BLKT with other metaheuristic algorithms to further broaden its applicability.
Summary updated