Do Random and Chaotic Sequences Really Cause Different PSO Performance?

February 09, 2023 Β· Declared Dead Β· πŸ› GECCO Companion

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Paul Moritz NΓΆrenberg, Hendrik Richter arXiv ID 2303.14099 Category physics.soc-ph Cross-listed cs.NE Citations 2 Venue GECCO Companion Last Checked 3 months ago
Abstract
Our topic is performance differences between using random and chaos for particle swarm optimization (PSO). We take random sequences with different probability distributions and compare them to chaotic sequences with different but also with same density functions. This enables us to differentiate between differences in the origin of the sequences (random number generator or chaotic nonlinear system) and statistical differences expressed by the underlying distributions. Our findings (obtained by evaluating the PSO performance for various benchmark problems using statistical hypothesis testing) cast considerable doubt on previous results which compared random to chaos and suggested that the choice leads to intrinsic differences in performance.
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 β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted