Local Maximum
Version 1.0.0 · Updated 2026-07-30
CORE DEFINITION
In hill-climbing algorithms, you climb to a peak, all around is downhill, you think you've reached the highest point (global maximum), but there is actually a higher mountain nearby (global maximum), but to get there you must first go downhill (temporarily worse).
SCAFFOLDING EFFECT
Reduce cognitive load
- Transformation courage: When you can't improve performance even with more effort, you may be stuck at a local maximum. You must dare to accept short-term performance decline (downhill) to switch tracks (find a higher mountain), otherwise you can only engage in low-level involution.
Anchor fast decisions
In hill-climbing algorithms, reaching a peak (local maximum) makes you think you've reached the top, all around is downhill, but you need to go downhill first to reach a higher mountain (global maximum). The mechanism is that the 'instinct for improvement' locks you into a suboptimal point.
MINIMUM ACTION
In progress 0/3Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Maximum_and_minimumverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS