中文
相关论文

相关论文: A Decomposition-Based Many-Objective Evolutionary …

200 篇论文

Filter pruning is a common method to achieve model compression and acceleration in deep neural networks (DNNs).Some research regarded filter pruning as a combinatorial optimization problem and thus used evolutionary algorithms (EA) to prune…

神经与进化计算 · 计算机科学 2022-11-04 Xuhua Li , Weize Sun , Lei Huang , Shaowu Chen

Multi-objective evolutionary algorithms (MOEAs) have become essential tools for solving multi-objective optimization problems (MOPs), making their running time analysis crucial for assessing algorithmic efficiency and guiding practical…

神经与进化计算 · 计算机科学 2025-07-04 Han Huang , Tianyu Wang , Chaoda Peng , Tongli He , Zhifeng Hao

Feature selection plays a pivotal role in the data preprocessing and model-building pipeline, significantly enhancing model performance, interpretability, and resource efficiency across diverse domains. In population-based optimization…

As the feature size of semiconductor technology shrinks to 10 nm and beyond, the multiple patterning lithography (MPL) attracts more attention from the industry. In this paper, we model the layout decomposition of MPL as a generalized graph…

神经与进化计算 · 计算机科学 2023-04-11 Yu Chen , Yongjian Xu , Ning Xu

Understanding the search dynamics of multiobjective evolutionary algorithms (MOEAs) is still an open problem. This paper extends a recent network-based tool, search trajectory networks (STNs), to model the behavior of MOEAs. Our approach…

神经与进化计算 · 计算机科学 2022-07-01 Yuri Lavinas , Claus Aranha , Gabriela Ochoa

This paper explores the enhancement of solution diversity in evolutionary algorithms (EAs) for the maximum matching problem, concentrating on complete bipartite graphs and paths. We adopt binary string encoding for matchings and use Hamming…

神经与进化计算 · 计算机科学 2024-04-19 Jonathan Gadea Harder , Aneta Neumann , Frank Neumann

In the past few decades, many multiobjective evolutionary optimization algorithms (MOEAs) have been proposed to find a finite set of approximate Pareto solutions for a given problem in a single run, each with its own structure. However, in…

神经与进化计算 · 计算机科学 2024-04-30 Xi Lin , Xiaoyuan Zhang , Zhiyuan Yang , Qingfu Zhang

Most optimization-based community detection approaches formulate the problem in a single or bi-objective framework. In this paper, we propose two variants of a three-objective formulation using a customized non-dominated sorting genetic…

神经与进化计算 · 计算机科学 2020-05-08 Shaik Tanveer ul Huq , Vadlamani Ravi , Kalyanmoy Deb

In contrast to single-objective optimization (SOO), multi-objective optimization (MOO) requires an optimizer to find the Pareto frontier, a subset of feasible solutions that are not dominated by other feasible solutions. In this paper, we…

机器学习 · 计算机科学 2024-08-13 Yiyang Zhao , Linnan Wang , Kevin Yang , Tianjun Zhang , Tian Guo , Yuandong Tian

When solving constrained multi-objective optimization problems, an important issue is how to balance convergence, diversity and feasibility simultaneously. To address this issue, this paper proposes a parameter-free constraint handling…

神经与进化计算 · 计算机科学 2017-11-22 Ke Li , Renzhi Chen , Guangtao Fu , Xin Yao

The presence of functional diversity within a group has been demonstrated to lead to greater robustness, higher performance and increased problem-solving ability in a broad range of studies that includes insect groups, human groups and…

神经与进化计算 · 计算机科学 2018-04-23 Emma Hart , Andreas S. W. Steyven , Ben Paechter

Real-world problems are often comprised of many objectives and require solutions that carefully trade-off between them. Current approaches to many-objective optimization often require challenging assumptions, like knowledge of the…

神经与进化计算 · 计算机科学 2023-07-07 Jackson Dean , Nick Cheney

Two important characteristics of multi-objective evolutionary algorithms are distribution and convergency. As a classic multi-objective genetic algorithm, NSGA-II is widely used in multi-objective optimization fields. However, in NSGA-II,…

神经与进化计算 · 计算机科学 2019-01-04 Xinwu Yang , Guizeng You , Chong Zhao , Mengfei Dou , Xinian Guo

This paper presents innovative approaches to optimization problems, focusing on both Single-Objective Multi-Modal Optimization (SOMMOP) and Multi-Objective Optimization (MOO). In SOMMOP, we integrate chaotic evolution with niching…

神经与进化计算 · 计算机科学 2024-11-13 Xiang Meng

Multi-objective evolutionary algorithms (MOEAs) are among the most widely and successfully applied optimizers for multi-objective problems. However, to store many optimal trade-offs (the Pareto optima) at once, MOEAs are typically run with…

神经与进化计算 · 计算机科学 2025-09-03 Benjamin Doerr , Martin S. Krejca , Simon Wietheger

Differential evolution (DE) is a well-known type of evolutionary algorithms (EA). Similarly to other EA variants it can suffer from small populations and loose diversity too quickly. This paper presents a new approach to mitigate this…

神经与进化计算 · 计算机科学 2020-02-10 Jakub M. Tomczak , Ewelina Weglarz-Tomczak , Agoston E. Eiben

Multiobjective evolutionary algorithms (MOEAs) have been successfully applied to a number of constrained optimization problems. Many of them adopt mutation and crossover operators from differential evolution. However, these operators do not…

神经与进化计算 · 计算机科学 2019-11-11 Wei Huang , Tao Xu , Kangshun Li , Jun He

Multi-objective evolutionary algorithms (MOEAs) have emerged as powerful tools for solving complex optimization problems characterized by multiple, often conflicting, objectives. While advancements have been made in computational efficiency…

神经与进化计算 · 计算机科学 2024-08-09 Zherui Zhang , Fan Yang , Ran Cheng , Yuxin Ma

Multi-Objective Alignment (MOA) aims to align LLMs' responses with multiple human preference objectives, with Direct Preference Optimization (DPO) emerging as a prominent approach. However, we find that DPO-based MOA approaches suffer from…

机器学习 · 计算机科学 2025-12-09 Moxin Li , Yuantao Zhang , Wenjie Wang , Wentao Shi , Zhuo Liu , Fuli Feng , Tat-Seng Chua

Differential Evolution (DE) is a renowned optimization stratagem that can easily solve nonlinear and comprehensive problems. DE is a well known and uncomplicated population based probabilistic approach for comprehensive optimization. It has…

神经与进化计算 · 计算机科学 2015-06-22 Sandeep Kumar , Vivek Kumar Sharma , Rajani Kumari