arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2111.07680cs.NEstat.ML
收藏

基于两个好解的有偏交叉的全局搜索的二次加速

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

Takuya Isomura

摘要:

成本函数的最小化在各种优化领域中至关重要。然而,由于计算成本巨大,确定其全局最小值仍然具有挑战性。这项工作解析地表达了计算成本,以确定一个近似的全局最小值的一类成本函数下定义的高维离散状态空间。然后,我们推导出一个最佳的全局搜索方案,使计算成本最小化。数学分析表明,结合梯度下降算法和选择和交叉算法-有偏交叉权重-最大化的搜索效率。值得注意的是,它的计算成本是平方根的顺序,与传统的梯度下降算法,表明一个二次加速的全局搜索。我们证实了这一命题使用数值分析的旅行推销员问题。所提出的方案的简单的计算架构和最小的计算成本是非常可取的生物有机体和神经形态硬件。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑