arrow
返回

Desperately searching for something

delete2023-10-01
delete0
delete
OA
AI
C
Clive Bowman
P
Peter Grindrod *
DOI:10.1016/j.cnsns.2023.107339delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
There is a growing interest in novelty search : that is, in sampling a parameter space to search for radical or unexpected behaviour(s), occurring as a consequence of parameter choice, being input to some downstream complex system, process, or service that will not yield to analysis, without imposing any specific pre-ordained objective function, or fitness function to be optimised. We mean parameter in the widest sense, including system learnables, non-autonomous forcing, sequencing and all inputs.Depending upon the nature of the underlying parameter space of interest one may adopt a rather wide range of search algorithms. We do consider that this search activity has meta-objectives, though: one is of achieving diversity (efficiently reaching out across the space in some way); and one is of achieving some minimum density (not leaving out large unexplored holes). These are in tension. In general, the computational costs of both of these qualities become restrictive as the dimension of the parameter spaces increase; and consequently their balance is harder to maintain. We may also wish for a substantial random element of search to provide some luck in discovery and to avoid any naive preset sampling patterns.We consider archive-based methods within a range of spaces: finite discrete spaces, where the problem is straightforward (provided we are patient with the random element); Euclidean spaces, of increasing dimension, that become very lonely places; and infinite dimensional spaces. Our aim is to discuss a raft of distinctive search concepts, that respond to identified challenges, and rely on a rather diverse range of mathematical ideas. This arms practitioners with a range of highly practical methods.However applications requiring novelty search arise, one should avoid rushing to code-up a standard evolving search algorithm and instead give some thought to the nature and requirements of the search: there is a range of effective options available. We give some considered advice.& COPY; 2023 Published by Elsevier B.V.
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Communications in Nonlinear Science and Numerical Simulation 封面图
Communications in Nonlinear Science and Numerical Simulation
IF:
3.8
论文数:
9.3K
被引数:
1.8W

机构

U
university of oxford
学者数:
9.8W
论文数: 8.6W
被引数: 137
引用论文

引用论文

A review of novelty detection新颖性检测综述
err2014-06-01
err1.2K
PREAI
errPimentel, Marco A. F.; Clifton, David A.; Clifton, Lei; Tarassenko, Lionel
err分享
err收藏
Ion-selective asymmetric carbon electrodes for enhanced capacitive deionization
err2018-01-01
err0
errOAAI
errTingting Yan; Baoxia Xu; Jianping Zhang; Liyi Shi; Dengsong Zhang
err分享
err收藏
Breeding programs to transmitAsparagus virus 1resistance
err2018-11-01
err0
PREAI
errS. Plath; R. Krämer; E. Lantos; T. Nothnagel
err分享
err收藏
Reciprocity attacks
err2011-07-20
err0
PREAI
errFeng Zhu; Sandra Carpenter; Ajinkya Kulkarni; Swapna Kolimi
err分享
err收藏
没有更多内容