arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.13671cs.LGcs.NE
收藏

通过欧几里德范数元启发式优化增强超实空间投影

Enhancing Hyper-To-Real Space Projections Through Euclidean Norm Meta-Heuristic Optimization

São Paulo State University(圣保罗州立大学)

Luiz C. F. Ribeiro, Mateus Roder, Gustavo H. de Rosa, Leandro A. Passos, João P. Papa

摘要:

在过去的几十年里,计算能力的持续增长使得解决一些对人类意义重大的优化问题成为一项易于处理的任务;然而,由于要评估的候选解决方案数量巨大,即使使用复杂的算法,解决其中一些问题仍然是一项挑战。在这样的背景下,一组自然启发的随机方法,称为元启发式优化,可以提供强大的近似解决方案,以小的计算负担,不同类型的问题,如导数免费实函数优化。然而,如果函数景观过于苛刻,这些方法可能会收敛到不适当的解决方案,例如,包含太多局部最优值。以前的工作解决了这个问题,采用超复杂的表示搜索空间,如四元数,其中景观变得更平滑,据说更容易优化。在这种方法下,元启发式计算发生在超复杂空间中,而变量在函数求值之前被映射回实域。尽管后一个操作是由欧几里德范数执行的,但我们发现,在优化过程完成后,通常可以通过采用Minkowski $p$范数来获得更好的解,并通过忽略额外成本和无超参数的辅助子问题来微调$p$。这种行为在八个成熟的基准测试函数中观察到,从而为超复杂元启发式优化培育了一个新的研究方向。

英文摘要:

The continuous computational power growth in the last decades has made solving several optimization problems significant to humankind a tractable task; however, tackling some of them remains a challenge due to the overwhelming amount of candidate solutions to be evaluated, even by using sophisticated algorithms. In such a context, a set of nature-inspired stochastic methods, called meta-heuristic optimization, can provide robust approximate solutions to different kinds of problems with a small computational burden, such as derivative-free real function optimization. Nevertheless, these methods may converge to inadequate solutions if the function landscape is too harsh, e.g., enclosing too many local optima. Previous works addressed this issue by employing a hypercomplex representation of the search space, like quaternions, where the landscape becomes smoother and supposedly easier to optimize. Under this approach, meta-heuristic computations happen in the hypercomplex space, whereas variables are mapped back to the real domain before function evaluation. Despite this latter operation being performed by the Euclidean norm, we have found that after the optimization procedure has finished, it is usually possible to obtain even better solutions by employing the Minkowski $p$-norm instead and fine-tuning $p$ through an auxiliary sub-problem with neglecting additional cost and no hyperparameters. Such behavior was observed in eight well-established benchmarking functions, thus fostering a new research direction for hypercomplex meta-heuristic optimization.

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

↑