Papers
Topics
Authors
Recent
Search
2000 character limit reached

First Mathematical Runtime Analyses of Evolutionary Multitask Multi-Objective Optimization

Published 15 Oct 2026 in cs.NE | (2610.21311v1)

Abstract: To facilitate the solving of complex problems, evolutionary multitask optimization is regarded as a promising technique due to its capacity for cross-task knowledge transfer. In contrast to empirical evidences, no mathematical runtime support exists for this technique within the domain of multi-objective optimization. In this work, we aim to fill this important gap. We analyze how the representative multiobjective multifactorial evolutionary algorithm (MO-MFEA) covers the Pareto fronts of two bi-objective problems simultaneously. For the two-task problem of maximizing the classic bi-objective OMM and the multimodal OJZJ benchmarks, the MO-MFEA requires only an expected runtime of O(n2log⁡n)O(n^2 \log n)---the same as optimizing the simple OMM alone---yet achieves a speedup by a factor of Θ(nk−1/log⁡n)Θ(n^{k-1}/\log n) compared to optimizing OJZJ alone (with gap size kk). Similarly, for the task pair comprising the classic LOTZ and the multimodal DLTB benchmarks, a speedup of Θ(n)Θ(n) is attained over optimizing DLTB alone, while the runtime matches that of optimizing LOTZ alone.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.