权值可能是有害的:基于多目标搜索的软件工程中的Pareto搜索与加权搜索
The Weights can be Harmful: Pareto Search versus Weighted Search in Multi-Objective Search-Based Software Engineering
摘要:
在基于搜索的软件工程(SBSE)中,当存在多个待优化目标时,通常采用Pareto搜索。它搜索问题的帕累托最优解的一个很好的近似值,利益相关者根据他们的偏好从中选择最喜欢的解决方案。然而,当利益相关者的明确偏好(例如,一组反映目标之间相对重要性的权重)在搜索之前可用,加权搜索被认为是第一选择,因为它通过将原始多目标问题转换为单目标问题来简化搜索,并且使得搜索能够集中于仅利益相关者感兴趣的内容。本文质疑这样一个“加权搜索优先”的信念。我们表明,权重,事实上,是有害的搜索过程中,即使存在明确的偏好。具体来说,我们进行了一个大规模的实证研究,其中包括38个系统/项目,从三个代表性的SBSE问题,连同两种类型的搜索预算和9套权重,导致604例比较。我们的主要发现是,加权搜索达到一定程度的解决方案的质量消耗相对较少的资源在搜索的早期阶段,然而,帕累托搜索是在大多数的时间(高达77%的情况下)显着优于其加权对应,只要我们允许一个足够的,但不是不切实际的搜索预算。这一点,连同其他研究结果和可操作的建议,在文件中,使我们能够编纂务实和全面的指导选择加权和帕累托搜索SBSE的情况下,明确的偏好。所有代码和数据都可以在https://github.com/ideas-labo/pareto-vs-weight-for-sbse上访问。
英文摘要:
In presence of multiple objectives to be optimized in Search-Based Software Engineering (SBSE), Pareto search has been commonly adopted. It searches for a good approximation of the problem's Pareto optimal solutions, from which the stakeholders choose the most preferred solution according to their preferences. However, when clear preferences of the stakeholders (e.g., a set of weights which reflect relative importance between objectives) are available prior to the search, weighted search is believed to be the first choice since it simplifies the search via converting the original multi-objective problem into a single-objective one and enable the search to focus on what only the stakeholders are interested in. This paper questions such a "weighted search first" belief. We show that the weights can, in fact, be harmful to the search process even in the presence of clear preferences. Specifically, we conduct a large scale empirical study which consists of 38 systems/projects from three representative SBSE problems, together with two types of search budget and nine sets of weights, leading to 604 cases of comparisons. Our key finding is that weighted search reaches a certain level of solution quality by consuming relatively less resources at the early stage of the search; however, Pareto search is at the majority of the time (up to 77% of the cases) significantly better than its weighted counterpart, as long as we allow a sufficient, but not unrealistic search budget. This, together with other findings and actionable suggestions in the paper, allows us to codify pragmatic and comprehensive guidance on choosing weighted and Pareto search for SBSE under the circumstance that clear preferences are available. All code and data can be accessed at: https://github.com/ideas-labo/pareto-vs-weight-for-sbse.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。