Talk:Random search
| This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||
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:
- 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")
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
Content Disclaimer
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.
- The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
- There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
- It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
- Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
- Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.