Talk:Random search

There is a paper by Wallace about using the Walsh-Hadamard transform to generate random numbers with a Gaussian distribution. The Gaussian distribution is directly related to picking a point uniformly at random on the surface of a hypersphere. You can use the Walsh-Hadamard transform together with random permutations to generate random points on the hypersphere. Both the WHT and random permutations leave vector length unchanged. A sequence of random permutations and WHT's does interesting things. Or earlier even: https://archive.org/details/bitsavers_mitreESDTe69266ANewMethodofGeneratingGaussianRando_2706065 — Preceding unsigned comment added by 123.16.157.60 (talk) 00:51, 26 March 2016 (UTC)

In this article, it states that random search works by searching in the hypersphere surrounding the current position in the solution space. While this may true in the method of Rastrigin, this article is about the family of search algorithms under the umbrella of random search. This method of searching nearby solutions ought to be called something like random local search, so as to permit uniform global random search to exist under the umbrella of random search. Uniform global random search meaning that every possible solution in the search space has equal likelihood of being selected in a given iteration. -- Sohrab

I agree with Sohrab. Even though Rastrigin used the term "Random Search", the algorithm described here would nowadays be called a (black-box) Hill-Climber. And nowadays, Random Search just means drawing independent samples from the space, uninformed by previous samples. Some arbitrary examples: So, I would propose to move some of the contents of this page to the wikipedia Hill_Climbing page, and on this page, instead describe Random Search in the modern sense. - Jamesmichaelmcdermott
 * https://dl.acm.org/doi/pdf/10.5555/2188385.2188395
 * https://en.wikipedia.org/wiki/Hill_climbing (describes the same algorithm as presented here)
 * https://en.wikipedia.org/wiki/Genetic_algorithm (Ctrl-F for "random search")


 * 1) Complexity

In a list of length n with unsorted elements, finding an element with specified key has a certain complexity. What is this complexity? (The issue is that you probably try several elements twice.) — Preceding unsigned comment added by 2A02:908:1658:2740:D06C:6CC:641A:A127 (talk) 15:57, 12 May 2022 (UTC)