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

利用多重随机嵌入的低有效维数函数的约束全局optimization

Constrained global optimization of functions with low effective dimensionality using multiple random embeddings

Coralia Cartis, Estelle Massart, Adilet Otemissov

摘要:

我们考虑具有低有效维数的函数的有界约束全局优化,这些函数沿(未知)线性子空间是常数,仅在有效(补充)子空间上变化。我们的目标是隐式地探索内在的低维的约束景观使用可行的随机嵌入,以了解和提高这些特殊结构问题的全局优化算法的可扩展性。一个减少的子问题制定调查,解决了原问题的随机低维子空间的仿射约束,以保持相对于给定域的可行性。在合理的假设下,我们表明,减少的问题是成功地解决原来的,全维问题的概率是积极的。此外,在目标的有效子空间与坐标轴对齐的情况下,我们提供了这个成功概率,捕获其代数依赖于有效的,令人惊讶的是,环境尺寸的渐近约束。然后,我们提出了X-REGO,一个通用的算法框架,使用多个随机嵌入,解决上述减少的问题反复,近似和可能,自适应。使用成功概率减少的子问题,我们证明了X-REGO收敛全局,概率为1,线性嵌入的数量,一个$ε$ -邻域的约束全局极小。我们的特殊结构函数的数值实验说明了我们的理论研究结果和改进的可扩展性的X-REGO变种时,再加上国家的最先进的全球,甚至局部最优化求解器的子问题。

英文摘要:

We consider the bound-constrained global optimization of functions with low effective dimensionality, that are constant along an (unknown) linear subspace and only vary over the effective (complement) subspace. We aim to implicitly explore the intrinsic low dimensionality of the constrained landscape using feasible random embeddings, in order to understand and improve the scalability of algorithms for the global optimization of these special-structure problems. A reduced subproblem formulation is investigated that solves the original problem over a random low-dimensional subspace subject to affine constraints, so as to preserve feasibility with respect to the given domain. Under reasonable assumptions, we show that the probability that the reduced problem is successful in solving the original, full-dimensional problem is positive. Furthermore, in the case when the objective's effective subspace is aligned with the coordinate axes, we provide an asymptotic bound on this success probability that captures its algebraic dependence on the effective and, surprisingly, ambient dimensions. We then propose X-REGO, a generic algorithmic framework that uses multiple random embeddings, solving the above reduced problem repeatedly, approximately and possibly, adaptively. Using the success probability of the reduced subproblems, we prove that X-REGO converges globally, with probability one, and linearly in the number of embeddings, to an $ε$-neighbourhood of a constrained global minimizer. Our numerical experiments on special structure functions illustrate our theoretical findings and the improved scalability of X-REGO variants when coupled with state-of-the-art global - and even local - optimization solvers for the subproblems.

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

↑