simulated annealing
An optimization technique, originating in physics, that searches a solution space broadly and randomly at 'high temperature' then narrows to small refinements as it 'cools.'
As defined in Alison Gopnik
Where it comes up · 2
Most important claims · 2 of 2Search all claims for “simulated annealing” →
- For solving high-dimensional problems with many possible solutions, computer science shows the best strategy is to start with a wide, hot, random search and gradually cool into a focused, low-temperature search (simulated annealing); childhood is evolution's way of implementing this, beginning with noisy bouncy exploration before cooling into focused adult exploitation, because the two strategies cannot be done simultaneously and trade off against each other.308 | Alison Gopnik on Children, AI, and Modes of Thinking
- Learning resembles simulated annealing: a high-temperature search bounces randomly through the solution space trying wild ideas, while a low-temperature search makes small incremental changes; young children operate like high-temperature random search, whereas mature scientists must balance both, and big paradigm shifts come from improbable, high-temperature ideas.Alison Gopnik