Computer Scientists Discover Limits of Major Research Algorithm | Quanta Magazine
The most widely used technique for finding the largest or smallest values of a math function turns out to be a fundamentally difficult computational problem.
Computer Scientists Discover Limits of Major Research Algorithm | Quanta Magazine Home Computer Scientists Discover Limits of Major Research Algorithm Read Later Share Copied! Comments Read Later Read Later computational complexity Computer Scientists Discover Limits of Major Research Algorithm By Nick Thieme August 17, 2021 The most widely used technique for finding the largest or smallest values of a math function turns out to be a fundamentally difficult computational problem. Read Later A new result in complexity theory establishes why the gradient descent algorithm cannot solve some kinds
related reading
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Shtetl-Optimizedscottaaronson.blog
- Computational Complexityblog.computationalcomplexity.org
- Gradient descent - Wikipediaen.wikipedia.org
- SIAG on Optimization Views and News 33(1)siagoptimization.github.io
- Mathematical optimization - Wikipediaen.wikipedia.org
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- P versus NP problem - Wikipediaen.wikipedia.org
- Algorithm - Wikipediaen.wikipedia.org
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- P vs. NP for Dummiesscottaaronson.blog
- A Visual Explanation of Gradient Descent Methods (Momentum, AdaGrad, RMSProp, Adam) | Towards Data Sciencetowardsdatascience.com