An Analysis of the Admissibility of the Objective Functions Applied in Evolutionary Multi-objective Clustering

• URL: http://arxiv.org/abs/2206.09483v1
• Date: Sun, 19 Jun 2022 20:22:04 GMT
• Title: An Analysis of the Admissibility of the Objective Functions Applied in Evolutionary Multi-objective Clustering
• Authors: Cristina Y. Morimoto and Aurora Pozo and Marc\'ilio C. P. de Souto
• Abstract summary: This paper proposes an analysis of the admissibility of the clustering criteria in evolutionary optimization. We demonstrate how the admissibility of the objective functions can influence the optimization. We provide insights regarding the combinations and usage of the clustering criteria in the Evolutionary Multi-Objective Clustering approaches.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A variety of clustering criteria has been applied as an objective function in Evolutionary Multi-Objective Clustering approaches (EMOCs). However, most EMOCs do not provide detailed analysis regarding the choice and usage of the objective functions. Aiming to support a better choice and definition of the objectives in the EMOCs, this paper proposes an analysis of the admissibility of the clustering criteria in evolutionary optimization by examining the search direction and its potential in finding optimal results. As a result, we demonstrate how the admissibility of the objective functions can influence the optimization. Furthermore, we provide insights regarding the combinations and usage of the clustering criteria in the EMOCs.

Related papers

• Comparative Analysis of Indicators for Multiobjective Diversity Optimization [0.2144088660722956]
  We discuss different diversity indicators from the perspective of indicator-based evolutionary algorithms (IBEA) with multiple objectives. We examine theoretical, computational, and practical properties of these indicators, such as monotonicity in species. We present new theorems -- including a proof of the NP-hardness of the Riesz s-Energy Subset Selection Problem.
  arXiv  Detail & Related papers  (2024-10-24T16:40:36Z)
• An incremental preference elicitation-based approach to learning potentially non-monotonic preferences in multi-criteria sorting [53.36437745983783]
  We first construct a max-margin optimization-based model to model potentially non-monotonic preferences. We devise information amount measurement methods and question selection strategies to pinpoint the most informative alternative in each iteration. Two incremental preference elicitation-based algorithms are developed to learn potentially non-monotonic preferences.
  arXiv  Detail & Related papers  (2024-09-04T14:36:20Z)
• GenBench: A Benchmarking Suite for Systematic Evaluation of Genomic Foundation Models [56.63218531256961]
  We introduce GenBench, a benchmarking suite specifically tailored for evaluating the efficacy of Genomic Foundation Models. GenBench offers a modular and expandable framework that encapsulates a variety of state-of-the-art methodologies. We provide a nuanced analysis of the interplay between model architecture and dataset characteristics on task-specific performance.
  arXiv  Detail & Related papers  (2024-06-01T08:01:05Z)
• Controllable Preference Optimization: Toward Controllable Multi-Objective Alignment [103.12563033438715]
  Alignment in artificial intelligence pursues consistency between model responses and human preferences as well as values. Existing alignment techniques are mostly unidirectional, leading to suboptimal trade-offs and poor flexibility over various objectives. We introduce controllable preference optimization (CPO), which explicitly specifies preference scores for different objectives.
  arXiv  Detail & Related papers  (2024-02-29T12:12:30Z)
• Discrete Factorial Representations as an Abstraction for Goal Conditioned Reinforcement Learning [99.38163119531745]
  We show that applying a discretizing bottleneck can improve performance in goal-conditioned RL setups. We experimentally prove the expected return on out-of-distribution goals, while still allowing for specifying goals with expressive structure.
  arXiv  Detail & Related papers  (2022-11-01T03:31:43Z)
• Multi-Objective GFlowNets [59.16787189214784]
  We study the problem of generating diverse candidates in the context of Multi-Objective Optimization. In many applications of machine learning such as drug discovery and material design, the goal is to generate candidates which simultaneously optimize a set of potentially conflicting objectives. We propose Multi-Objective GFlowNets (MOGFNs), a novel method for generating diverse optimal solutions, based on GFlowNets.
  arXiv  Detail & Related papers  (2022-10-23T16:15:36Z)
• Machine-Learning Based Objective Function Selection for Community Detection [5.156484100374058]
  We present NECTAR-ML, an extension of the NECTAR algorithm that uses a machine-learning based model for automating the selection of the objective function. Our analysis shows that in approximately 90% of the cases our model was able to successfully select the correct objective function.
  arXiv  Detail & Related papers  (2022-03-25T08:12:01Z)
• A Survey of Evolutionary Multi-Objective Clustering Approaches [0.0]
  We analyze the algorithms based on the features and components presented in the proposed general architecture of the evolutionary multi-objective clustering. It is essential to observe these aspects besides specific clustering properties when designing new approaches or selecting/using the existing ones.
  arXiv  Detail & Related papers  (2021-10-15T13:53:12Z)
• Transfer Learning Based Co-surrogate Assisted Evolutionary Bi-objective Optimization for Objectives with Non-uniform Evaluation Times [9.139734850798124]
  Multiobjetive evolutionary algorithms assume that each objective function can be evaluated within the same period of time. A co-surrogate is adopted to model the functional relationship between the fast and slow objective functions. A transferable instance selection method is introduced to acquire useful knowledge from the search process of the fast objective.
  arXiv  Detail & Related papers  (2021-08-30T16:10:15Z)
• 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)
• On the Global Optimality of Model-Agnostic Meta-Learning [133.16370011229776]
  Model-a meta-learning (MAML) formulates meta-learning as a bilevel optimization problem, where the inner level solves each subtask based on a shared prior. We characterize optimality of the stationary points attained by MAML for both learning and supervised learning, where the inner-level outer-level problems are solved via first-order optimization methods.
  arXiv  Detail & Related papers  (2020-06-23T17:33:14Z)

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.