gradient descent

5 Mar 2016 · 4 min
4:09

A walkthrough of how gradient descent minimizes a cost function by repeatedly updating a parameter θ using the rule θ←θ−α·m, where m is the slope of the curve. Negative slopes push θ upward, positive slopes push it downward, and when the slope hits zero the algorithm stops. Step size shrinks as you approach the minimum, preventing overshooting.

Chapters

More from Conor

0:40
youtube.com

3 methods of deriving torus volume

2mo ago
1:15
youtube.com

3 methods of deriving torus volume using integration

2mo ago
2:36
youtube.com

torus volume

3mo ago
youtube.com

Compass LangChain Toolkit

1y ago
youtube.com

Intro to LangChain Compass agent toolkit

1y ago
youtube.com

Agent Kit LLM API

1y ago
youtube.com

Converting cURL to Python Programs 🐍

1y ago
youtube.com

Uniswap Transaction Walkthrough 💸

1y ago
youtube.com

Introduction to Transact by Compass Labs

1y ago
youtube.com

Developer Quick Start to Compass API in Python 🐍

1y ago
youtube.com

randomness pays

4y ago
See all content