Timeline for What is the difference between Stochastic Hill Climbing and Simulated Annealing?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 24, 2020 at 10:10 | comment | added | nbro | @yaminoyuki I think SHC can still get stuck in a local minimum. This should be due to the fact that SHC never takes a "downhill move". In any case, the book says that, in some "landscapes", SHC may find better solutions than the usual HC algorithm, and this may be true because SHC doesn't always choose the same uphill move and so has more stochasticity in it. | |
| Nov 23, 2020 at 22:45 | comment | added | yaminoyuki | thank you very much, now it is clear to me, one thing left, since SHC chooses only random uphill moves, does this algorithm avoid local optima? | |
| Nov 23, 2020 at 22:41 | vote | accept | yaminoyuki | ||
| Nov 23, 2020 at 20:56 | history | answered | nbro | CC BY-SA 4.0 |