Y
Hacker News
new
|
ask
|
show
|
jobs
by
gumby
1112 days ago
Your description makes the approach sound like applying ca 1980s simulated annealing, also a form of gradient descent. Am I missing something?
1 comments
ska
1112 days ago
This doesn't really sound like SA, which is a principled approach to avoid the local min problem in descent algorithms and end up with a true global optimization. The general result is clean and impractical, the approximations hard to analyze.
link