The Weights can be Harmful: Pareto Search versus Weighted Search in Multi-Objective Search-Based Software Engineering

02/08/2022
by   Tao Chen, et al.
2

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 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.

READ FULL TEXT

page 1

page 22

research
02/06/2023

Bi-level Multi-objective Evolutionary Learning: A Case Study on Multi-task Graph Neural Topology Search

The construction of machine learning models involves many bi-level multi...
research
03/23/2023

OFA^2: A Multi-Objective Perspective for the Once-for-All Neural Architecture Search

Once-for-All (OFA) is a Neural Architecture Search (NAS) framework desig...
research
05/19/2023

Applying Ising Machines to Multi-objective QUBOs

Multi-objective optimisation problems involve finding solutions with var...
research
01/09/2023

Do Performance Aspirations Matter for Guiding Software Configuration Tuning?

Configurable software systems can be tuned for better performance. Lever...
research
12/06/2022

Pareto Optimal Compression of Genomic Dictionaries, with or without Random Access in Main Memory

Motivation: A Genomic Dictionary, i.e., the set of the k-mers appearing ...
research
06/07/2021

Preference Discovery in Large Product Lines

When AI tools can generate many solutions, some human preference must be...
research
02/12/2020

Multi-Objective Optimization for Token-Based Clone Detection

Clone detection plays an important role in software engineering. Finding...

Please sign up or login with your details

Forgot password? Click here to reset