| 释义 |
- See also
- References
Stochastic hill climbing is a variant of the basic hill climbing method. While basic hill climbing always chooses the steepest uphill move, "stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphill move."[1][2]See also- Stochastic gradient descent
References1. ^{{cite book |author1=Russell, S. |author2=Norvig, P. |title=Artificial Intelligence: A Modern Approach |publisher=Prentice Hall |isbn= 0136042597 |url=https://books.google.com/books?id=8jZBksh-bUMC |year=2010 |edition=3rd}}
2. ^{{cite book |author=Dawkins, R. |title=The Selfish Gene |year=2006 |edition=3rd |publisher=Oxford University Press |isbn=0199291144 |url=https://books.google.com/books?id=0ICKantUfvoC&printsec=frontcover}}
{{DEFAULTSORT:Stochastic Hill Climbing}}{{Compu-AI-stub}} 1 : Optimization algorithms and methods |