Dividable Configuration Performance Learning
Jingzhi Gong, Tao Chen, Rami Bahsoon

TL;DR
This paper introduces DaL, a divide-and-learn framework that improves configuration performance prediction by addressing data sparsity through dividing the landscape into local models, achieving better accuracy with fewer samples.
Contribution
The paper proposes a novel dividable learning paradigm for configuration performance prediction, enhancing accuracy and sample efficiency in sparse data scenarios.
Findings
DaL outperforms state-of-the-art methods in 44 out of 60 cases.
Requires fewer samples to achieve comparable or better accuracy.
Adapts the number of divisions effectively in most runs.
Abstract
Machine/deep learning models have been widely adopted for predicting 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 DaL, 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware Engineering Research
