Automated Design of Metaheuristic Algorithms: A Survey

• URL: http://arxiv.org/abs/2303.06532v3
• Date: Wed, 21 Feb 2024 08:15:58 GMT
• Title: Automated Design of Metaheuristic Algorithms: A Survey
• Authors: Qi Zhao, Qiqi Duan, Bai Yan, Shi Cheng, Yuhui Shi
• Abstract summary: This paper presents a broad picture of automated design of metaheuristic algorithms. With computing power to fully explore potential design choices, the automated design could reach and even surpass human-level design.
• Score: 16.5686507795359
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Metaheuristics have gained great success in academia and practice because their search logic can be applied to any problem with available solution representation, solution quality evaluation, and certain notions of locality. Manually designing metaheuristic algorithms for solving a target problem is criticized for being laborious, error-prone, and requiring intensive specialized knowledge. This gives rise to increasing interest in automated design of metaheuristic algorithms. With computing power to fully explore potential design choices, the automated design could reach and even surpass human-level design and could make high-performance algorithms accessible to a much wider range of researchers and practitioners. This paper presents a broad picture of automated design of metaheuristic algorithms, by conducting a survey on the common grounds and representative techniques in terms of design space, design strategies, performance evaluation strategies, and target problems in this field.

Related papers

• Contractual Reinforcement Learning: Pulling Arms with Invisible Hands [68.77645200579181]
  We propose a theoretical framework for aligning economic interests of different stakeholders in the online learning problems through contract design. For the planning problem, we design an efficient dynamic programming algorithm to determine the optimal contracts against the far-sighted agent. For the learning problem, we introduce a generic design of no-regret learning algorithms to untangle the challenges from robust design of contracts to the balance of exploration and exploitation.
  arXiv  Detail & Related papers  (2024-07-01T16:53:00Z)
• A Survey of Meta-features Used for Automated Selection of Algorithms for Black-box Single-objective Continuous Optimization [4.173197621837912]
  We conduct an overview of the key contributions to algorithm selection in the field of single-objective continuous black-box optimization. We study machine learning models for automated algorithm selection, configuration, and performance prediction.
  arXiv  Detail & Related papers  (2024-06-08T11:11:14Z)
• Automated Metaheuristic Algorithm Design with Autoregressive Learning [25.967262411437403]
  Current automated methods design algorithms within a fixed structure and operate from scratch. This paper proposes an autoregressive learning-based designer for automated design of metaheuristic algorithms.
  arXiv  Detail & Related papers  (2024-05-06T12:36:17Z)
• Interactive Multi-Objective Evolutionary Optimization of Software Architectures [0.0]
  Putting the human in the loop brings new challenges to the search-based software engineering field. This paper explores how the interactive evolutionary computation can serve as a basis for integrating the human's judgment into the search process.
  arXiv  Detail & Related papers  (2024-01-08T19:15:40Z)
• Discovering General Reinforcement Learning Algorithms with Adversarial Environment Design [54.39859618450935]
  We show that it is possible to meta-learn update rules, with the hope of discovering algorithms that can perform well on a wide range of RL tasks. Despite impressive initial results from algorithms such as Learned Policy Gradient (LPG), there remains a gap when these algorithms are applied to unseen environments. In this work, we examine how characteristics of the meta-supervised-training distribution impact the performance of these algorithms.
  arXiv  Detail & Related papers  (2023-10-04T12:52:56Z)
• Introducing Interactions in Multi-Objective Optimization of Software Architectures [3.483484684588142]
  This study investigates the impact of designer interactions on software architecture optimization. By directing the search towards regions of interest, the interaction uncovers architectures that remain unexplored in the fully automated process.
  arXiv  Detail & Related papers  (2023-08-29T07:49:46Z)
• Computation-efficient Deep Learning for Computer Vision: A Survey [121.84121397440337]
  Deep learning models have reached or even exceeded human-level performance in a range of visual perception tasks. Deep learning models usually demand significant computational resources, leading to impractical power consumption, latency, or carbon emissions in real-world scenarios. New research focus is computationally efficient deep learning, which strives to achieve satisfactory performance while minimizing the computational cost during inference.
  arXiv  Detail & Related papers  (2023-08-27T03:55:28Z)
• Design Automation for Fast, Lightweight, and Effective Deep Learning Models: A Survey [53.258091735278875]
  This survey covers studies of design automation techniques for deep learning models targeting edge computing. It offers an overview and comparison of key metrics that are used commonly to quantify the proficiency of models in terms of effectiveness, lightness, and computational costs. The survey proceeds to cover three categories of the state-of-the-art of deep model design automation techniques.
  arXiv  Detail & Related papers  (2022-08-22T12:12:43Z)
• Investigating Positive and Negative Qualities of Human-in-the-Loop Optimization for Designing Interaction Techniques [55.492211642128446]
  Designers reportedly struggle with design optimization tasks where they are asked to find a combination of design parameters that maximizes a given set of objectives. Model-based computational design algorithms assist designers by generating design examples during design. Black box methods for assistance, on the other hand, can work with any design problem.
  arXiv  Detail & Related papers  (2022-04-15T20:40:43Z)
• AutoOpt: A General Framework for Automatically Designing Metaheuristic Optimization Algorithms with Diverse Structures [15.140309031326076]
  This paper proposes a general framework, AutoOpt, for automatically designing metaheuristic algorithms with diverse structures. A general algorithm prototype dedicated to covering the metaheuristic family as widely as possible. A directed acyclic graph algorithm representation to fit the proposed prototype. A graph representation embedding method offering an alternative compact form of the graph to be manipulated.
  arXiv  Detail & Related papers  (2022-04-03T05:31:56Z)
• A Brief Look at Generalization in Visual Meta-Reinforcement Learning [56.50123642237106]
  We evaluate the generalization performance of meta-reinforcement learning algorithms. We find that these algorithms can display strong overfitting when they are evaluated on challenging tasks.
  arXiv  Detail & Related papers  (2020-06-12T15:17:17Z)

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.