mlsanityData to 14 Oct 2026

Variance Reduction for Better Sampling in Continuous Domains

arXiv 2004.11687 ↗First posted 24 Apr 2020cs.NE cs.LG stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 24 Apr 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.