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

仿射OneMax

Affine OneMax

Arnaud Berny

摘要:

提出了一类新的黑盒优化测试函数。仿射OneMax(AOM)函数被定义为OneMax和位向量上的可逆仿射映射的组合。该类的黑盒复杂度的上界是一个大次数的多项式。证明依赖于离散傅立叶分析和Kushilevitz-Mansour算法。可调复杂度是通过将可逆线性映射表示为有限个横截的乘积来实现的。研究了AOM函数子类的黑盒复杂性。最后,给出了AOM函数的实验结果,以说明搜索算法的性能。

英文摘要:

A new class of test functions for black box optimization is introduced. Affine OneMax (AOM) functions are defined as compositions of OneMax and invertible affine maps on bit vectors. The black box complexity of the class is upper bounded by a polynomial of large degree in the dimension. The proof relies on discrete Fourier analysis and the Kushilevitz-Mansour algorithm. Tunable complexity is achieved by expressing invertible linear maps as finite products of transvections. The black box complexity of sub-classes of AOM functions is studied. Finally, experimental results are given to illustrate the performance of search algorithms on AOM functions.

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

↑