Randomness to Escape Local Optima
Definition
A principle from optimization algorithms: injecting randomness, especially early in a search, prevents getting stuck at a merely-good local optimum and enables jumps toward better global solutions; used as an analogy for how disruption boosts human creativity.
Cast within
No topic-region cast yet — this appears once Randomness to Escape Local Optima's compiled claims are aligned into a topic region's argument tree.
Claims mentioning Randomness to Escape Local Optima (1)
Your notes
Loading notes...