A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1606.06041v1.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Bandit-Based Random Mutation Hill-Climbing
[article]
<span title="2016-06-20">2016</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
The Random Mutation Hill-Climbing algorithm is a direct search technique mostly used in discrete domains. It repeats the process of randomly selecting a neighbour of a best-so-far solution and accepts the neighbour if it is better than or equal to it. In this work, we propose to use a novel method to select the neighbour solution using a set of independent multi- armed bandit-style selection units which results in a bandit-based Random Mutation Hill-Climbing algorithm. The new algorithm
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1606.06041v1">arXiv:1606.06041v1</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mku75irl4jduzfckpyehnxhw6e">fatcat:mku75irl4jduzfckpyehnxhw6e</a>
</span>
more »
... antly outperforms Random Mutation Hill-Climbing in both OneMax (in noise-free and noisy cases) and Royal Road problems (in the noise-free case). The algorithm shows particular promise for discrete optimisation problems where each fitness evaluation is expensive.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191019223612/https://arxiv.org/pdf/1606.06041v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/98/69/9869e75b38226b24f10e18a15e5cafe9cafe94a1.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1606.06041v1" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>