Resolving the Exploration-Exploitation Dilemma in Evolutionary Algorithms: A Novel Human-Centered Framework

• URL: http://arxiv.org/abs/2501.02153v1
• Date: Sat, 04 Jan 2025 01:06:46 GMT
• Title: Resolving the Exploration-Exploitation Dilemma in Evolutionary Algorithms: A Novel Human-Centered Framework
• Authors: Ehsan Shams,
• Abstract summary: A new human-centered framework is proposed to resolve the so-called exploration-exploitation dilemma. Unlike the traditional approach, the search process will not be compromised of a single-phase. We demonstrate its effectiveness on 14 well-known benchmark problems in unconstrained optimization.
• Score: 0.0
• License:
• Abstract: Evolutionary Algorithms (EAs) are powerful tools for tackling complex computational problems, yet effectively managing the exploitation and exploration dynamics -- crucial for robust search navigation -- remains a persistent challenge for EA designers, and leads to the so-called exploration-exploitation dilemma. In this paper, a new human-centered framework is proposed to resolve this dilemma. Unlike the traditional approach, the search process will not be compromised of a single-phase nor the decision-maker tuning efforts will be distributed among the algorithm's traditional parameters such as defining new evolutionary operators internal to the algorithm to influence its search navigation. Instead, a human-centered two-phase search process, compromised of a global search phase followed by a local phase will be utilized. In this framework, the designer plays the central role in directing the algorithm's search navigation through the focused tuning efforts of a new Search Space Size Control parameter external to the algorithm which proves itself to be the dominant parameter in-effect to the algorithm's effective search navigation. The framework is applicable to any search algorithm. We demonstrate its effectiveness on 14 well-known benchmark problems in unconstrained optimization.

Related papers

• Discovering new robust local search algorithms with neuro-evolution [0.9786690381850356]
  This paper explores a novel approach aimed at overcoming existing challenges in the realm of local search algorithms. Our aim is to improve the decision process that takes place within a local search algorithm so as to make the best possible transitions in the neighborhood at each iteration. This approach offers a promising avenue for the emergence of new local search algorithms and the improvement of their problem-solving capabilities for black-box problems.
  arXiv  Detail & Related papers  (2025-01-08T10:31:16Z)
• Deep Reinforcement Learning for Online Optimal Execution Strategies [49.1574468325115]
  This paper tackles the challenge of learning non-Markovian optimal execution strategies in dynamic financial markets. We introduce a novel actor-critic algorithm based on Deep Deterministic Policy Gradient (DDPG) We show that our algorithm successfully approximates the optimal execution strategy.
  arXiv  Detail & Related papers  (2024-10-17T12:38:08Z)
• An Improved Artificial Fish Swarm Algorithm for Solving the Problem of Investigation Path Planning [8.725702964289479]
  We propose a chaotic artificial fish swarm algorithm based on multiple population differential evolution (DE-CAFSA) We incorporate adaptive field of view and step size adjustments, replace random behavior with the 2-opt operation, and introduce chaos theory and sub-optimal solutions. Experimental results demonstrate that DE-CAFSA outperforms other algorithms on various public datasets of different sizes.
  arXiv  Detail & Related papers  (2023-10-20T09:35:51Z)
• 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)
• PSDiff: Diffusion Model for Person Search with Iterative and Collaborative Refinement [59.6260680005195]
  We present a novel Person Search framework based on the Diffusion model, PSDiff. PSDiff formulates the person search as a dual denoising process from noisy boxes and ReID embeddings to ground truths. Following the new paradigm, we further design a new Collaborative Denoising Layer (CDL) to optimize detection and ReID sub-tasks in an iterative and collaborative way.
  arXiv  Detail & Related papers  (2023-09-20T08:16:39Z)
• Neural Algorithmic Reasoning Without Intermediate Supervision [21.852775399735005]
  We focus on learning neural algorithmic reasoning only from the input-output pairs without appealing to the intermediate supervision. We build a self-supervised objective that can regularise intermediate computations of the model without access to the algorithm trajectory. We demonstrate that our approach is competitive to its trajectory-supervised counterpart on tasks from the CLRSic Algorithmic Reasoning Benchmark.
  arXiv  Detail & Related papers  (2023-06-23T09:57:44Z)
• VNE Strategy based on Chaotic Hybrid Flower Pollination Algorithm Considering Multi-criteria Decision Making [12.361459296815559]
  Design strategy of hybrid flower pollination algorithm for Virtual Network Embedding (VNE) problem is discussed. Cross operation is used to replace the cross-pollination operation to complete the global search. Life cycle mechanism is introduced as a complement to the traditional fitness-based selection strategy.
  arXiv  Detail & Related papers  (2022-02-07T00:57:00Z)
• Exploring Complicated Search Spaces with Interleaving-Free Sampling [127.07551427957362]
  In this paper, we build the search algorithm upon a complicated search space with long-distance connections. We present a simple yet effective algorithm named textbfIF-NAS, where we perform a periodic sampling strategy to construct different sub-networks. In the proposed search space, IF-NAS outperform both random sampling and previous weight-sharing search algorithms by a significant margin.
  arXiv  Detail & Related papers  (2021-12-05T06:42:48Z)
• An Overview and Experimental Study of Learning-based Optimization Algorithms for Vehicle Routing Problem [49.04543375851723]
  Vehicle routing problem (VRP) is a typical discrete optimization problem. Many studies consider learning-based optimization algorithms to solve VRP. This paper reviews recent advances in this field and divides relevant approaches into end-to-end approaches and step-by-step approaches.
  arXiv  Detail & Related papers  (2021-07-15T02:13:03Z)
• A Meta-Heuristic Search Algorithm based on Infrasonic Mating Displays in Peafowls [0.0]
  Simplistic methods such as exhaustive search become computationally expensive and unreliable as the solution space for search algorithms increase. This research proposes an Infrasonic Search Algorithm, inspired from the Gravitational Search Algorithm and the mating behaviour in peafowls.
  arXiv  Detail & Related papers  (2021-06-28T09:04:51Z)
• AutoSpace: Neural Architecture Search with Less Human Interference [84.42680793945007]
  Current neural architecture search (NAS) algorithms still require expert knowledge and effort to design a search space for network construction. We propose a novel differentiable evolutionary framework named AutoSpace, which evolves the search space to an optimal one. With the learned search space, the performance of recent NAS algorithms can be improved significantly compared with using previously manually designed spaces.
  arXiv  Detail & Related papers  (2021-03-22T13:28:56Z)

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.