On the Role of Search Budgets in Model-Based Software Refactoring Optimization

• URL: http://arxiv.org/abs/2308.15179v3
• Date: Mon, 03 Nov 2025 11:06:13 GMT
• Title: On the Role of Search Budgets in Model-Based Software Refactoring Optimization
• Abstract summary: Multi-objective evolutionary algorithms help designers identify trade-offs among desired non-functional properties.<n>This work examines the impact of implementing a search budget to limit the search for design alternatives.
• Score: 4.065502917666599
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Software model optimization is a process that automatically generates design alternatives aimed at improving quantifiable non-functional properties of software systems, such as performance and reliability. Multi-objective evolutionary algorithms effectively help designers identify trade-offs among the desired non-functional properties. To reduce the use of computational resources, this work examines the impact of implementing a search budget to limit the search for design alternatives. In particular, we analyze how time budgets affect the quality of Pareto fronts by utilizing quality indicators and exploring the structural features of the generated design alternatives. This study identifies distinct behavioral differences among evolutionary algorithms when a search budget is implemented. It further reveals that design alternatives generated under a budget are structurally different from those produced without one. Additionally, we offer recommendations for designers on selecting algorithms in relation to time constraints, thereby facilitating the effective application of automated refactoring to improve non-functional properties.

Related papers

• A Surrogate-based Approach for Fast Multi-objective Architectural Refactoring Optimization [0.9430947207126281]
  We build surrogate models based on regression techniques to approximate the outputs of analysis tools at significantly lower computational cost.<n>Our experimental results suggest that surrogate models provide savings of up to $30%$ in computational time.<n>Overall, surrogate models constitute a promising approach for scaling multi-objective architecture optimization to larger spaces and complex architectural models.
  arXiv  Detail & Related papers  (2026-09-07T12:03:10Z)
• Advancing Automated Algorithm Design via Evolutionary Stagewise Design with LLMs [69.91297564489464]
  EvoStage is a novel evolutionary paradigm that bridges the gap between the rigorous demands of industrial-scale algorithm design and the LLM-based algorithm design methods.<n>EvoStage decomposes the algorithm design process into sequential, manageable stages and integrates real-time intermediate feedback to iteratively refine algorithm design directions.<n>When deployed on a commercial-grade 3D chip placement tool, EvoStage significantly surpasses the original performance metrics, achieving record-breaking efficiency.
  arXiv  Detail & Related papers  (2026-03-09T05:13:44Z)
• Practical, Utilitarian Algorithm Configuration [10.948508157248488]
  Utilitarian algorithm configuration identifies a parameter setting for a given algorithm that maximizes a user's utility.<n>We present a series of improvements to COUP that improve its empirical performance without degrading its theoretical guarantees.
  arXiv  Detail & Related papers  (2025-10-16T13:47:41Z)
• Preference Optimization for Combinatorial Optimization Problems [54.87466279363487]
  Reinforcement Learning (RL) has emerged as a powerful tool for neural optimization, enabling models learns that solve complex problems without requiring expert knowledge.<n>Despite significant progress, existing RL approaches face challenges such as diminishing reward signals and inefficient exploration in vast action spaces.<n>We propose Preference Optimization, a novel method that transforms quantitative reward signals into qualitative preference signals via statistical comparison modeling.
  arXiv  Detail & Related papers  (2025-05-13T16:47:00Z)
• Vector Quantized-Elites: Unsupervised and Problem-Agnostic Quality-Diversity Optimization [0.0]
  We introduce Vector Quantized-Elites (VQ-Elites), a novel Quality-Diversity algorithm that autonomously constructs a structured behavioral space grid. At the core of VQ-Elites is the integration of Vector Quantized Variational Autoencoders, which enables the dynamic learning of behavioral descriptors. We validate VQ-Elites on robotic arm pose-reaching and mobile robot space-covering tasks.
  arXiv  Detail & Related papers  (2025-04-10T18:23:19Z)
• Composite Indicator-Guided Infilling Sampling for Expensive Multi-Objective Optimization [17.290389254217565]
  We propose a composite indicator-based evolutionary algorithm (CI-EMO) for expensive multi-objective optimization. We design a novel composite performance indicator to guide the selection of candidates for real fitness evaluation. The proposed algorithm outperforms five state-of-the-art expensive multi-objective optimization algorithms.
  arXiv  Detail & Related papers  (2025-03-28T08:15:58Z)
• Evaluating the effectiveness, reliability and efficiency of a multi-objective sequential optimization approach for building performance design [0.8168080812068832]
  This paper proposes and evaluates a sequential approach for multi-objective design optimization of building geometry, fabric, HVAC system and controls for building performance. The performance of the sequential approach is benchmarked against a full factorial search and compared to the NSGA-II algorithm. This research indicates that a sequential optimization approach is a highly efficient and robust alternative to the standard NSGA-II algorithm.
  arXiv  Detail & Related papers  (2024-12-13T08:00:00Z)
• Self-Steering Optimization: Autonomous Preference Optimization for Large Language Models [79.84205827056907]
  We present Self-Steering Optimization ($SSO$), an algorithm that autonomously generates high-quality preference data.<n>$SSO$ employs a specialized optimization objective to build a data generator from the policy model itself, which is used to produce accurate and on-policy data.<n>Our evaluation shows that $SSO$ consistently outperforms baselines in human preference alignment and reward optimization.
  arXiv  Detail & Related papers  (2024-10-22T16:04:03Z)
• On Constructing Algorithm Portfolios in Algorithm Selection for Computationally Expensive Black-box Optimization in the Fixed-budget Setting [0.0]
  This paper argues the importance of considering the number of function evaluations used in the sampling phase when constructing algorithm portfolios. The results show that algorithm portfolios constructed by our approach perform significantly better than those by the previous approach.
  arXiv  Detail & Related papers  (2024-05-13T03:31:13Z)
• Towards Assessing Spread in Sets of Software Architecture Designs [2.2120851074630177]
  We propose a quality indicator for the spread that assesses the diversity of alternatives by taking into account architectural features. We demonstrate how our architectural quality indicator can be applied to a dataset from the literature.
  arXiv  Detail & Related papers  (2024-02-29T13:52:39Z)
• End-to-End Learning for Fair Multiobjective Optimization Under Uncertainty [55.04219793298687]
  The Predict-Then-Forecast (PtO) paradigm in machine learning aims to maximize downstream decision quality. This paper extends the PtO methodology to optimization problems with nondifferentiable Ordered Weighted Averaging (OWA) objectives. It shows how optimization of OWA functions can be effectively integrated with parametric prediction for fair and robust optimization under uncertainty.
  arXiv  Detail & Related papers  (2024-02-12T16:33:35Z)
• Bayesian Quality-Diversity approaches for constrained optimization problems with mixed continuous, discrete and categorical variables [0.3626013617212667]
  A new Quality-Diversity methodology based on mixed variables is proposed in the context of limited simulation budget. The proposed approach provides valuable trade-offs for decision-markers for complex system design.
  arXiv  Detail & Related papers  (2023-09-11T14:29:47Z)
• Performance of Genetic Algorithms in the Context of Software Model Refactoring [1.3812010983144802]
  We conduct a performance analysis of three genetic algorithms to compare them in terms of performance and quality of solutions. Results show that there are significant differences in performance among the algorithms.
  arXiv  Detail & Related papers  (2023-08-26T13:25:42Z)
• Evolutionary Solution Adaption for Multi-Objective Metal Cutting Process Optimization [59.45414406974091]
  We introduce a framework for system flexibility that allows us to study the ability of an algorithm to transfer solutions from previous optimization tasks. We study the flexibility of NSGA-II, which we extend by two variants: 1) varying goals, that optimize solutions for two tasks simultaneously to obtain in-between source solutions expected to be more adaptable, and 2) active-inactive genotype, that accommodates different possibilities that can be activated or deactivated. Results show that adaption with standard NSGA-II greatly reduces the number of evaluations required for optimization to a target goal, while the proposed variants further improve the adaption costs.
  arXiv  Detail & Related papers  (2023-05-31T12:07:50Z)
• Socio-cognitive Optimization of Time-delay Control Problems using Evolutionary Metaheuristics [89.24951036534168]
  Metaheuristics are universal optimization algorithms which should be used for solving difficult problems, unsolvable by classic approaches. In this paper we aim at constructing novel socio-cognitive metaheuristic based on castes, and apply several versions of this algorithm to optimization of time-delay system model.
  arXiv  Detail & Related papers  (2022-10-23T22:21:10Z)
• Investigating Positive and Negative Qualities of Human-in-the-Loop Optimization for Designing Interaction Techniques [55.492211642128446]
  Designers reportedly struggle with design optimization tasks where they are asked to find a combination of design parameters that maximizes a given set of objectives. Model-based computational design algorithms assist designers by generating design examples during design. Black box methods for assistance, on the other hand, can work with any design problem.
  arXiv  Detail & Related papers  (2022-04-15T20:40:43Z)
• AutoOpt: A General Framework for Automatically Designing Metaheuristic Optimization Algorithms with Diverse Structures [22.624811044236516]
  This paper proposes a general framework, AutoOpt, for automatically designing metaheuristic algorithms with diverse structures.<n>A general algorithm prototype dedicated to covering the metaheuristic family as widely as possible.<n>A directed acyclic graph algorithm representation to fit the proposed prototype.<n>A graph representation embedding method offering an alternative compact form of the graph to be manipulated.
  arXiv  Detail & Related papers  (2022-04-03T05:31:56Z)
• Multi-objective robust optimization using adaptive surrogate models for problems with mixed continuous-categorical parameters [0.0]
  Robust design optimization is traditionally considered when uncertainties are mainly affecting the objective function. The resulting nested optimization problem may be solved using a general-purpose solver, herein the non-dominated sorting genetic algorithm (NSGA-II) The proposed approach consists of sequentially carrying out NSGA-II while using an adaptively built Kriging model to estimate the quantiles.
  arXiv  Detail & Related papers  (2022-03-03T20:23:18Z)
• Pareto-Frontier-aware Neural Architecture Generation for Diverse Budgets [93.79297053429447]
  Existing methods often perform an independent architecture search for each target budget. We propose a general architecture generator that automatically produces effective architectures for an arbitrary budget merely via model inference. Extensive experiments on three platforms (i.e., mobile, CPU, and GPU) show the superiority of the proposed method over existing NAS methods.
  arXiv  Detail & Related papers  (2021-02-27T13:59:17Z)
• Bayesian Optimization for Selecting Efficient Machine Learning Models [53.202224677485525]
  We present a unified Bayesian Optimization framework for jointly optimizing models for both prediction effectiveness and training efficiency. Experiments on model selection for recommendation tasks indicate models selected this way significantly improves model training efficiency.
  arXiv  Detail & Related papers  (2020-08-02T02:56:30Z)
• Automatically Learning Compact Quality-aware Surrogates for Optimization Problems [55.94450542785096]
  Solving optimization problems with unknown parameters requires learning a predictive model to predict the values of the unknown parameters and then solving the problem using these values. Recent work has shown that including the optimization problem as a layer in a complex training model pipeline results in predictions of iteration of unobserved decision making. We show that we can improve solution quality by learning a low-dimensional surrogate model of a large optimization problem.
  arXiv  Detail & Related papers  (2020-06-18T19:11:54Z)
• Landscape-Aware Fixed-Budget Performance Regression and Algorithm Selection for Modular CMA-ES Variants [1.0965065178451106]
  We show that it is possible to achieve high-quality performance predictions with off-the-shelf supervised learning approaches. We test this approach on a portfolio of very similar algorithms, which we choose from the family of modular CMA-ES algorithms.
  arXiv  Detail & Related papers  (2020-06-17T13:34:57Z)
• Simplified Swarm Optimization for Bi-Objection Active Reliability Redundancy Allocation Problems [1.5990720051907859]
  The reliability redundancy allocation problem (RRAP) is a well-known problem in system design, development, and management. In this study, a bi-objective RRAP is formulated by changing the cost constraint as a new goal. To solve the proposed problem, a new simplified swarm optimization (SSO) with a penalty function, a real one-type solution structure, a number-based self-adaptive new update mechanism, a constrained non-dominated solution selection, and a new pBest replacement policy is developed.
  arXiv  Detail & Related papers  (2020-06-17T13:15:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.