2 ms·
If gradient descent is working reliably, the problem is convex. See the sibling comments for the intuition for large dimensional spaces.
by robotresearcher 11y ago
If gradient descent is working reliably, the problem is convex. See the sibling comments for the intuition for large dimensional spaces.
- gipp 11y ago"The problem is convex" and "the algorithm is unlikely to get stuck in a local minimum on realistic problems" are very different things.
- robotresearcher 11y agoRight. Hence the word 'reliably'.