超立方体广义分层抽样算法的实验分析
Experimental Analysis of a Generalized Stratified Sampling Algorithm for Hypercubes
摘要:
分层抽样是一种快速、简单的生成超立方体中均匀分布点集的方法。然而,对于最常见的傍轴分层,它有一个突出的缺点,即在n维采样点的数量必须是整数的n次幂。这种指数增长使得它的应用在高维中没有吸引力甚至不可行。我们提出了一个分层过程,消除了这个问题的递归二进制分区的超立方体。该算法在线性时间内运行,并试图使超盒与立方体形状的偏差最小化。利用偏差和覆盖半径分析了该算法的性质,并直接在实际应用中与拟随机等抽样方法进行了比较。我们还讨论了一个潜在的拉丁超立方体抽样,这对差异产生了积极影响。
英文摘要:
Stratified sampling is a fast and simple method to generate point sets with uniform distribution in hypercubes. However, for the most common paraxial stratfication it has the prominent drawback that the number of sampled points in n dimensions has to be an n-th power of an integer number. This exponential growth makes its application unattractive or even infeasible in high dimensions. We present a stratification procedure that eliminates this problem by a recursive binary partitioning of the hypercube. The algorithm runs in linear time and tries to minimize the hyperboxes' deviation from the cubic shape. We analyze the properties of the algorithm using discrepancy and covering radius, and directly in practical applications, comparing it to quasirandom and other sampling methods. We also discuss a potential combination with Latin hypercube sampling, which positively affects discrepancy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。