arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.5962math.NAcs.NA
收藏

多元函数的可分离性

On the separability of multivariate functions

School of Engineering, The University of Tokyo(东京大学工学部)

Takashi Goda

AI总结:

本文提出基于蒙特卡洛的算法,用于估计定义在单位立方体上的函数关于给定不相交变量子集的可分离性,并扩展至自动发现可分离结构。

摘要:

多元函数的可分离性减轻了寻找函数最小值或最大值的难度,因为可以通过求解几个低维度的不相交问题来搜索最优解。然而,在大多数实际问题中,待优化的函数是黑箱的,我们很难把握其可分离性。在本研究中,我们首先描述了一个一般的可分离性条件,该条件定义在任意域上的函数满足当且仅当该函数关于给定的不相交变量子集是可分离的。通过引入一个替代的可分离性条件,我们提出了一种基于蒙特卡洛的算法,用于估计定义在单位立方体上的函数关于给定的不相交变量子集的可分离性。此外,我们扩展了我们的算法,以估计不相交子集的数量以及使得函数关于它们可分离的不相交子集。我们扩展算法的计算复杂度依赖于函数,在维度上从线性到指数变化。

英文摘要:

Separability of multivariate functions alleviates the difficulty in finding a minimum or maximum value of a function such that an optimal solution can be searched by solving several disjoint problems with lower dimensionalities. In most of practical problems, however, a function to be optimized is black-box and we hardly grasp its separability. In this study, we first describe a general separability condition which a function defined over an arbitrary domain satisfies if and only if the function is separable with respect to given disjoint subsets of variables. By introducing an alternative separability condition, we propose a Monte Carlo-based algorithm to estimate the separability of a function defined over unit cube with respect to given disjoint subsets of variables. Moreover, we extend our algorithm to estimate the number of disjoint subsets and the disjoint subsets such that a function is separable with respect to them. Computational complexity of our extended algorithm is function-dependent and varies from linear to exponential in the dimension.

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

↑