Evolutionary Multitask Optimization: a Methodological Overview, Challenges and Future Research Directions

• URL: http://arxiv.org/abs/2102.02558v1
• Date: Thu, 4 Feb 2021 11:48:11 GMT
• Title: Evolutionary Multitask Optimization: a Methodological Overview, Challenges and Future Research Directions
• Authors: Eneko Osaba, Aritz D. Martinez and Javier Del Ser
• Abstract summary: We consider multitasking in the context of solving multiple optimization problems simultaneously by conducting a single search process. The emerging paradigm of Evolutionary Multitasking tackles multitask optimization scenarios by using as inspiration concepts drawn from Evolutionary Computation.
• Score: 8.14509634354919
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work we consider multitasking in the context of solving multiple optimization problems simultaneously by conducting a single search process. The principal goal when dealing with this scenario is to dynamically exploit the existing complementarities among the problems (tasks) being optimized, helping each other through the exchange of valuable knowledge. Additionally, the emerging paradigm of Evolutionary Multitasking tackles multitask optimization scenarios by using as inspiration concepts drawn from Evolutionary Computation. The main purpose of this survey is to collect, organize and critically examine the abundant literature published so far in Evolutionary Multitasking, with an emphasis on the methodological patterns followed when designing new algorithmic proposals in this area (namely, multifactorial optimization and multipopulation-based multitasking). We complement our critical analysis with an identification of challenges that remain open to date, along with promising research directions that can stimulate future efforts in this topic. Our discussions held throughout this manuscript are offered to the audience as a reference of the general trajectory followed by the community working in this field in recent times, as well as a self-contained entry point for newcomers and researchers interested to join this exciting research avenue.

Related papers

• A Survey of Neural Code Intelligence: Paradigms, Advances and Beyond [84.95530356322621]
  This survey presents a systematic review of the advancements in code intelligence. It covers over 50 representative models and their variants, more than 20 categories of tasks, and an extensive coverage of over 680 related works. Building on our examination of the developmental trajectories, we further investigate the emerging synergies between code intelligence and broader machine intelligence.
  arXiv  Detail & Related papers  (2024-03-21T08:54:56Z)
• Sample Efficient Myopic Exploration Through Multitask Reinforcement Learning with Diverse Tasks [53.44714413181162]
  This paper shows that when an agent is trained on a sufficiently diverse set of tasks, a generic policy-sharing algorithm with myopic exploration design can be sample-efficient. To the best of our knowledge, this is the first theoretical demonstration of the "exploration benefits" of MTRL.
  arXiv  Detail & Related papers  (2024-03-03T22:57:44Z)
• Large Multimodal Agents: A Survey [78.81459893884737]
  Large language models (LLMs) have achieved superior performance in powering text-based AI agents. There is an emerging research trend focused on extending these LLM-powered AI agents into the multimodal domain. This review aims to provide valuable insights and guidelines for future research in this rapidly evolving field.
  arXiv  Detail & Related papers  (2024-02-23T06:04:23Z)
• Towards Multi-Objective High-Dimensional Feature Selection via Evolutionary Multitasking [63.91518180604101]
  This paper develops a novel EMT framework for high-dimensional feature selection problems, namely MO-FSEMT. A task-specific knowledge transfer mechanism is designed to leverage the advantage information of each task, enabling the discovery and effective transmission of high-quality solutions.
  arXiv  Detail & Related papers  (2024-01-03T06:34:39Z)
• In Defense of the Unitary Scalarization for Deep Multi-Task Learning [121.76421174107463]
  We present a theoretical analysis suggesting that many specialized multi-tasks can be interpreted as forms of regularization. We show that, when coupled with standard regularization and stabilization techniques, unitary scalarization matches or improves upon the performance of complex multitasks.
  arXiv  Detail & Related papers  (2022-01-11T18:44:17Z)
• Evolutionary Multitask Optimization: Fundamental Research Questions, Practices, and Directions for the Future [10.330156481082698]
  This communication aims to engage the readership around a reflection on these issues, and to provide rationale why they remain unsolved. Specifically, we emphasize on three critical points of Evolutionary Multitasking Optimization. As a result of this research, we conclude that some important efforts should be directed by the community in order to keep the future of this promising field on the right track.
  arXiv  Detail & Related papers  (2021-11-29T11:23:51Z)
• Multi-Task Learning with Sequence-Conditioned Transporter Networks [67.57293592529517]
  We aim to solve multi-task learning through the lens of sequence-conditioning and weighted sampling. We propose a new suite of benchmark aimed at compositional tasks, MultiRavens, which allows defining custom task combinations. Second, we propose a vision-based end-to-end system architecture, Sequence-Conditioned Transporter Networks, which augments Goal-Conditioned Transporter Networks with sequence-conditioning and weighted sampling.
  arXiv  Detail & Related papers  (2021-09-15T21:19:11Z)
• A Coevolutionary Variable Neighborhood Search Algorithm for Discrete Multitasking (CoVNS): Application to Community Detection over Graphs [8.525387045951776]
  This paper is focused on Evolutionary Multitasking, which is a perspective for dealing with multitasking optimization scenarios. We present a new multitasking approach named as Coevolutionary Variable Neighborhood Search Algorithm, which finds its inspiration on both the Variable Neighborhood Search metaheuristic and coevolutionary strategies. Results obtained by our method are compared to those issued by a parallel Variable Neighborhood Search and independent executions of the basic Variable Neighborhood Search.
  arXiv  Detail & Related papers  (2020-09-30T07:26:43Z)
• On the Transferability of Knowledge among Vehicle Routing Problems by using Cellular Evolutionary Multitasking [6.943742860591444]
  This work is focused on the application of the recently proposed Multifactorial Cellular Genetic Algorithm (MFCGA) to the Capacitated Vehicle Routing Problem (CVRP) The contribution of this research is twofold. On the one hand, it is the first application of the MFCGA to the Vehicle Routing Problem family of problems. On the other hand, equally interesting is the second contribution, which is focused on the quantitative analysis of the positive genetic transferability among the problem instances.
  arXiv  Detail & Related papers  (2020-05-11T12:58:00Z)
• COEBA: A Coevolutionary Bat Algorithm for Discrete Evolutionary Multitasking [9.54239662772307]
  We propose a novel algorithmic scheme for dealing with multitasking environments. The proposed approach, coined as Coevolutionary Bat Algorithm, finds its inspiration in concepts from both co-evolutionary strategies and the metaheuristic Bat Algorithm.
  arXiv  Detail & Related papers  (2020-03-24T13:37:43Z)
• Multifactorial Cellular Genetic Algorithm (MFCGA): Algorithmic Design, Performance Comparison and Genetic Transferability Analysis [17.120962133525225]
  Multiobjective optimization is an incipient research area which is lately gaining a notable research momentum. In this work we propose a novel algorithmic scheme for Multifactorial Optimization scenarios. The proposed MFCGA hinges on concepts from Cellular Automata to implement mechanisms for exchanging knowledge among problems.
  arXiv  Detail & Related papers  (2020-03-24T11:03:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.