竞赛多目标选择概率
Racing Multi-Objective Selection Probabilities
摘要:
在噪声多目标优化的背景下,处理不确定性需要决策者通过一些统计数据(例如,平均值,中位数)用于评估解决方案的质量,并定义相应的帕累托集。近似这些统计数据需要重复采样的人口,大大增加了整体计算成本。为了解决这个问题,本文提出了直接估计每个个体被选中的概率,使用一些Hoeffding比赛动态分配估计预算在选择步骤。建议的赛车方法进行了验证,对静态预算的方法与NSGA-II的嘈杂版本的ZDT基准函数。
英文摘要:
In the context of Noisy Multi-Objective Optimization, dealing with uncertainties requires the decision maker to define some preferences about how to handle them, through some statistics (e.g., mean, median) to be used to evaluate the qualities of the solutions, and define the corresponding Pareto set. Approximating these statistics requires repeated samplings of the population, drastically increasing the overall computational cost. To tackle this issue, this paper proposes to directly estimate the probability of each individual to be selected, using some Hoeffding races to dynamically assign the estimation budget during the selection step. The proposed racing approach is validated against static budget approaches with NSGA-II on noisy versions of the ZDT benchmark functions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。