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

高维黑箱优化问题的分治近似求解

High-dimensional Black-box Optimization via Divide and Approximate Conquer

University of Science and Technology of China(中国科学技术大学);University of Birmingham(伯明翰大学)

Peng Yang, Ke Tang, Xin Yao

摘要:

分而治之(DC)在概念上非常适合于高维优化,通过将问题分解为多个小规模的子问题。然而,当子问题是相互依赖的时,很少能观察到吸引人的性能。本文认为,解决相互依赖的子问题的主要困难在于精确评估的部分解决方案(子问题),这可能是压倒性的成本,从而使子问题的非平凡的征服。因此,我们提出了一种名为Divide and Approximate Conquer(DAC)的近似方法,该方法将部分解计算的成本从指数时间降低到多项式时间。同时,收敛到全局最优(原问题)仍然是有保证的。DAC的有效性证明经验上的两组不可分离的高维问题。

英文摘要:

Divide and Conquer (DC) is conceptually well suited to high-dimensional optimization by decomposing a problem into multiple small-scale sub-problems. However, appealing performance can be seldom observed when the sub-problems are interdependent. This paper suggests that the major difficulty of tackling interdependent sub-problems lies in the precise evaluation of a partial solution (to a sub-problem), which can be overwhelmingly costly and thus makes sub-problems non-trivial to conquer. Thus, we propose an approximation approach, named Divide and Approximate Conquer (DAC), which reduces the cost of partial solution evaluation from exponential time to polynomial time. Meanwhile, the convergence to the global optimum (of the original problem) is still guaranteed. The effectiveness of DAC is demonstrated empirically on two sets of non-separable high-dimensional problems.

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

↑