Partial derivatives
1.2.3· AI-ML › Calculus & Optimization Basics
WHY hum isko zaroori samjhein?
ML mein almost har loss function bahut saare parameters pe depend karta hai ek saath: . Model train karne ke liye hum poochte hain "loss har weight ke liye alag-alag kaise respond karta hai?" taaki hum jaanein har weight ko kis direction mein push karein. Yeh per-variable slope hi partial derivative hai, aur inhe sab milake ek vector mein rakhne se gradient banta hai jis par gradient descent chalta hai.
HOW isko compute karein (mechanical rule)
WHAT karna hai: baaki har variable ko ek number maano aur normally differentiate karo.
WHY yeh kaam karta hai: upar wala limit sirf ko change karta hai; kabhi nahi hilta, toh derivative ke point of view se bilkul usi tarah behave karta hai jaise constant ya karta.
First principles se derivation
Maan lo . sidha limit se compute karo.
Yeh step kyun? Hum ko har ki jagah plug karte hain, lekin ko waisa hi rehne dete hain (yahi definition hai).
Yeh step kyun? ko expand karo taaki woh terms cancel ho jayein jo contain nahi karti.
Yeh step kyun? aur cancel ho jaate hain, hum factor karte hain, cancel karte hain, phir jaane dete hain. term gayab ho gayi kyunki usme koi nahi tha — -direction mein uska slope zero hai.
✅ Shortcut se same answer: ko differentiate karo ( constant ki tarah), aur ko .

Dual coding: surface ko plane const se slice karo. Us slice par ek 1-D curve milti hai; uska slope hai. const se slice karne par milta hai.
Worked examples
Common mistakes
Flashcards
kya measure karta hai?
compute karte waqt ko kaise treat karte ho?
ki limit definition
Gradient kya hai?
ke liye,
mein koi na wali term kyun vanish ho jaati hai?
Recall Feynman: 12-saal ke bacche ko explain karo
Ek pahadi jagah imagine karo jahan tumhari height depend karti hai ki tum kitna east () aur kitna north () par khade ho. Partial derivative yeh hai: "Agar main sirf EK step EAST lun (north nahi), toh kya main upar jaata hun ya neeche, aur kitna steep hai?" Tum sirf east–west slope dekh ke jawab dete ho aur us waqt north–south tilt ko bilkul ignore karte ho. Phir north face karke wahi karo, aur ab tumhein dono directions mein slope pata hai — itna kaafi hai ki sabse tezi se neeche jaane ka raasta nikaal sako. Yahi "sabse tezi se neeche jaane ka raasta" exactly woh hai jo computer seekhne ke liye use karta hai.
Connections
- 1.2.02-Derivatives-single-variable — 1-D case jisme partial reduce hota hai.
- 1.2.04-Gradient-and-directional-derivatives — partials mein assembled.
- 1.2.05-Chain-rule-multivariable — backpropagation ke liye zaroori.
- 1.3.01-Gradient-descent — in partials ko use karke weights update karta hai.
- Linear-regression — Example 3 uska exact learning rule hai.