高维超立方体上均匀测度的量化与稀疏设计
Sparse designs via quantization of the uniform measure on high-dimensional hypercubes
Luc Pronzato · Anatoly Zhigljavsky
中文摘要
球填充与球覆盖概念是计算机实验空间填充设计最常用的准则(即 maximin 与 minimax 方法),但在高维下存在重大缺陷。当维度 d 很大时,部署空间填充设计需要极多的设计点,使空间填充设计这一概念本身受到质疑;且这两种设计特性对边界高度敏感,尤其当设计域为超立方体(本文考虑的情形)时,对顶点尤为敏感,当设计规模小于 2^d 时这种敏感性尤为突出。本文不采用 maximin 或 minimax 准则,而考虑超立方体上均匀测度的量化误差。该误差有三个关键优势:它考虑了随机点 U 到设计点距离的整个分布;对边界效应不如 maximin 与 minimax 准则敏感;借助 Zador 的著名定理,当设计规模趋于无穷时可平滑自然地过渡到均匀设计。基于球对称分布最优随机量化器构造的最新结果(arXiv:2610.11772),提出一种生成给定目标规模 n、具有较小 L_s 平均量化误差的随机设计的方法,并利用所得分布的支撑集构造规模至多 n 的设计(可增量式构造)。结果表明,对于中等规模的 n,支撑在小超立方体顶点部分因子子集上的设计表现异常出色,显著优于在整个超立方体上均匀分布的设计。文中还说明了如何考虑向低维子空间的投影。
关键要点
- 01高维下 maximin 与 minimax 空间填充准则需极多设计点,且对超立方体边界与顶点高度敏感
- 02改用超立方体上均匀测度的量化误差作为设计准则,兼顾距离整体分布且边界敏感性更低
- 03基于球对称分布最优随机量化器结果,生成目标规模 n 的低 L_s 量化误差随机设计
- 04中等 n 时,支撑在小超立方体顶点部分因子子集上的设计显著优于全超立方体均匀设计
- 05说明了如何将方法扩展到低维子空间投影的情形
解读
尚无解读。
原始英文摘要
arXiv:2611.24507v1 Announce Type: new Abstract: While the notions of sphere packing and sphere covering underlie the most widely used criteria for space-filling design in computer experiments, namely, the maximin and minimax approaches, they suffer from major drawbacks in high dimensions. First, when the dimension $d$ is very large, deploying a space-filling design requires an extremely large number of design points, making the very notion of a space-filling design questionable. Second, these two design characteristics are highly sensitive to boundaries, particularly when the design domain is a hypercube (the case considered in this paper), and especially to its vertices. This sensitivity is particularly acute when the design size is less than $2^d$. Instead of considering the maximin or minimax criterion, we consider here the quantization error of the uniform measure on the hypercube. This error has three key advantages: it accounts for the entire distribution of distances from a random point $U$ to the design, is less sensitive to boundary effects than the maximin and minimax criteria, and, thanks to Zador's celebrated theorem, enables a smooth and natural transition to uniform designs as the design size tends to infinity. Building on recent results on the construction of optimal random quantizers for spherically symmetric distributions (arXiv:2610.11772) we propose a method to generate random designs of a given target size $n$ with small $L_s$-mean quantization error. The support of the resulting distribution is then used to construct designs, possibly incrementally, with sizes up to $n$. We demonstrate that, for moderate $n$, designs supported on a fractional factorial subset of the vertices of a small hypercube perform exceptionally well---and significantly better than designs uniformly distributed over the entire hypercube. We also explain how to account for projections onto lower-dimensional subspaces.