2 articles
How repeatedly stepping in the direction of steepest descent minimizes functions in millions of dimensions — and trains essentially every modern neural network.
Why naive recursive Fibonacci takes billions of calls, how remembering answers collapses it to n, and how the same trick solves edit distance and knapsack.