PaperScope
LIVE · 2026-09-07 05:40 UTC

Towards Efficient Evaluation of Evolutionary Transfer Optimization: Case Studies on Task-Parameterized Applications

Yanchen Li, Xiaoming Xue, Kay Chen Tan

Latestcs.CLcs.LGcs.AIcs.CV
arXiv ID
2609.05040 v1
Category
Submitted
2026-09-04

Abstract

As evolutionary transfer optimization (ETO) scales to larger collections of related tasks, problem evaluation can become a major source of runtime growth. This work studies problem-side evaluation scaling in task-parameterized applications and reformulates application-specific serial computations into forms suitable for parallel execution. We organize evaluation scaling into two levels: the number of evaluated tasks and the workload within each task. In multi-task optimization, matrix-recursive kinematic-arm evaluation is reformulated using an accumulation-matrix representation of cumulative link directions. In sequential transfer optimization, pointwise B-spline trajectory evaluation is reformulated using a blending-matrix representation for trajectory and collision computations. Both reformulations maintain close numerical agreement with their reference evaluations and substantially reduce runtime, yielding $256.72\times$ and $93.91\times$ end-to-end speedups, respectively. These results demonstrate problem-side reformulation as a practical route toward scalable ETO. Both application implementations and experimental scripts are released as open source to support reproducibility and reuse.

Comment: Accepted at the 2026 International Conference on Machine Intelligence and Nature-Inspired Computing (MIND 2026)

arXiv abs page · PDF · same-day batch