Global Optimisation in Hilbert Spaces using the Survival of the Fittest Algorithm
Andrew Yu. Morozov, Oleg Kuzenkov, Simran K. Sandhu

TL;DR
This paper introduces the Survival of the Fittest Algorithm (SoFA), a bio-inspired stochastic optimization method for high-dimensional Hilbert spaces, with proven convergence and successful application to ecological trajectory optimization.
Contribution
The paper presents a novel, mathematically rigorous global optimization algorithm for Hilbert spaces, inspired by natural selection, with proven convergence and practical application to ecological models.
Findings
SoFA outperforms existing stochastic algorithms in high-dimensional problems.
The convergence of SoFA is rigorously proven for a broad class of functionals.
Application to zooplankton migration demonstrates real-world effectiveness.
Abstract
Global optimisation problems in high-dimensional and infinite dimensional spaces arise in various real-world applications such as engineering, economics, geophysics, biology, machine learning, optimal control, etc. Among stochastic approaches to global optimisation, biology-inspired methods are currently popular in the literature, imitating natural ecological and evolutionary processes and reported to be efficient in many practical study cases. However, many of bio-inspired methods have some vital drawbacks. Due to their semi-empirical nature, convergence to the globally optimal solution cannot always be guaranteed and struggles with the high dimensionality of space, showing a slow convergence. Here, we present a bio-inspired global stochastic optimisation method, applicable in Hilbert function spaces, inspired by Darwin's' famous idea of the survival of the fittest, therefore, referred…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
