Dividable Configuration Performance Learning

Machine/deep learning models have been widely adopted to predict the configuration performance of software systems. However, a crucial yet unaddressed challenge is how to cater for the sparsity inherited from the configuration landscape: the influence of configuration options (features) and the distribution of data samples are highly sparse. In this paper, we propose a model-agnostic and sparsity-robust framework for predicting configuration performance, dubbed <monospace>DaL</monospace>, based on the new paradigm of dividable learning that builds a model via “divide-and-learn”. To handle sample sparsity, the samples from the configuration landscape are divided into distant divisions, for each of which we build a sparse local model, e.g., regularized Hierarchical Interaction Neural Network, to deal with the feature sparsity. A newly given configuration would then be assigned to the right model of division for the final prediction. Further, <monospace>DaL</monospace> adaptively determines the optimal number of divisions required for a system and sample size without any extra training or profiling. Experiment results from 12 real-world systems and five sets of training data reveal that, compared with the state-of-the-art approaches, <monospace>DaL</monospace> performs no worse than the best counterpart on 44 out of 60 cases (within which 31 cases are significantly better) with up to <inline-formula><tex-math notation="LaTeX">$1.61\times$</tex-math></inline-formula> improvement on accuracy; requires fewer samples to reach the same/better accuracy; and producing acceptable training overhead. In particular, the mechanism that adapted the parameter <inline-formula><tex-math notation="LaTeX">$d$</tex-math></inline-formula> can reach the optimal value for 76.43% of the individual runs. The result also confirms that the paradigm of dividable learning is more suitable than other similar paradigms such as ensemble learning for predicting configuration performance. Practically, <monospace>DaL</monospace> considerably improves different global models when using them as the underlying local models, which further strengthens its flexibility. To promote open science, all the data, code, and supplementary materials of this work can be accessed at our repository: <uri>https://github.com/ideas-labo/DaL-ext</uri>.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Software Engineering
Published
2024-11-05
DOI
https://doi.org/10.1109/tse.2024.3491945
Citations
7
Primary Topic
Software Engineering Research
Type
article
Field-Weighted Citation Impact
5.45
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dividable Configuration Performance Learning

Rami Bahsoon, Tao Chen, Jingzhi Gong
7 citations
IEEE Transactions on Software Engineering
Software Engineering Research
5.45
article

Dividable Configuration Performance Learning

Rami Bahsoon, Tao Chen, Jingzhi Gong
article en
7 citations

Abstract

Machine/deep learning models have been widely adopted to predict the configuration performance of software systems. However, a crucial yet unaddressed challenge is how to cater for the sparsity inherited from the configuration landscape: the influence of configuration options (features) and the distribution of data samples are highly sparse. In this paper, we propose a model-agnostic and sparsity-robust framework for predicting configuration performance, dubbed <monospace>DaL</monospace>, based on the new paradigm of dividable learning that builds a model via “divide-and-learn”. To handle sample sparsity, the samples from the configuration landscape are divided into distant divisions, for each of which we build a sparse local model, e.g., regularized Hierarchical Interaction Neural Network, to deal with the feature sparsity. A newly given configuration would then be assigned to the right model of division for the final prediction. Further, <monospace>DaL</monospace> adaptively determines the optimal number of divisions required for a system and sample size without any extra training or profiling. Experiment results from 12 real-world systems and five sets of training data reveal that, compared with the state-of-the-art approaches, <monospace>DaL</monospace> performs no worse than the best counterpart on 44 out of 60 cases (within which 31 cases are significantly better) with up to <inline-formula><tex-math notation="LaTeX">$1.61\times$</tex-math></inline-formula> improvement on accuracy; requires fewer samples to reach the same/better accuracy; and producing acceptable training overhead. In particular, the mechanism that adapted the parameter <inline-formula><tex-math notation="LaTeX">$d$</tex-math></inline-formula> can reach the optimal value for 76.43% of the individual runs. The result also confirms that the paradigm of dividable learning is more suitable than other similar paradigms such as ensemble learning for predicting configuration performance. Practically, <monospace>DaL</monospace> considerably improves different global models when using them as the underlying local models, which further strengthens its flexibility. To promote open science, all the data, code, and supplementary materials of this work can be accessed at our repository: <uri>https://github.com/ideas-labo/DaL-ext</uri>.

IEEE Transactions on Software EngineeringVol. 51(1)
University of Electronic Science and Technology of China (CN), University of Birmingham (GB)
Openalex Percentile: Top 4%
Software Engineering Research
5.45
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.