Empirical Study on the Benefits of Multiobjectivization for Solving Single-Objective Problems
When dealing with continuous single-objective problems, multimodality poses one of the biggest difficulties for global optimization. Local optima are often preventing algorithms from making progress and thus pose a severe threat. In this paper we analyze how single-objective optimization can benefit from multiobjectivization by considering an additional objective. With the use of a sophisticated visualization technique based on the multi-objective gradients, the properties of the arising multi-objective landscapes are illustrated and examined. We will empirically show that the multi-objective optimizer MOGSA is able to exploit these properties to overcome local traps. The performance of MOGSA is assessed on a testbed of several functions provided by the COCO platform. The results are compared to the local optimizer Nelder-Mead.
Code (0)
등록된 구현이 없습니다.
Tasks
global-optimizationSimilar Papers 제목 키워드 기반
Multiobjectivization of Local Search: Single-Objective Optimization Benefits From Multi-Objective Gradient Descent
Multimodality is one of the biggest difficulties for optimization as local optima are often preventing algorithms from making progress. This does not only challenge local strategies that can get stuck. It also hinders me…
Evolutionary AlgorithmsShould artificial agents ask for help in human-robot collaborative problem-solving?
Transferring as fast as possible the functioning of our brain to artificial intelligence is an ambitious goal that would help advance the state of the art in AI and robotics. It is in this perspective that we propose to …
Q-LearningDo Multi-Agents Solve Better Than Single? Evaluating Agentic Frameworks for Diagram-Grounded Geometry Problem Solving and Reasoning
Diagram-grounded geometry problem solving is a critical benchmark for multimodal large language models (MLLMs), yet the benefits of multi-agent design over single-agent remain unclear. We systematically compare single-ag…
TerpreT: A Probabilistic Programming Language for Program Induction
We study machine learning formulations of inductive program synthesis; given input-output examples, we try to synthesize source code that maps inputs to corresponding outputs. Our aims are to develop new machine learning…
BIG-bench Machine LearningProbabilistic ProgrammingProgram inductionProgram SynthesisDiscovering Multiple Solutions from a Single Task in Offline Reinforcement Learning
Recent studies on online reinforcement learning (RL) have demonstrated the advantages of learning multiple behaviors from a single task, as in the case of few-shot adaptation to a new environment. Although this approach …
Offline RLReinforcement Learning (RL)