Exploration of Pareto-preserving Search Space Transformations in Multi-objective Test Functions

• URL: http://arxiv.org/abs/2604.08173v2
• Date: Sat, 11 Apr 2026 12:44:18 GMT
• Title: Exploration of Pareto-preserving Search Space Transformations in Multi-objective Test Functions
• Abstract summary: We re-emphasize the importance of transformations in the search space, and address the challenges inherent in adding transformations to boundary constraints problems.<n>We show how these changes impact the performance of various multi-objective optimization algorithms.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Benchmark problems are an important tool for gaining understanding of optimization algorithms. Since algorithms often aim to perform well on benchmarks, biases in benchmark design provide misleading insights. In single-objective optimization, for example, many problems used to have their optimum in the center of the search domain. To remedy these issues, search space transformations have been widely adopted by benchmark suites, preventing algorithms from exploiting unintended structure. In multi-objective optimization, problem design has focused primarily on the objective space structure. While this focus addresses important aspects of the multi-objective nature of the problems, the search space structures of these problems have received comparatively limited attention. In this work, we re-emphasize the importance of transformations in the search space, and address the challenges inherent in adding transformations to boundary constraints problems without impacting the structure of the objective space. We utilized two parameterized, bijective transformations to create different instantiations of popular benchmark problems, and show how these changes impact the performance of various multi-objective optimization algorithms. In addition to the search space transformations, we show that such parameterized transformations can also be applied to the objective space, and compare their respective performance impacts.

Related papers

• The impact of objective interactions on the performance of massive objective optimization algorithms [0.5219568203653523]
  We evaluate several state-of-the-art evolutionary algorithms including NSGA-II, NSGA-III, MOEA/D and lexicase selection.<n>Experiments reveal that problem characteristics significantly affect algorithm performance.<n>We also show that lexicase selection, an algorithm originally designed for genetic programming, compares favorably with state-of-the-art many-objective optimization algorithms.
  arXiv  Detail & Related papers  (2026-07-15T02:06:30Z)
• Block-Bench: A Framework for Controllable and Transparent Discrete Optimization Benchmarking [8.439354142056201]
  We build benchmark problems based on a set of block functions, where each block function maps a subset of variables to a real value.<n>Our framework allows to analyze algorithm behavior not only in the objective space but also at the level of variable representations in the obtained solutions.
  arXiv  Detail & Related papers  (2026-04-08T11:44:24Z)
• A Comparison-Relationship-Surrogate Evolutionary Algorithm for Multi-Objective Optimization [0.0]
  We propose a new evolutionary algorithm "CRSEA" which uses the comparison-relationship model.<n>We find that CRSEA finds better converged solutions than the tested SAEAs on many medium-scale, biobjective problems.
  arXiv  Detail & Related papers  (2025-04-28T01:39:38Z)
• Marmot: Object-Level Self-Correction via Multi-Agent Reasoning [55.74860093731475]
  Marmot is a novel and generalizable framework that leverages Multi-Agent Reasoning for Multi-Object Self-Correcting.<n>Marmot significantly improves accuracy in object counting, attribute assignment, and spatial relationships for image generation tasks.
  arXiv  Detail & Related papers  (2025-04-10T16:54:28Z)
• ParetoLens: A Visual Analytics Framework for Exploring Solution Sets of Multi-objective Evolutionary Algorithms [42.23658218722045]
  This paper introduces a visual analytics framework specifically tailored to enhance the inspection and exploration of solution sets derived from evolutionary algorithms.<n>ParetoLens enables a detailed inspection of solution distributions in both decision and objective spaces through a suite of interactive visual representations.
  arXiv  Detail & Related papers  (2025-01-06T09:04:14Z)
• Learnable Evolutionary Multi-Objective Combinatorial Optimization via Sequence-to-Sequence Model [43.53359509358102]
  SeqMO is a learnable multi-objective optimization method that integrates sequence-to-sequence models with evolutionary algorithms.<n>Our approach divides approximate solution sets based on objective values' distance to the Pareto front, and establishes mapping relationships between solutions by minimizing objective vector angles in the target space.<n> Experiments on the multi-objective travel salesman problem and the multi-objective assignment problem verify the effectiveness of the algorithm.
  arXiv  Detail & Related papers  (2024-12-09T01:46:58Z)
• UCB-driven Utility Function Search for Multi-objective Reinforcement Learning [51.00436121587591]
  In Multi-objective Reinforcement Learning (MORL) agents are tasked with optimising decision-making behaviours.<n>We focus on the case of linear utility functions parametrised by weight vectors w.<n>We introduce a method based on Upper Confidence Bound to efficiently search for the most promising weight vectors during different stages of the learning process.
  arXiv  Detail & Related papers  (2024-05-01T09:34:42Z)
• Solving the Food-Energy-Water Nexus Problem via Intelligent Optimization Algorithms [46.48853432592689]
  Food-Energy-Water systems are intricately linked among food, energy and water that impact each other. They usually involve a huge number of decision variables and many conflicting objectives to be optimized. In this paper, we solve a Food-Energy-Water optimization problem by using the state-of-art intelligent optimization methods and compare their performance.
  arXiv  Detail & Related papers  (2024-04-10T06:19:19Z)
• Impact of spatial transformations on landscape features of CEC2022 basic benchmark problems [2.2298281397001434]
  We investigate several problem transformations and show how they influence the low-level landscape features of a set of 5 problems from the CEC2022 benchmark suite. Our results highlight that even relatively small transformations can significantly alter the measured landscape features. This poses a wider question of what properties we want to preserve when creating problem transformations, and how to fairly measure them.
  arXiv  Detail & Related papers  (2024-02-12T13:52:34Z)
• AbCD: A Component-wise Adjustable Framework for Dynamic Optimization Problems [49.1574468325115]
  Dynamic Optimization Problems (DOPs) are characterized by changes in the fitness landscape that can occur at any time and are common in real world applications. We develop a component-oriented framework for DOPs called Adjustable Components for Dynamic Problems (AbCD) Our results highlight existing problems in the DOP field that need to be addressed in the future development of algorithms and components.
  arXiv  Detail & Related papers  (2023-10-09T08:11:31Z)
• Multiobjective variational quantum optimization for constrained problems: an application to Cash Management [45.82374977939355]
  We introduce a new method for solving optimization problems with challenging constraints using variational quantum algorithms. We test our proposal on a real-world problem with great relevance in finance: the Cash Management problem. Our empirical results show a significant improvement in terms of the cost of the achieved solutions, but especially in the avoidance of local minima.
  arXiv  Detail & Related papers  (2023-02-08T17:09:20Z)
• A Study of Scalarisation Techniques for Multi-Objective QUBO Solving [0.0]
  Quantum and quantum-inspired optimisation algorithms have shown promising performance when applied to academic benchmarks as well as real-world problems. However, QUBO solvers are single objective solvers. To make them more efficient at solving problems with multiple objectives, a decision on how to convert such multi-objective problems to single-objective problems need to be made.
  arXiv  Detail & Related papers  (2022-10-20T14:54:37Z)
• Weakly supervised cross-domain alignment with optimal transport [102.8572398001639]
  Cross-domain alignment between image objects and text sequences is key to many visual-language tasks. This paper investigates a novel approach for the identification and optimization of fine-grained semantic similarities between image and text entities.
  arXiv  Detail & Related papers  (2020-08-14T22:48:36Z)
• Effects of Discretization of Decision and Objective Spaces on the Performance of Evolutionary Multiobjective Optimization Algorithms [12.487285663072512]
  We show that the decision space discretization has a positive effect for large-scale problems and the objective space discretization has a positive effect for many-objective problems. We also show the discretization of both spaces is useful for large-scale many-objective problems.
  arXiv  Detail & Related papers  (2020-03-22T15:07:45Z)

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.