Reproduce “Optimal resampling for the noisy OneMax problem” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Jialin Liu, Michael Fairbank, Diego Pérez-Liébana, Simon M. Lucas
RMHC studies noisy OneMax, seeking an all-ones n-bit string by flipping one bit, with Gaussian evaluation noise of variance 1. It averages r evaluations for each current and proposed string, trading steadier comparisons for 2r calls per move. Markov-chain calculations and experiments find evaluation-minimizing r rises with dimension; at n=10, r=2 costs more than r=1. Analysis assumes all-zero initialization and no stored statistic.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.