arXiv:2510.04676cs.LG2025-10

通过反事实信用评估历史数据,加速找到全局最优解

Counterfactual Credit Guided Bayesian Optimization

  • 用反事实信用量化每条历史数据对寻优的贡献
  • 在多个测试中显著降低简单遗憾并加快收敛
  • 适合需要快速找最优解的工程优化场景

贝叶斯优化通过高斯过程代理模型优化昂贵的黑盒函数,侧重捕捉目标函数的全局特征。但在许多实际场景中,目标并非构建全面的全局代理模型,而是快速定位全局最优解。由于序列优化问题具有随机性,且依赖代理模型质量和初始设计,假设所有观测样本对最优解发现的贡献均等是受限的。本文提出反事实信用引导的贝叶斯优化(CCGBO),通过反事实信用显式量化单个历史观测的贡献。将反事实信用引入获取函数后,方法可优先分配资源于最优解最可能出现的区域。理论证明了CCGBO保持次线性遗憾。在多种合成与真实世界基准上的实证评估表明,CCGBO持续降低简单遗憾,并加速收敛至全局最优。

原文摘要 · Abstract (English)

Bayesian optimization has emerged as a prominent methodology for optimizing expensive black-box functions by leveraging Gaussian process surrogates, which focus on capturing the global characteristics of the objective function. However, in numerous practical scenarios, the primary objective is not to construct an exhaustive global surrogate, but rather to quickly pinpoint the global optimum. Due to the aleatoric nature of the sequential optimization problem and its dependence on the quality of the surrogate model and the initial design, it is restrictive to assume that all observed samples contribute equally to the discovery of the optimum in this context. In this paper, we introduce Counterfactual Credit Guided Bayesian Optimization (CCGBO), a novel framework that explicitly quantifies the contribution of individual historical observations through counterfactual credit. By incorporating counterfactual credit into the acquisition function, our approach can selectively allocate resources in areas where optimal solutions are most likely to occur. We prove that CCGBO retains sublinear regret. Empirical evaluations on various synthetic and real-world benchmarks demonstrate that CCGBO consistently reduces simple regret and accelerates convergence to the global optimum.

贝叶斯优化反事实分析全局最优

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。