DeepAI AI Chat
Log In Sign Up

Quadratic speedup of global search using a biased crossover of two good solutions

by   Takuya Isomura, et al.

The minimisation of cost functions is crucial in various optimisation fields. However, identifying their global minimum remains challenging owing to the huge computational cost incurred. This work analytically expresses the computational cost to identify an approximate global minimum for a class of cost functions defined under a high-dimensional discrete state space. Then, we derive an optimal global search scheme that minimises the computational cost. Mathematical analyses demonstrate that a combination of the gradient descent algorithm and the selection and crossover algorithm–with a biased crossover weight–maximises the search efficiency. Remarkably, its computational cost is of the square root order in contrast to that of the conventional gradient descent algorithms, indicating a quadratic speedup of global search. We corroborate this proposition using numerical analyses of the travelling salesman problem. The simple computational architecture and minimal computational cost of the proposed scheme are highly desirable for biological organisms and neuromorphic hardware.


Computational cost for determining an approximate global minimum using the selection and crossover algorithm

This work examines the expected computational cost to determine an appro...

Dimensionality reduction to maximize prediction generalization capability

This work develops an analytically solvable unsupervised learning scheme...

Reputation blackboard systems

Blackboard systems are motivated by the popular view of task forces as b...

A Caputo fractional derivative-based algorithm for optimization

We propose a novel Caputo fractional derivative-based optimization algor...

Gradient Descent for Low-Rank Functions

Several recent empirical studies demonstrate that important machine lear...

Parallelisation of a Common Changepoint Detection Method

In recent years, various means of efficiently detecting changepoints in ...

Provably Correct Automatic Subdifferentiation for Qualified Programs

The Cheap Gradient Principle (Griewank 2008) --- the computational cost ...

Code Repositories


Minimising computational cost for global search

view repo