Improved Fitness-Dependent Optimizer Algorithm

• URL: http://arxiv.org/abs/2001.11820v1
• Date: Thu, 16 Jan 2020 21:50:11 GMT
• Title: Improved Fitness-Dependent Optimizer Algorithm
• Authors: Danial A. Muhammed, Soran AM. Saeed, Tarik A. Rashid
• Abstract summary: The fitness-dependent (FDO) algorithm was recently introduced in 2019. An improved FDO algorithm is presented in this work. To prove the practicability of the IFDO, it is used in real-world applications.
• Score: 0.9990687944474739
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: The fitness-dependent optimizer (FDO) algorithm was recently introduced in 2019. An improved FDO (IFDO) algorithm is presented in this work, and this algorithm contributes considerably to refining the ability of the original FDO to address complicated optimization problems. To improve the FDO, the IFDO calculates the alignment and cohesion and then uses these behaviors with the pace at which the FDO updates its position. Moreover, in determining the weights, the FDO uses the weight factor (wf), which is zero in most cases and one in only a few cases. Conversely, the IFDO performs wf randomization in the [0-1] range and then minimizes the range when a better fitness weight value is achieved. In this work, the IFDO algorithm and its method of converging on the optimal solution are demonstrated. Additionally, 19 classical standard test function groups are utilized to test the IFDO, and then the FDO and three other well-known algorithms, namely, the particle swarm algorithm (PSO), dragonfly algorithm (DA), and genetic algorithm (GA), are selected to evaluate the IFDO results. Furthermore, the CECC06 2019 Competition, which is the set of IEEE Congress of Evolutionary Computation benchmark test functions, is utilized to test the IFDO, and then, the FDO and three recent algorithms, namely, the salp swarm algorithm (SSA), DA and whale optimization algorithm (WOA), are chosen to gauge the IFDO results. The results show that IFDO is practical in some cases, and its results are improved in most cases. Finally, to prove the practicability of the IFDO, it is used in real-world applications.

Related papers

• Faster WIND: Accelerating Iterative Best-of-$N$ Distillation for LLM Alignment [81.84950252537618]
  This paper reveals a unified game-theoretic connection between iterative BOND and self-play alignment. We establish a novel framework, WIN rate Dominance (WIND), with a series of efficient algorithms for regularized win rate dominance optimization.
  arXiv  Detail & Related papers  (2024-10-28T04:47:39Z)
• Modified-Improved Fitness Dependent Optimizer for Complex and Engineering Problems [5.078139820108554]
  Fitness dependent (FDO) is considered one of the novel swarm intelligent algorithms. This study proposes a modified version of IFDO, called M-IFDO. M-IFDO is compared against five state-of-the-art algorithms.
  arXiv  Detail & Related papers  (2024-06-27T07:47:23Z)
• FedNAR: Federated Optimization with Normalized Annealing Regularization [54.42032094044368]
  We explore the choices of weight decay and identify that weight decay value appreciably influences the convergence of existing FL algorithms. We develop Federated optimization with Normalized Annealing Regularization (FedNAR), a plug-in that can be seamlessly integrated into any existing FL algorithms.
  arXiv  Detail & Related papers  (2023-10-04T21:11:40Z)
• Federated Conditional Stochastic Optimization [110.513884892319]
  Conditional optimization has found in a wide range of machine learning tasks, such as in-variant learning tasks, AUPRC, andAML. This paper proposes algorithms for distributed federated learning.
  arXiv  Detail & Related papers  (2023-10-04T01:47:37Z)
• GOOSE Algorithm: A Powerful Optimization Tool for Real-World Engineering Challenges and Beyond [4.939986309170004]
  The GOOSE algorithm is benchmarked on 19 well-known test functions. The proposed algorithm is tested on 10 modern benchmark functions. The achieved findings attest to the proposed algorithm's superior performance.
  arXiv  Detail & Related papers  (2023-07-19T19:14:25Z)
• Multi objective Fitness Dependent Optimizer Algorithm [19.535715565093764]
  This paper proposes the multi objective variant of the recently introduced fitness dependent (FDO) The algorithm is called a Multi objective Fitness Dependent (MOFDO) and is equipped with all five types of knowledge (situational, normative, topographical, domain, and historical knowledge) as in FDO. It is observed that the proposed algorithm successfully provides a wide variety of well-distributed feasible solutions, which enable the decision-makers to have more applicable-comfort choices to consider.
  arXiv  Detail & Related papers  (2023-01-26T06:33:53Z)
• Fitness Dependent Optimizer for IoT Healthcare using Adapted Parameters: A Case Study Implementation [0.629786844297945]
  This chapter discusses a case study on Fitness Dependentwarm or so-called FDO and adapting its parameters to the Internet of Things (IoT) healthcare. Other algorithms are evaluated and compared to FDO as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) in the original work. The target of this chapter's enhancement is to adapt the IoT healthcare framework based on FDO to spawn effective IoT healthcare applications.
  arXiv  Detail & Related papers  (2022-05-18T16:18:57Z)
• Improving RNA Secondary Structure Design using Deep Reinforcement Learning [69.63971634605797]
  We propose a new benchmark of applying reinforcement learning to RNA sequence design, in which the objective function is defined to be the free energy in the sequence's secondary structure. We show results of the ablation analysis that we do for these algorithms, as well as graphs indicating the algorithm's performance across batches.
  arXiv  Detail & Related papers  (2021-11-05T02:54:06Z)
• Chaotic Fitness Dependent Optimizer for Planning and Engineering Design [1.1802674324027231]
  Fitness Dependent (FDO) is a metaheuristic algorithm that mimics the reproduction behavior of the bee swarm in finding better hives. This paper aims at improving the performance of FDO, thus, the chaotic theory is used inside FDO to propose Chaotic FDO (CFDO) Ten chaotic maps are used in the CFDO to consider which of them are performing well to avoid local optima and finding global optima.
  arXiv  Detail & Related papers  (2021-08-21T12:14:02Z)
• Bayesian Algorithm Execution: Estimating Computable Properties of Black-box Functions Using Mutual Information [78.78486761923855]
  In many real world problems, we want to infer some property of an expensive black-box function f, given a budget of T function evaluations. We present a procedure, InfoBAX, that sequentially chooses queries that maximize mutual information with respect to the algorithm's output. On these problems, InfoBAX uses up to 500 times fewer queries to f than required by the original algorithm.
  arXiv  Detail & Related papers  (2021-04-19T17:22:11Z)
• Adaptivity of Stochastic Gradient Methods for Nonconvex Optimization [71.03797261151605]
  Adaptivity is an important yet under-studied property in modern optimization theory. Our algorithm is proved to achieve the best-available convergence for non-PL objectives simultaneously while outperforming existing algorithms for PL objectives.
  arXiv  Detail & Related papers  (2020-02-13T05:42:27Z)

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.