4 ms·

This is definitely not the case for general neural networks, though.

• 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 ago
      Right. Hence the word 'reliably'.