Variance Reduction for Better Sampling in Continuous Domains

April 24, 2020 ยท Declared Dead ยท ๐Ÿ› Parallel Problem Solving from Nature

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Laurent Meunier, Carola Doerr, Jeremy Rapin, Olivier Teytaud arXiv ID 2004.11687 Category cs.NE: Neural & Evolutionary Cross-listed cs.LG, stat.ML Citations 8 Venue Parallel Problem Solving from Nature Last Checked 4 months ago
Abstract
Design of experiments, random search, initialization of population-based methods, or sampling inside an epoch of an evolutionary algorithm use a sample drawn according to some probability distribution for approximating the location of an optimum. Recent papers have shown that the optimal search distribution, used for the sampling, might be more peaked around the center of the distribution than the prior distribution modelling our uncertainty about the location of the optimum. We confirm this statement, provide explicit values for this reshaping of the search distribution depending on the population size $ฮป$ and the dimension $d$, and validate our results experimentally.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Neural & Evolutionary

๐Ÿ”ฎ ๐Ÿ”ฎ The Ethereal

LSTM: A Search Space Odyssey

Klaus Greff, Rupesh Kumar Srivastava, ... (+3 more)

cs.NE ๐Ÿ› IEEE TNNLS ๐Ÿ“š 6.0K cites 11 years ago

Died the same way โ€” ๐Ÿ‘ป Ghosted