Characterization of Constrained Continuous Multiobjective Optimization Problems: A Feature Space Perspective

• URL: http://arxiv.org/abs/2109.04564v2
• Date: Thu, 23 Dec 2021 16:38:27 GMT
• Title: Characterization of Constrained Continuous Multiobjective Optimization Problems: A Feature Space Perspective
• Authors: Aljo\v{s}a Vodopija, Tea Tu\v{s}ar, Bogdan Filipi\v{c}
• Abstract summary: constrained multiobjective optimization problems (CMOPs) are still unsatisfactory understood and characterized. We propose 29 landscape features (of which 19 are novel) to characterize CMOPs. We compare eight frequently used artificial test suites against a recently proposed suite consisting of real-world problems based on physical models.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Despite the increasing interest in constrained multiobjective optimization in recent years, constrained multiobjective optimization problems (CMOPs) are still unsatisfactory understood and characterized. For this reason, the selection of appropriate CMOPs for benchmarking is difficult and lacks a formal background. We address this issue by extending landscape analysis to constrained multiobjective optimization. By employing four exploratory landscape analysis techniques, we propose 29 landscape features (of which 19 are novel) to characterize CMOPs. These landscape features are then used to compare eight frequently used artificial test suites against a recently proposed suite consisting of real-world problems based on physical models. The experimental results reveal that the artificial test problems fail to adequately represent some realistic characteristics, such as strong negative correlation between the objectives and constraints. Moreover, our findings show that all the studied artificial test suites have advantages and limitations, and that no "perfect" suite exists. Benchmark designers can use the obtained results to select or generate appropriate CMOP instances based on the characteristics they want to explore.

Related papers

• Temporal True and Surrogate Fitness Landscape Analysis for Expensive Bi-Objective Optimisation [0.0]
  This study compares landscapes of the true fitness function with those of surrogate models for multi-objective functions. It does so temporally by examining landscape features at different points in time during optimisation. Despite differences, the true and surrogate landscape features still show high correlations between each other.
  arXiv  Detail & Related papers  (2024-04-09T18:20:16Z)
• Spurious Feature Eraser: Stabilizing Test-Time Adaptation for Vision-Language Foundation Model [86.9619638550683]
  Vision-language foundation models have exhibited remarkable success across a multitude of downstream tasks due to their scalability on extensive image-text paired data. However, these models display significant limitations when applied to downstream tasks, such as fine-grained image classification, as a result of decision shortcuts''
  arXiv  Detail & Related papers  (2024-03-01T09:01:53Z)
• 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)
• Deep-ELA: Deep Exploratory Landscape Analysis with Self-Supervised Pretrained Transformers for Single- and Multi-Objective Continuous Optimization Problems [0.5461938536945723]
  In this work, we propose a hybrid approach, Deep-ELA, which combines (the benefits of) deep learning and ELA features. Our proposed framework can either be used out-of-the-box for analyzing single- and multi-objective continuous optimization problems, or subsequently fine-tuned to various tasks.
  arXiv  Detail & Related papers  (2024-01-02T12:41:17Z)
• Characterization of Constrained Continuous Multiobjective Optimization Problems: A Performance Space Perspective [0.0]
  Constrained multiobjective optimization problems (CMOPs) are unsatisfactorily understood. The choice of adequate CMOPs for benchmarking is difficult and lacks a formal background. This paper presents a novel performance assessment approach designed explicitly for constrained multiobjective optimization.
  arXiv  Detail & Related papers  (2023-02-04T14:12:30Z)
• A Pareto-optimal compositional energy-based model for sampling and optimization of protein sequences [55.25331349436895]
  Deep generative models have emerged as a popular machine learning-based approach for inverse problems in the life sciences. These problems often require sampling new designs that satisfy multiple properties of interest in addition to learning the data distribution.
  arXiv  Detail & Related papers  (2022-10-19T19:04:45Z)
• Learning Proximal Operators to Discover Multiple Optima [66.98045013486794]
  We present an end-to-end method to learn the proximal operator across non-family problems. We show that for weakly-ized objectives and under mild conditions, the method converges globally.
  arXiv  Detail & Related papers  (2022-01-28T05:53:28Z)
• Constrained multi-objective optimization of process design parameters in settings with scarce data: an application to adhesive bonding [48.7576911714538]
  Finding the optimal process parameters for an adhesive bonding process is challenging. Traditional evolutionary approaches (such as genetic algorithms) are then ill-suited to solve the problem. In this research, we successfully applied specific machine learning techniques to emulate the objective and constraint functions.
  arXiv  Detail & Related papers  (2021-12-16T10:14:39Z)
• Generalization of Neural Combinatorial Solvers Through the Lens of Adversarial Robustness [68.97830259849086]
  Most datasets only capture a simpler subproblem and likely suffer from spurious features. We study adversarial robustness - a local generalization property - to reveal hard, model-specific instances and spurious features. Unlike in other applications, where perturbation models are designed around subjective notions of imperceptibility, our perturbation models are efficient and sound. Surprisingly, with such perturbations, a sufficiently expressive neural solver does not suffer from the limitations of the accuracy-robustness trade-off common in supervised learning.
  arXiv  Detail & Related papers  (2021-10-21T07:28:11Z)
• Identifying Properties of Real-World Optimisation Problems through a Questionnaire [2.805617945875364]
  This work investigates the properties of real-world problems through a questionnaire. It enables the design of future benchmark problems that more closely resemble those found in the real world.
  arXiv  Detail & Related papers  (2020-11-11T05:09:01Z)
• Scalable Constrained Bayesian Optimization [10.820024633762596]
  The global optimization of a high-dimensional black-box function under black-box constraints is a pervasive task in machine learning, control, and the scientific community. We propose the scalable constrained Bayesian optimization (SCBO) algorithm that overcomes the above challenges and pushes the state-the-art.
  arXiv  Detail & Related papers  (2020-02-20T01:48:46Z)

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.