中文
相关论文

相关论文: Can Search-Based Testing with Pareto Optimization …

200 篇论文

Multi-party multi-objective optimization problems (MPMOPs) require consensus among autonomous decision makers and therefore differ from flattened many-objective formulations. Existing runtime theory for multi-objective evolutionary…

人工智能 · 计算机科学 2026-05-19 Xiaolei Fang , Peilan Xu , Wenjian Luo

The experiments conducted in previous studies demonstrated the successful performance of BSA and its non-sensitivity toward the several types of optimisation problems. This success of BSA motivated researchers to work on expanding it, e.g.,…

神经与进化计算 · 计算机科学 2019-12-03 Bryar A. Hassan , Tarik A. Rashid

We present SEBOOST, a technique for boosting the performance of existing stochastic optimization methods. SEBOOST applies a secondary optimization process in the subspace spanned by the last steps and descent directions. The method was…

计算机视觉与模式识别 · 计算机科学 2016-09-05 Elad Richardson , Rom Herskovitz , Boris Ginsburg , Michael Zibulevsky

We consider the problem of black-box multi-objective optimization (MOO) using expensive function evaluations (also referred to as experiments), where the goal is to approximate the true Pareto set of solutions by minimizing the total…

机器学习 · 计算机科学 2021-11-05 Syrine Belakaria , Aryan Deshwal , Janardhan Rao Doppa

The Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is one of the most prominent algorithms to solve multi-objective optimization problems. Recently, the first mathematical runtime guarantees have been obtained for this algorithm,…

人工智能 · 计算机科学 2023-08-22 Sacha Cerf , Benjamin Doerr , Benjamin Hebras , Yakob Kahane , Simon Wietheger

Stochastic multi-objective optimization (SMOOP) requires ranking multivariate distributions; yet, most empirical studies perform scalarization, which loses information and is unreliable. Based on the optimal transport theory, we introduce…

机器学习 · 计算机科学 2025-11-18 Robin van der Laag , Hao Wang , Thomas Bäck , Yingjie Fan

Intrusion Detection Systems (IDS) are developed to protect the network by detecting the attack. The current paper proposes an unsupervised feature selection technique for analyzing the network data. The search capability of the…

神经与进化计算 · 计算机科学 2019-05-17 Chanchal Suman , Somanath Tripathy , Sriparna Saha

Search-based software testing (SBST) of Simulink models helps find scenarios that demonstrate that the system can reach a state that violates one of its requirements. However, many SBST techniques for Simulink models rely on requirements…

Unit testing is critical to the software development process, ensuring the correctness of basic programming units in a program (e.g., a method). Search-based software testing (SBST) is an automated approach to generating test cases. SBST…

软件工程 · 计算机科学 2024-01-05 Zhichao Zhou , Yuming Zhou , Chunrong Fang , Zhenyu Chen , Xiapu Luo , Jingzhu He , Yutian Tang

Neural architecture search (NAS) has shown great promise in designing state-of-the-art (SOTA) models that are both accurate and efficient. Recently, two-stage NAS, e.g. BigNAS, decouples the model training and searching process and achieves…

计算机视觉与模式识别 · 计算机科学 2021-04-15 Dilin Wang , Meng Li , Chengyue Gong , Vikas Chandra

Many modern machine learning applications, such as multi-task learning, require finding optimal model parameters to trade-off multiple objective functions that may conflict with each other. The notion of the Pareto set allows us to focus on…

最优化与控制 · 数学 2022-09-05 Mao Ye , Qiang Liu

The success of neural architecture search (NAS) has historically been limited by excessive compute requirements. While modern weight-sharing NAS methods such as DARTS are able to finish the search in single-digit GPU days, extracting the…

机器学习 · 计算机科学 2021-12-28 Miroslav Fil , Binxin Ru , Clare Lyle , Yarin Gal

Stochastic Multi-Objective Optimization (SMOO) is critical for decision-making trading off multiple potentially conflicting objectives in uncertain environments. SMOO aims at identifying the Pareto frontier, which contains all mutually…

机器学习 · 计算机科学 2026-04-02 Jinzhao Li , Nan Jiang , Yexiang Xue

In presence of multiple objectives to be optimized in Search-Based Software Engineering (SBSE), Pareto search has been commonly adopted. It searches for a good approximation of the problem's Pareto optimal solutions, from which the…

软件工程 · 计算机科学 2022-02-09 Tao Chen , Miqing Li

Together with the NSGA-II and SMS-EMOA, the strength Pareto evolutionary algorithm 2 (SPEA2) is one of the most prominent dominance-based multi-objective evolutionary algorithms (MOEAs). Different from the NSGA-II, it does not employ the…

神经与进化计算 · 计算机科学 2025-08-12 Yasser Alghouass , Benjamin Doerr , Martin S. Krejca , Mohammed Lagmah

Deploying deep learning models requires taking into consideration neural network metrics such as model size, inference latency, and #FLOPs, aside from inference accuracy. This results in deep learning model designers leveraging…

机器学习 · 计算机科学 2024-08-20 Yiyang Zhao , Linnan Wang , Tian Guo

We propose a new Pareto Local Search Algorithm for the many-objective combinatorial optimization. Pareto Local Search proved to be a very effective tool in the case of the bi-objective combinatorial optimization and it was used in a number…

数据结构与算法 · 计算机科学 2017-12-15 Andrzej Jaszkiewicz

Recent breakthroughs in Neural Architectural Search (NAS) have achieved state-of-the-art performance in many tasks such as image classification and language understanding. However, most existing works only optimize for model accuracy and…

BPSO algorithm is a swarm intelligence optimization algorithm, which has the characteristics of good optimization effect, high efficiency and easy to implement. In recent years, it has been used to optimize a variety of machine learning and…

神经与进化计算 · 计算机科学 2024-07-26 Qing Zhao , Chengkui Zhang , Hao Li , Ting Ke

In this manuscript, we address continuous unconstrained multi-objective optimization problems and we discuss descent type methods for the reconstruction of the Pareto set. Specifically, we analyze the class of Front Descent methods, which…

最优化与控制 · 数学 2026-04-08 Matteo Lapucci , Pierluigi Mansueto , Davide Pucci