Identifying Properties of Real-World Optimisation Problems through a Questionnaire

• URL: http://arxiv.org/abs/2011.05547v2
• Date: Wed, 14 Jul 2021 10:03:44 GMT
• Title: Identifying Properties of Real-World Optimisation Problems through a Questionnaire
• Authors: Koen van der Blom, Timo M. Deist, Vanessa Volz, Mariapia Marchi, Yusuke Nojima, Boris Naujoks, Akira Oyama, Tea Tu\v{s}ar
• Abstract summary: 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.
• Score: 2.805617945875364
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Optimisation algorithms are commonly compared on benchmarks to get insight into performance differences. However, it is not clear how closely benchmarks match the properties of real-world problems because these properties are largely unknown. This work investigates the properties of real-world problems through a questionnaire to enable the design of future benchmark problems that more closely resemble those found in the real world. The results, while not representative as they are based on only 45 responses, indicate that many problems possess at least one of the following properties: they are constrained, deterministic, have only continuous variables, require substantial computation times for both the objectives and the constraints, or allow a limited number of evaluations. Properties like known optimal solutions and analytical gradients are rarely available, limiting the options in guiding the optimisation process. These are all important aspects to consider when designing realistic benchmark problems. At the same time, the design of realistic benchmarks is difficult, because objective functions are often reported to be black-box and many problem properties are unknown. To further improve the understanding of real-world problems, readers working on a real-world optimisation problem are encouraged to fill out the questionnaire: https://tinyurl.com/opt-survey

Related papers

• The hop-like problem nature -- unveiling and modelling new features of real-world problems [0.0]
  We propose a hop-based analysis of the optimization process. Results indicate the existence of some of the features of the well-known Leading Ones problem. Experiments reveal what kind of mechanisms must be proposed to improve GAs' effectiveness.
  arXiv  Detail & Related papers  (2024-06-03T11:30:04Z)
• Deep Learning-Based Object Pose Estimation: A Comprehensive Survey [73.74933379151419]
  We discuss the recent advances in deep learning-based object pose estimation. Our survey also covers multiple input data modalities, degrees-of-freedom of output poses, object properties, and downstream tasks.
  arXiv  Detail & Related papers  (2024-05-13T14:44:22Z)
• 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)
• 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)
• Characterization of Constrained Continuous Multiobjective Optimization Problems: A Feature Space Perspective [0.0]
  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.
  arXiv  Detail & Related papers  (2021-09-09T21:21:57Z)
• Instance-optimality in optimal value estimation: Adaptivity via variance-reduced Q-learning [99.34907092347733]
  We analyze the problem of estimating optimal $Q$-value functions for a discounted Markov decision process with discrete states and actions. Using a local minimax framework, we show that this functional arises in lower bounds on the accuracy on any estimation procedure. In the other direction, we establish the sharpness of our lower bounds, up to factors logarithmic in the state and action spaces, by analyzing a variance-reduced version of $Q$-learning.
  arXiv  Detail & Related papers  (2021-06-28T00:38:54Z)
• Why Do Local Methods Solve Nonconvex Problems? [54.284687261929115]
  Non-used optimization is ubiquitous in modern machine learning. We rigorously formalize it for instances of machine learning problems. We hypothesize a unified explanation for this phenomenon.
  arXiv  Detail & Related papers  (2021-03-24T19:34:11Z)
• Continuous surrogate-based optimization algorithms are well-suited for expensive discrete problems [9.655888042539495]
  We present empirical evidence showing that the use of continuous surrogate models displays competitive performance against state-of-the-art discrete surrogate-based methods. Our experiments on different discrete structures and time constraints also give more insight into which algorithms work well on which type of problem.
  arXiv  Detail & Related papers  (2020-11-06T15:27:45Z)
• Global Optimization of Objective Functions Represented by ReLU Networks [77.55969359556032]
  Neural networks can learn complex, non- adversarial functions, and it is challenging to guarantee their correct behavior in safety-critical contexts. Many approaches exist to find failures in networks (e.g., adversarial examples), but these cannot guarantee the absence of failures. We propose an approach that integrates the optimization process into the verification procedure, achieving better performance than the naive approach.
  arXiv  Detail & Related papers  (2020-10-07T08:19:48Z)
• Towards Realistic Optimization Benchmarks: A Questionnaire on the Properties of Real-World Problems [2.805617945875364]
  This work aims to identify properties of real-world problems through a questionnaire. A few challenges that have to be considered in the design of realistic benchmarks can already be identified. A key point for future work is to gather more responses to the questionnaire.
  arXiv  Detail & Related papers  (2020-04-14T10:04:38Z)
• Scalable and Customizable Benchmark Problems for Many-Objective Optimization [0.0]
  We propose a parameterized generator of scalable and customizable benchmark problems for many-objective problems (MaOPs) It is able to generate problems that reproduce features present in other benchmarks and also problems with some new features.
  arXiv  Detail & Related papers  (2020-01-26T12:39:51Z)

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.