LAMBDA:搜索空间Quantization覆盖黑箱不等式解集
LAMBDA: Covering the Solution Set of Black-Box Inequality by Search Space Quantization
摘要:
黑盒函数被广泛用于对复杂的问题建模,这些问题除了输入和输出之外没有提供显式的信息。尽管已有的黑盒函数优化的研究,解决方案集满足一个不等式的黑盒函数起着更重要的作用,在许多实际情况下,只有一个最佳。通过对黑箱目标函数的有限评价,尽可能多地覆盖解集,本文将其定义为黑箱覆盖(BBC)问题。我们在基于样本的搜索范式中形式化了这个问题,并利用混淆矩阵分析构建了一个覆盖标准。此外,我们提出了LAMBDA(潜在行动蒙特卡罗束搜索密度自适应)来解决BBC问题。LAMBDA可以通过递归地将搜索空间划分为接受和拒绝的子空间来快速地关注解集。与La-MCTS算法相比,LAMBDA算法引入了密度信息,克服了优化的抽样偏差,获得了更多的探索性。基准测试表明,LAMBDA在所有基线中都达到了最先进的性能,并且在获得95%的覆盖率方面比随机搜索快33倍。实验表明,LAMBDA在虚拟测试中的自治系统的验证有很好的前景。
英文摘要:
Black-box functions are broadly used to model complex problems that provide no explicit information but the input and output. Despite existing studies of black-box function optimization, the solution set satisfying an inequality with a black-box function plays a more significant role than only one optimum in many practical situations. Covering as much as possible of the solution set through limited evaluations to the black-box objective function is defined as the Black-Box Coverage (BBC) problem in this paper. We formalized this problem in a sample-based search paradigm and constructed a coverage criterion with Confusion Matrix Analysis. Further, we propose LAMBDA (Latent-Action Monte-Carlo Beam Search with Density Adaption) to solve BBC problems. LAMBDA can focus around the solution set quickly by recursively partitioning the search space into accepted and rejected sub-spaces. Compared with La-MCTS, LAMBDA introduces density information to overcome the sampling bias of optimization and obtain more exploration. Benchmarking shows, LAMBDA achieved state-of-the-art performance among all baselines and was at most 33x faster to get 95% coverage than Random Search. Experiments also demonstrate that LAMBDA has a promising future in the verification of autonomous systems in virtual tests.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。