Performance and Explainability Requirements of Evolutionary Algorithms in Real-World Physics-Informed Optimization

• URL: http://arxiv.org/abs/2605.28164v1
• Date: Wed, 27 May 2026 08:47:26 GMT
• Title: Performance and Explainability Requirements of Evolutionary Algorithms in Real-World Physics-Informed Optimization
• Abstract summary: Five real-world physics-based optimization problems are introduced and described by domain experts.<n>For each of these, the requirements for the evolutionary algorithm regarding performance and explainability to increase trust and usability are presented.<n>We present existing approaches that can be leveraged to improve those aspects of evolutionary algorithms but have to our knowledge never been employed in complex real-world scenarios.
• Score: 1.3593608888318645
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Evolutionary computation offers a variety of tools to solve complex real-world optimization problems. However, research often focuses on smaller, simplified problems and optimization algorithms that sometimes miss expectations in real-world scenarios. Additionally, trust in the applied algorithm and the solutions it provides is often essential in such settings, but requires an understanding of the search process itself. This leads to evolutionary computation often not being seriously considered by practitioners in many application contexts, among them physics-based modeling. In this article, techniques from evolutionary computation are detailed that can alleviate these problems. First, five real-world physics-based optimization problems are introduced and described by domain experts. For each of these, the requirements for the evolutionary algorithm regarding performance and explainability to increase trust and usability are presented. We found that all domain experts expect fast convergence to a good solution and want some explanations for how the results were formed, while other requirements strongly depend on the respective problem. Finally, we present existing approaches that can be leveraged to improve those aspects of evolutionary algorithms but have to our knowledge never been employed in complex real-world scenarios. This implies a gap between both domains that needs to be closed to exploit the full potential of evolutionary computation.

Related papers

• Learning to Solve and Optimize by Evolving Code [7.672098994389998]
  We show that algorithm generation via code evolution represents a paradigm shift by eliminating the need to formulate the how.<n>In all cases, the evolved algorithms consistently outperform state-of-the-art solvers.<n>This underscores the potential of formal methods in guiding code evolution for automatically solving complex real-world problems.
  arXiv  Detail & Related papers  (2026-05-29T09:25:07Z)
• Deep Unfolding: Recent Developments, Theory, and Design Guidelines [99.63555420898554]
  This article provides a tutorial-style overview of deep unfolding, a framework that transforms optimization algorithms into structured, trainable ML architectures.<n>We review the foundations of optimization for inference and for learning, introduce four representative design paradigms for deep unfolding, and discuss the distinctive training schemes that arise from their iterative nature.
  arXiv  Detail & Related papers  (2025-12-03T13:16:35Z)
• Training Neural Networks at Any Scale [57.048948400182354]
  This article reviews modern optimization methods for training neural networks with an emphasis on efficiency and scale.<n>We present state-of-the-art optimization algorithms under a unified algorithmic template that highlights the importance of adapting to the structures in the problem.
  arXiv  Detail & Related papers  (2025-11-14T10:58:07Z)
• Dual Adaptivity: Universal Algorithms for Minimizing the Adaptive Regret of Convex Functions [61.393184339405465]
  A new performance measure -- adaptive regret -- was proposed in online learning.<n>Several algorithms have been successfully developed to minimize the adaptive regret.<n>Existing algorithms lack universality in the sense that they can only handle one type of convex function.
  arXiv  Detail & Related papers  (2025-08-01T07:42:38Z)
• AlphaEvolve: A coding agent for scientific and algorithmic discovery [63.13852052551106]
  We present AlphaEvolve, an evolutionary coding agent that substantially enhances capabilities of state-of-the-art LLMs.<n>AlphaEvolve orchestrates an autonomous pipeline of LLMs, whose task is to improve an algorithm by making direct changes to the code.<n>We demonstrate the broad applicability of this approach by applying it to a number of important computational problems.
  arXiv  Detail & Related papers  (2025-06-16T06:37:18Z)
• A Generalized Evolutionary Metaheuristic (GEM) Algorithm for Engineering Optimization [1.6589012298747952]
  A major trend in recent years is the use of nature-inspired metaheustic algorithms (NIMA) There are over 540 algorithms in the literature, and there is no unified framework to understand the search mechanisms of different algorithms. We propose a generalized evolutionary metaheuristic algorithm to unify more than 20 different algorithms.
  arXiv  Detail & Related papers  (2024-07-02T09:55:15Z)
• Reinforcement Learning-assisted Evolutionary Algorithm: A Survey and Research Opportunities [63.258517066104446]
  Reinforcement learning integrated as a component in the evolutionary algorithm has demonstrated superior performance in recent years. We discuss the RL-EA integration method, the RL-assisted strategy adopted by RL-EA, and its applications according to the existing literature. In the applications of RL-EA section, we also demonstrate the excellent performance of RL-EA on several benchmarks and a range of public datasets.
  arXiv  Detail & Related papers  (2023-08-25T15:06:05Z)
• Runtime Analysis of Competitive co-Evolutionary Algorithms for Maximin Optimisation of a Bilinear Function [7.716156977428554]
  Co-evolutionary algorithms have a wide range of applications, such as in hardware design, evolution of strategies for board games, and patching software bugs.<n>These algorithms are poorly understood and applications are often limited by pathological behaviour.<n>It is an open challenge to develop a theory that can predict when co-evolutionary algorithms find solutions efficiently and reliable.
  arXiv  Detail & Related papers  (2022-06-30T12:35:36Z)
• SUPER-ADAM: Faster and Universal Framework of Adaptive Gradients [99.13839450032408]
  It is desired to design a universal framework for adaptive algorithms to solve general problems. In particular, our novel framework provides adaptive methods under non convergence support for setting.
  arXiv  Detail & Related papers  (2021-06-15T15:16:28Z)
• Fractal Structure and Generalization Properties of Stochastic Optimization Algorithms [71.62575565990502]
  We prove that the generalization error of an optimization algorithm can be bounded on the complexity' of the fractal structure that underlies its generalization measure. We further specialize our results to specific problems (e.g., linear/logistic regression, one hidden/layered neural networks) and algorithms.
  arXiv  Detail & Related papers  (2021-06-09T08:05:36Z)
• Emergence of Structural Bias in Differential Evolution [0.0]
  Heuristic optimisation algorithms are in high demand due to the overwhelming amount of complex optimisation problems. Many algorithms show structural bias, by either being attracted to a certain region of the search space or by consistently avoiding regions of the search space. We analyse the emergence of such structural bias for Differential Evolution (DE) configurations and, specifically, the effect of different mutation, crossover and correction strategies.
  arXiv  Detail & Related papers  (2021-05-10T22:22:27Z)
• Qualities, challenges and future of genetic algorithms: a literature review [0.0]
  Genetic algorithms are computer programs that simulate natural evolution. They have been used to solve various optimisation problems from neural network architecture search to strategic games. Recent developments such as GPU, parallel and quantum computing, conception of powerful parameter control methods, and novel approaches in representation strategies may be keys to overcome their limitations.
  arXiv  Detail & Related papers  (2020-11-05T17:53:33Z)

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.