The Complexity of Gradient Descent: CLS = PPAD $\cap$ PLS · HackerPapers discussions

The Complexity of Gradient Descent: CLS = PPAD $\cap$ PLS — mentioned by eterevsky

Sun, 30 Jul 2023 12:37:34 GMT

Here's the original paper: https://arxiv.org/abs/2011.01929 And here are the complexity classes that are mentioned in the abstract: https://complexityzoo.net/Complexity_Zoo:P#ppad and https://complexityzoo.net/Complexity_Zoo:P#pls.

Paper and discussion history. A mention is not an endorsement.

The Complexity of Gradient Descent: CLS = PPAD $\cap$ PLS — mentioned by ShamelessC

Sat, 29 Jul 2023 15:43:48 GMT

https://arxiv.org/abs/2011.01929 TFP

Paper and discussion history. A mention is not an endorsement.

The Complexity of Gradient Descent: CLS = PPAD $\cap$ PLS — mentioned by belter

Fri, 20 Aug 2021 20:14:11 GMT

"...It is hard to overstate the importance of Gradient Descent. As noted by Jin et al. [2021], “Machine learning algorithms generally arise via formulations as optimization problems, and,despite a massive classical toolbox of sophisticated optimization algorithms and a major modern effort to further develop that toolbox, the simplest algorithms—gradient descent, which dates to the 1840s [Cauchy, 1847] and stochastic gradient descent, which dates to the 1950s [Robbins and Monro, 1951]—reign supreme in machine learning.”..." "Our main result is to show that finding a point where Gradient…

Paper and discussion history. A mention is not an endorsement.

The Complexity of Gradient Descent: CLS = PPAD $\cap$ PLS — HN submission

Fri, 20 Aug 2021 20:14:11 GMT

The Complexity of Gradient Descent: CLS = PPAD ∩ PLS

2 points; 1 discussion reply on HN. Paper and source history. A submission is not an endorsement.