Hacker News new | past | comments | ask | show | jobs | submit login

Your description makes the approach sound like applying ca 1980s simulated annealing, also a form of gradient descent. Am I missing something?



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.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: