An Improved FOX Optimization Algorithm Using Adaptive Exploration and Exploitation for Global Optimization

• URL: http://arxiv.org/abs/2504.09574v2
• Date: Sat, 20 Sep 2025 15:25:46 GMT
• Title: An Improved FOX Optimization Algorithm Using Adaptive Exploration and Exploitation for Global Optimization
• Abstract summary: This paper introduces an improved variation of the FOX optimization algorithm (FOX)<n>It incorporates a new adaptive method using a dynamically scaled step-size parameter to balance exploration and exploitation.<n>The experimental results showed that IFOX achieved a 40% improvement in overall performance metrics over the original FOX.
• Score: 3.88465206388773
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Optimization algorithms are essential for solving many real-world problems. However, challenges such as getting trapped in local minima and effectively balancing exploration and exploitation often limit their performance. This paper introduces an improved variation of the FOX optimization algorithm (FOX), termed Improved FOX (IFOX), incorporating a new adaptive method using a dynamically scaled step-size parameter to balance exploration and exploitation based on the current solution's fitness value. The proposed IFOX also reduces the number of hyperparameters by removing four parameters (C1, C2, a, Mint) and refines the primary equations of FOX. To evaluate its performance, IFOX was tested on 20 classical benchmark functions, 61 benchmark test functions from the congress on evolutionary computation (CEC), and ten real-world problems. The experimental results showed that IFOX achieved a 40% improvement in overall performance metrics over the original FOX. Additionally, it achieved 880 wins, 228 ties, and 348 losses against 16 optimization algorithms across all involved functions and problems. Furthermore, non-parametric statistical tests, including the Friedman and Wilcoxon signed-rank tests, confirmed its competitiveness against recent and state-of-the-art optimization algorithms, such as LSHADE and NRO, with an average rank of 5.92 among 17 algorithms. These findings highlight the significant potential of IFOX for solving diverse optimization problems, establishing it as a competitive and effective optimization algorithm.

Related papers

• Towards Robust Scaling Laws for Optimizers [89.21160945066737]
  Empirical scaling laws are widely used to predict loss as model size and training data grow.<n>We show that Chinchilla-style scaling laws emerge naturally as a result of loss decomposition into irreducible, approximation, and optimization errors.
  arXiv  Detail & Related papers  (2026-02-07T21:40:33Z)
• A multi-strategy improved gazelle optimization algorithm for solving numerical optimization and engineering applications [0.09320657506524145]
  This paper proposes a multi-strategy improved gazelle optimization algorithm (MSIGOA)<n>Two adaptive parameter tuning strategies improve the applicability of the algorithm and promote a smoother optimization process.<n>The dominant population-based restart strategy enhances the algorithms ability to escape from local optima and avoid its premature convergence.
  arXiv  Detail & Related papers  (2025-09-08T20:44:15Z)
• Scalable Min-Max Optimization via Primal-Dual Exact Pareto Optimization [66.51747366239299]
  We propose a smooth variant of the min-max problem based on the augmented Lagrangian. The proposed algorithm scales better with the number of objectives than subgradient-based strategies.
  arXiv  Detail & Related papers  (2025-03-16T11:05:51Z)
• Modified FOX Optimizer for Solving optimization problems [0.0]
  This study proposes a modified FOX (mFOX) to enhance exploration and balance exploration and exploitation.<n>The mFOX algorithm's performance is evaluated against 12 well-known algorithms on 23 classical benchmark functions.<n>mFOX effectively addresses four engineering problems, including unimodal, constrained, and high-dimensional problems.
  arXiv  Detail & Related papers  (2025-02-27T12:11:05Z)
• Foxtsage vs. Adam: Revolution or Evolution in Optimization? [4.939986309170004]
  This study introduces Foxtsage, a novel hybrid optimisation approach that integrates the Hybrid FOX-TSA with Gradient Descent for training Multi-Layer Perceptron models.<n> Experimental results demonstrate that Foxtsage achieves a 42.03% reduction in loss mean (Foxtsage: 9.508, Adam: 16.402) and a 42.19% improvement in loss standard deviation (Foxtsage: 20.86, Adam: 36.085)
  arXiv  Detail & Related papers  (2024-12-20T03:20:58Z)
• Provably Faster Algorithms for Bilevel Optimization via Without-Replacement Sampling [96.47086913559289]
  gradient-based algorithms are widely used in bilevel optimization. We introduce a without-replacement sampling based algorithm which achieves a faster convergence rate. We validate our algorithms over both synthetic and real-world applications.
  arXiv  Detail & Related papers  (2024-11-07T17:05:31Z)
• A Problem-Oriented Perspective and Anchor Verification for Code Optimization [43.28045750932116]
  Large language models (LLMs) have shown remarkable capabilities in solving various programming tasks.<n>This paper investigates the capabilities of LLMs in optimizing code for minimal execution time.
  arXiv  Detail & Related papers  (2024-06-17T16:10:10Z)
• An Enhanced Grey Wolf Optimizer with Elite Inheritance and Balance Search Mechanisms [13.754649370512924]
  The Grey Wolf (GWO) is recognized as a novel meta-heuristic algorithm inspired by the social leadership hierarchy and hunting mechanism of grey wolves. In the original GWO, there are two significant flaws in its fundamental optimization mechanisms. An enhanced Grey Wolf with Elite Inheritance Mechanism and Balance Search Mechanism is proposed.
  arXiv  Detail & Related papers  (2024-04-09T03:28:00Z)
• Restricted Global Optimization for QAOA [0.0]
  We show that local optimization methods are inherently inadequate within the complex cost landscape of QAOA. Instead, global optimization techniques greatly improve QAOA's performance across diverse problem instances.
  arXiv  Detail & Related papers  (2023-09-21T15:47:07Z)
• VeLO: Training Versatile Learned Optimizers by Scaling Up [67.90237498659397]
  We leverage the same scaling approach behind the success of deep learning to learn versatiles. We train an ingest for deep learning which is itself a small neural network that ingests and outputs parameter updates. We open source our learned, meta-training code, the associated train test data, and an extensive benchmark suite with baselines at velo-code.io.
  arXiv  Detail & Related papers  (2022-11-17T18:39:07Z)
• Adaptive Federated Minimax Optimization with Lower Complexities [82.51223883622552]
  We propose an efficient adaptive minimax optimization algorithm (i.e., AdaFGDA) to solve these minimax problems. It builds our momentum-based reduced and localSGD techniques, and it flexibly incorporate various adaptive learning rates.
  arXiv  Detail & Related papers  (2022-11-14T12:32:18Z)
• pysamoo: Surrogate-Assisted Multi-Objective Optimization in Python [7.8140593450932965]
  pysamoo is a proposed framework for solving computationally expensive optimization problems. pysamoo provides multiple optimization methods for handling problems involving time-consuming evaluation functions. For more information about pysamoo, readers are encouraged to visit: anyoptimization.com/projects/pysamoo.
  arXiv  Detail & Related papers  (2022-04-12T14:55:57Z)
• Optimum-statistical Collaboration Towards General and Efficient Black-box Optimization [23.359363844344408]
  We introduce an algorithm framework of managing the interaction between optimization error flux and statistical error flux evolving in the optimization process. Our framework and its analysis can be applied to a large family of functions and partitions that satisfy different local smoothness assumptions. In theory, we prove the algorithm enjoys rate-optimal regret bounds under different local smoothness assumptions.
  arXiv  Detail & Related papers  (2021-06-17T02:37:39Z)
• Provably Faster Algorithms for Bilevel Optimization [54.83583213812667]
  Bilevel optimization has been widely applied in many important machine learning applications. We propose two new algorithms for bilevel optimization. We show that both algorithms achieve the complexity of $mathcalO(epsilon-1.5)$, which outperforms all existing algorithms by the order of magnitude.
  arXiv  Detail & Related papers  (2021-06-08T21:05:30Z)
• Dynamic Cat Swarm Optimization Algorithm for Backboard Wiring Problem [0.9990687944474739]
  This paper presents a powerful swarm intelligence meta-heuristic optimization algorithm called Dynamic Cat Swarm Optimization. The proposed algorithm suggests a new method to provide a proper balance between these phases by modifying the selection scheme and the seeking mode of the algorithm. optimization results show the effectiveness of the proposed algorithm, which ranks first compared to several well-known algorithms available in the literature.
  arXiv  Detail & Related papers  (2021-04-27T19:41:27Z)
• Optimizing Large-Scale Hyperparameters via Automated Learning Algorithm [97.66038345864095]
  We propose a new hyperparameter optimization method with zeroth-order hyper-gradients (HOZOG) Specifically, we first formulate hyperparameter optimization as an A-based constrained optimization problem. Then, we use the average zeroth-order hyper-gradients to update hyper parameters.
  arXiv  Detail & Related papers  (2021-02-17T21:03:05Z)
• The Archerfish Hunting Optimizer: a novel metaheuristic algorithm for global optimization [0.8315801422499861]
  Global optimization solves real-world problems numerically or analytically by minimizing their objective functions. We propose a global metahistic algorithm based on the Archerfish Hunting (AHO)
  arXiv  Detail & Related papers  (2021-02-03T16:22:31Z)
• Recent Theoretical Advances in Non-Convex Optimization [56.88981258425256]
  Motivated by recent increased interest in analysis of optimization algorithms for non- optimization in deep networks and other problems in data, we give an overview of recent results of theoretical optimization algorithms for non- optimization.
  arXiv  Detail & Related papers  (2020-12-11T08:28:51Z)
• Convergence of adaptive algorithms for weakly convex constrained optimization [59.36386973876765]
  We prove the $mathcaltilde O(t-1/4)$ rate of convergence for the norm of the gradient of Moreau envelope. Our analysis works with mini-batch size of $1$, constant first and second order moment parameters, and possibly smooth optimization domains.
  arXiv  Detail & Related papers  (2020-06-11T17:43:19Z)
• Self-Directed Online Machine Learning for Topology Optimization [58.920693413667216]
  Self-directed Online Learning Optimization integrates Deep Neural Network (DNN) with Finite Element Method (FEM) calculations. Our algorithm was tested by four types of problems including compliance minimization, fluid-structure optimization, heat transfer enhancement and truss optimization. It reduced the computational time by 2 5 orders of magnitude compared with directly using methods, and outperformed all state-of-the-art algorithms tested in our experiments.
  arXiv  Detail & Related papers  (2020-02-04T20:00:28Z)

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.