- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper studies multi-objective multi-task optimization (MO-MTO) and proposes RL-EMT-MSKT, which controls local manifold transfer at the offspring level. The core idea is to treat the task-specific knowledge-transfer probability (KTP) as a sequential decision variable. A shared PPO-based policy, with a Cross-Task Relation Encoder (CTRE), selects multiplicative KTP updates from a small discrete action set. The updated KTP then decides whether each parent generates a local offspring through Local Structure Learning (LSL) or through an adaptive differential evolution (ADE) fallback. The reward combines population-level SPEA2 fitness improvement with operator-specific survival feedback comparing LSL and ADE offspring. The method is evaluated on the CEC21-MTMO-CPLX benchmark with ten two-task problems, 30 independent runs, seven MO-MTO comparators, IGD and normalized HV metrics, statistical tests, KTP trajectory plots, and ablation variants. The paper claims improved solution quality, statistically significant wins over comparators, and useful contributions from both learned KTP control and ADE.
Critical strengths
-
Coupling the transfer probability with offspring-level operator selection and feeding survival outcomes back into the policy is a reasonable way to address negative transfer in manifold-based MO-MTO. If the learned policy actually produced task-specific transfer schedules, this would be a meaningful contribution beyond fixed or heuristic transfer probabilities.
-
The paper reports 20 task-level evaluations, 30 runs per task, seven MO-MTO baselines, two metrics, statistical comparisons, KTP trajectories, and ablation variants. This gives the reader enough material to see where the method helps and where it does not, even though the presentation has serious problems.
-
The reward design is concrete and reusable. Combining a normalized population-quality term with an operator-survival term is a practical way to credit transfer decisions at the offspring level. This is a better-motivated design than using only final population quality, and it could be adapted to other adaptive transfer operators.
Critical weaknesses
-
The central claim of adaptive task-specific transfer control is not well supported by the learned behavior. Figure 6 shows KTP trajectories collapsing to the lower bound of 0.05 on essentially all problems, which means LSL is selected only rarely after the early generations. In that regime the policy is mostly learning to suppress LSL and rely on ADE, not to produce a rich task-specific transfer schedule. This matters because the paper’s first two contributions are precisely the learned KTP policy and the cross-task relation encoder. In addition, with two tasks and the self-mask in Eq. (5), the CTRE attention reduces to a deterministic counterpart exchange. So the “relation encoder” is not learning a relation beyond a swap/concatenation. The paper needs to show that the policy is doing more than falling back to ADE.
-
The policy is trained on 300 augmented two-task instances generated from the same ten CEC21-MTMO-CPLX problems and then evaluated on the unperturbed official versions of those same problems. There is no disjoint problem family, no more-than-two-task setting, and no real-world case. The paper itself notes this limitation, but the main claims are still stated broadly. For a strict venue, the gap between “trained on perturbations of the test family” and “general adaptive transfer control” needs to be narrowed with additional evidence.
-
The main text describes an 11-dimensional task state, but Appendix Table 4 lists more components and contains typographical errors. Several details needed to reproduce the method are missing or scattered, including the feedback-window length, LPCA validity conditions, normalization constants, and the exact treatment of invalid manifold models. The ablation is reported mainly as average task-level IGD rank, without per-task statistics or a clear fixed-KTP baseline in the main paper. Runtime overhead for policy inference and manifold modeling is also not reported, which matters for an evolutionary algorithm paper.
Questions for authors
-
Can you quantify the actual LSL selection rate after the first few hundred generations, and provide a fixed-KTP or no-LSL ablation with per-task IGD/HV statistics?
-
The main text and Appendix E.2 disagree on the number of significant IGD wins against comparators, and Table 3 is incomplete. Can you provide clean full IGD/HV tables with corrected win/loss/tie counts, and state clearly whether the tests are Wilcoxon or Mann–Whitney, with or without Holm correction?
-
Given Eq. (5) and the two-task self-masked attention, CTRE reduces to a deterministic counterpart exchange. What is learned by CTRE beyond this swap? Can you provide an ablation that removes CTRE or replaces it with simple concatenation of the two task embeddings?
-
The policy is trained on augmented variants of the same ten official problems and tested on the unperturbed versions. How do you rule out benchmark-specific overfitting? Would the method still hold on a disjoint problem family or a setting with more than two tasks, and what is the wall-clock overhead of policy inference plus manifold modeling?
6 comments
2. Degeneracy of CTRE and the contribution of cross-task feature fusion [W1 / Q3 (partial)]
The reviewer questions whether self-masked CTRE performs learned task-relation modeling beyond swapping two task representations.
W1 (CTRE aspect): Two-task self-masked attention collapses to deterministic counterpart exchange and does not learn attention weights.
Q3 (partial): What is learned beyond this exchange, and can the module be removed or compared with simple concatenation?
We have further examined the original formulation and confirm that, with only one admissible counterpart for each target task, self-masked attention assigns a fixed weight of one to the counterpart after Softmax normalization. Consequently, the query-key similarity scores do not affect the resulting feature exchange.
Based on this observation, we have reformulated CTRE as Cross-Task Feature Fusion (CTFF) in Section 3.3 and Appendix B.2. The revised formulation directly exchanges counterpart features using a fixed permutation matrix, eliminating redundant query-key computations while retaining the learnable feature projection, residual connections, and nonlinear fusion transformations.
Thus, the counterpart exchange pattern is deterministic in the current two-task setting, while the feature representations and subsequent fusion transformations remain learnable. The resulting representations incorporate runtime information from both tasks and are used by the shared actor to produce task-specific KTP adjustments.
Furthermore, Table 8 includes an ablation that removes CTFF. The RL-EMT-MSKT achieves an average IGD rank of 2.75, compared with 3.35 without cross-task feature fusion. This result provides empirical support for the contribution of the fusion module to overall optimization performance in the evaluated setting.
These revisions clarify the actual computation performed by the cross-task module and more precisely characterize its role within the RL-based KTP controller.
3. Training and evaluation independence and policy generalization [W2 / Q4 (generalization)]
The reviewer raises concerns about template overlap between training and testing and benchmark-specific overfitting.
W2: Training and testing use the same underlying CEC21-MTMO-CPLX templates, limiting claims about broad generalization.
Q4 (generalization, partial): What evidence addresses benchmark-specific overfitting, and would the policy transfer to disjoint problem families or more than two tasks?
To address the overlap between the underlying templates used for training and evaluation in the original protocol, we introduced a held-out-template experiment in Section 4.4 and Appendix F.1. Specifically, we train a separate policy using only P1–P5, with 20 augmented instances per problem, yielding 100 training instances. P6–P10 and all their augmented variants are entirely excluded from training. After training, the policy parameters are frozen and evaluated directly on the ten held-out tasks corresponding to P6–P10, with 30 independent evaluation runs per algorithm.
The held-out policy achieves the lowest mean IGD on six of the ten tasks and the highest mean normalized HV on five tasks. Against EMT-MSKT, the Holm-corrected W/L/NS counts are 7/1/2 for both metrics. Furthermore, compared with the remaining six representative MO-MTO algorithms, the held-out policy achieves 6 to 9 significant wins per comparator for each metric. Complete results are reported in Tables 10 and 11.
These results demonstrate that the learned policy remains competitive on previously unseen problem configurations, even when the corresponding templates and their augmented variants are entirely unseen during training. These provide evidence of policy generalization across problem configurations within the evaluated MO-MTO benchmark.
Main-comparison and holdout training and evaluation protocols.
| Setting | Main comparison | Holdout evaluation |
|---|---|---|
| Training problems | P1–P10 | P1–P5 |
| Instances per training problem | 30 | 20 |
| Training instances / episodes | 300 / 300 | 100 / 100 |
| Official test problems | P1–P10 | P6–P10 |
| Test tasks | 20 | 10 |
| Evaluation runs per method | 30 | 30 |
| Policy updates during testing | None | None |
1. Declining KTP trajectories and the contribution of LSL [W1 / Q1 (partial)]
We thank the reviewer for the observation regarding the learned KTP trajectories. We agree that declining KTP values alone are insufficient to fully characterize the contribution of local manifold transfer.
W1: KTP approaches 0.05 on many tasks, raising concerns that the learned policy largely suppresses LSL in favor of ADE.
Q1 (partial): What is the actual later-stage LSL selection rate, and what do fixed-KTP or no-LSL per-task IGD/HV ablations show?
To further investigate this issue, we have extended the ablation study in Table 8 by comparing the RL-EMT-MSKT with other versions with fixed KTP values of 0, 0.05, and 0.5, together with a predefined KTP decay schedule.
The results show that the RL-EMT-MSKT achieves the best average IGD rank of 2.75, outperforming fixed KTP = 0.5 (3.65), fixed KTP = 0.05 (4.05), fixed KTP = 0 (5.50), and the predefined decay schedule (3.60).In particular, fixed KTP = 0 completely disables LSL selection while retaining the independent GSL mechanism. Its inferior average IGD rank suggests that allowing LSL to participate in offspring generation contributes positively to the overall performance under the evaluated settings. Furthermore, the full method outperforms both the fixed low-KTP configuration and the predefined decay schedule, indicating that its performance advantage cannot be explained solely by a low final KTP value.
Importantly, KTP represents the probability of selecting LSL, while actual LSL execution also depends on the validity of the required LPCA models. GSL continues to operate independently of KTP. Therefore, the learned KTP trajectories should be interpreted together with the operator execution conditions and controlled ablation results.
These findings provide further empirical support for learned dynamic KTP control and show that neither completely disabling LSL nor maintaining a fixed low transfer probability achieves the same overall performance as the RL-EMT-MSKT.
Table 8. Average IGD ranks of the seven selected variants on CEC21-MTMO-CPLX. Lower ranks indicate better performance.