Multiobjectivization of Local Search: Single-Objective Optimization Benefits From Multi-Objective Gradient Descent

• URL: http://arxiv.org/abs/2010.01004v1
• Date: Fri, 2 Oct 2020 13:56:44 GMT
• Title: Multiobjectivization of Local Search: Single-Objective Optimization Benefits From Multi-Objective Gradient Descent
• Authors: Vera Steinhoff and Pascal Kerschke and Pelin Aspar and Heike Trautmann and Christian Grimme
• Abstract summary: We present a new concept of gradient descent, which is able to escape local traps. We use a sophisticated visualization technique for multi-objective problems to prove the working principle of our idea.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 meta-heuristics like evolutionary algorithms in convergence to the global optimum. In this paper we present a new concept of gradient descent, which is able to escape local traps. It relies on multiobjectivization of the original problem and applies the recently proposed and here slightly modified multi-objective local search mechanism MOGSA. We use a sophisticated visualization technique for multi-objective problems to prove the working principle of our idea. As such, this work highlights the transfer of new insights from the multi-objective to the single-objective domain and provides first visual evidence that multiobjectivization can link single-objective local optima in multimodal landscapes.

Related papers

• Maintaining Diversity Provably Helps in Evolutionary Multimodal Optimization [20.621635722585502]
  We show that a simple method that considers diversity of solutions in the solution space can benefit the search in evolutionary algorithms (EAs) We prove that the proposed method, working with crossover, can help enhance the exploration, leading to multimodal or even exponential acceleration on the expected running time.
  arXiv  Detail & Related papers  (2024-06-04T17:52:14Z)
• UCB-driven Utility Function Search for Multi-objective Reinforcement Learning [75.11267478778295]
  In Multi-objective Reinforcement Learning (MORL) agents are tasked with optimising decision-making behaviours. We focus on the case of linear utility functions parameterised by weight vectors w. 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)
• Multi-objective optimisation via the R2 utilities [4.12484724941528]
  We show how to recast the multi-objective optimisation problem into a single-objective optimisation problem defined over sets. An appropriate class of objective functions for this new problem are the R2 utilities, which are utility functions that are defined as a weighted integral over the scalarised optimisation problems. We then analyse the performance of these greedy algorithms both theoretically and empirically.
  arXiv  Detail & Related papers  (2023-05-19T16:01:35Z)
• Semantics-Aware Dynamic Localization and Refinement for Referring Image Segmentation [102.25240608024063]
  Referring image segments an image from a language expression. We develop an algorithm that shifts from being localization-centric to segmentation-language. Compared to its counterparts, our method is more versatile yet effective.
  arXiv  Detail & Related papers  (2023-03-11T08:42:40Z)
• CLIP the Gap: A Single Domain Generalization Approach for Object Detection [60.20931827772482]
  Single Domain Generalization tackles the problem of training a model on a single source domain so that it generalizes to any unseen target domain. We propose to leverage a pre-trained vision-language model to introduce semantic domain concepts via textual prompts. We achieve this via a semantic augmentation strategy acting on the features extracted by the detector backbone, as well as a text-based classification loss.
  arXiv  Detail & Related papers  (2023-01-13T12:01:18Z)
• MOLE: Digging Tunnels Through Multimodal Multi-Objective Landscapes [0.0]
  Locally efficient (LE) sets, often considered as traps for local search, are rarely isolated in the decision space. The Multi-Objective Gradient Sliding Algorithm (MOGSA) is an algorithmic concept developed to exploit these superpositions. We propose a new algorithm, the Multi-Objective Landscape Explorer (MOLE), which is able to efficiently model and exploit LE sets in MMMOO problems.
  arXiv  Detail & Related papers  (2022-04-22T17:54:54Z)
• Multi-Source Domain Adaptation for Object Detection [52.87890831055648]
  We propose a unified Faster R-CNN based framework, termed Divide-and-Merge Spindle Network (DMSN) DMSN can simultaneously enhance domain innative and preserve discriminative power. We develop a novel pseudo learning algorithm to approximate optimal parameters of pseudo target subset.
  arXiv  Detail & Related papers  (2021-06-30T03:17:20Z)
• Multi-Objective Meta Learning [2.9932638148627104]
  We propose a unified gradient-based Multi-Objective Meta Learning (MOML) framework. We show the effectiveness of the proposed MOML framework in several meta learning problems.
  arXiv  Detail & Related papers  (2021-02-14T10:23:09Z)
• Learning to Generalize Unseen Domains via Memory-based Multi-Source Meta-Learning for Person Re-Identification [59.326456778057384]
  We propose the Memory-based Multi-Source Meta-Learning framework to train a generalizable model for unseen domains. We also present a meta batch normalization layer (MetaBN) to diversify meta-test features. Experiments demonstrate that our M$3$L can effectively enhance the generalization ability of the model for unseen domains.
  arXiv  Detail & Related papers  (2020-12-01T11:38:16Z)
• Provable Multi-Objective Reinforcement Learning with Generative Models [98.19879408649848]
  We study the problem of single policy MORL, which learns an optimal policy given the preference of objectives. Existing methods require strong assumptions such as exact knowledge of the multi-objective decision process. We propose a new algorithm called model-based envelop value (EVI) which generalizes the enveloped multi-objective $Q$-learning algorithm.
  arXiv  Detail & Related papers  (2020-11-19T22:35:31Z)
• Empirical Study on the Benefits of Multiobjectivization for Solving Single-Objective Problems [0.0]
  Local optima are often preventing algorithms from making progress and thus pose a severe threat. 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 COCO MOGSA is able to exploit these properties to overcome local traps.
  arXiv  Detail & Related papers  (2020-06-25T14:04:37Z)

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.