Visual walkthrough — Gradient descent and variants — convergence analysis
4.10.20 · D2· Maths › Advanced Topics (Elite Level) › Gradient descent and variants — convergence analysis
Hum seedhe steps mein build karte hain. Har step mein likha hai KYA karte hain, KYUN karte hain, aur KAISA DIKHTA HAI (ek picture). Pictures padhna — woh argument carry karti hain.
Step 1 — Woh ek symbol jis par sab kuch tika hai: the gradient arrow
KYA. Humare paas ek function hai jo ek point leta hai aur ek height (ek number) return karta hai. Ek landscape socho: floor par har jagah ki ek height hai. Hum sabse neeche waali jagah dhundna chahte hain.
Gradient, jise likhte hain, ek arrow hai jo floor par point par draw hota hai. Yeh us direction mein point karta hai jahan height sabse tezi se badhti hai, aur iska length batata hai kitni tezi se.
KYUN yahi arrow aur koi direction nahi? Kyunki "downhill-steepest" woh exact direction hai jo chalne ki per unit distance mein humari height sabse zyada kam karta hai. Tamam directions mein se jinka length 1 hai, height mein change ka amount hai — dono arrows ka dot product.
PICTURE.
Red arrow (uphill) aur uska blue flip (downhill) dekho. Green dashed rings level sets hain — equal height wale spots, jaise map par contour lines. Notice karo ki arrow hamesha us ring par perpendicular hai jis par woh baitha hai: yeh "steepest" ka visual signature hai.
Step 2 — ki wildness ko bound karna: do curvature walls
KYA. Progress ka koi vaada karne ke liye, hum ko arbitrarily wild hone se rokna chahte hain. Hum uski curvature (slope khud kitni tezi se change hoti hai) ko do numbers ke beech pin karte hain: ek ceiling aur ek floor .
KYUN do walls? Ceiling hume overshoot karne se rokta hai (agar hume nahi pata floor kitna sharply upar jhuk sakta hai, toh hum safe step nahi chun sakte). Floor valley ko bottom par infinitely flat hone se rokta hai (flat bottom matlab gradient khatam ho jaata hai aur hum forever crawl karte hain). Ek wall safety control karti hai, doosri speed.
PICTURE.
Dark blue curve hai . Yellow parabola (curvature ) ise upar se hug karta hai; green parabola (curvature ) ise neeche se hug karta hai. sandwich mein phansa hai. Unka ratio
condition number hai — matlab do walls ek saath hain (ek perfect bowl); bada matlab ek lamba patla trough.
Step 3 — The Descent Lemma: hill ko ek parabola se replace karna jise hum minimize kar sakein
KYA. Hum ceiling wall ko ek usable inequality mein badal dete hain. Ek point se shuru karke aur kisi bhi doosre point ko dekhte hue:
KYUN yeh build karein? Kyunki hum true foggy hill ko minimize nahi kar sakte — lekin hum ek parabola ko exactly, ek hi shot mein minimize kar sakte hain. Agar hum is over-estimating parabola ko lower karte hain, toh humne ko bhi provably lower kiya. Yahi har proof ka engine hai.
Yeh kahan se aata hai — concrete do-line sketch. Maano . Fundamental theorem of calculus kehta hai ki total height change, se tak ke segment par slope ka running sum hai:
Dono sides se flat "linear guess" subtract karo aur ceiling wall use karo (gradient at most drift kar sakta hai distance par):
Last integral exactly wahi hai jahan factor paida hota hai.
PICTURE.
Blue curve hai ; yellow parabola Descent-Lemma bound hai jo black dot par anchored hai. Woh par touch karte hain (bound wahan exact hai) aur parabola baaki jagah upar rehta hai. Iska sabse neecha point (yellow star) woh jagah hai jahan agla step land karta hai.
Step 4 — GD ka ek step: parabola hume kitna drop karne deta hai
KYA. Actual GD move ko Descent Lemma mein plug karo. Is step par gradient arrow ke liye likho.
KYUN yeh magic step reveal karta hai. Net drop hai . ki function mein yeh ek upside-down parabola hai: bahut chhota → tiny step; bahut bada → penalty gain kha jaati hai. Iska peak par hai, jo yeh clean guarantee deta hai
PICTURE.
Curve drop per step ko step size ke against plot karta hai. Yeh par zero hai, par peak karta hai (yellow star), aur par wapas zero cross karta hai (red dot) — jiske baad "drop" negative ho jaata hai, matlab bound kisi decrease ka vaada nahi karta. Yeh akeli picture isliye hai ki parent ka mnemonic kehta hai "two-over-L se neeche theek ho; one-over-L par, monotone descent."
Step 5 — Step size ka har quadrant: safe, best, aur exploding
KYA. Ab hum ke tamam regimes cover karte hain taaki koi reader koi unseen case na dekhe. Sabse clean test problem use karo, 1-D bowl , jahan update hai . Number woh multiplier hai jo har step par apply hota hai.
KYUN multiplier hi sab kuch hai. steps ke baad error hai . Toh:
- (yani ): shrinks, sab same sign — zero ki taraf gentle glide.
- (yani ): ek hi step mein exactly bottom par land karta hai.
- (yani ): shrinks lekin har step mein sign flip karta hai — zig-zagging karte hue converge karta hai.
- (yani ): hamesha bounce karta hai same height par, kabhi converge nahi karta.
- (yani ): badhta hai aur flip karta hai — bahar explode karta hai.
PICTURE.
Ek hi bowl par char trajectories. Green () ek taraf se slide karta hai. Yellow () seedha minimum par girta hai. Blue () overshoot karta hai aur alternating sides par land karta hai, phir bhi home kar raha hai. Red () bahar koodta hai aur walls par chadhta hai — divergence. Speed sirf interval mein hai.
Step 6 — Strong-convexity floor general ke liye linear rate deta hai
KYA. Ek general -strongly convex, -smooth ke liye ab hum dikhate hain ki error har step mein ek fixed factor se shrink hoti hai — Step 2 ki floor wall use karke, sirf quadratic nahi. Strong convexity Descent Lemma ka ek lower-bound twin deta hai:
KYUN yeh loop close karta hai. Ise Step 4 ke Descent Lemma drop ke saath combine karo ( use karke). value-gap ho. Step 4 ne diya ; subtract karo aur floor inequality feed karo:
Toh gap fixed factor se har step mein contract karta hai — yeh linear (geometric) convergence hai, aur floor exactly wohi hai jo ise possible karta hai.
PICTURE.
Blue curve true value-gap hai; yellow dashed line guaranteed envelope hai. Gap ek shrinking geometric curve ke neeche pinned hai — "linear rate" ka visual meaning. Neeche, log-scale inset us curve ko ek straight line mein badal deta hai jiska slope hi rate hai.
Step 7 — Do directions balance karna: kahan se aata hai
KYA. Real problems mein alag-alag directions mein alag-alag curvatures hoti hain. Lo jahan . Curvature ke eigenvalues exactly (gentle) aur (steep) hain. Ek step size ko dono multipliers serve karne hain:
KYUN optimum hai — balancing argument. Jaise se badhta hai: gentle factor decrease karta hai (abhi positive hai), jabki steep factor pehle par tak decrease karta hai phir increase karta hai (absolute value ke andar negative ho jaata hai). Ek gir raha hai, doosra eventually utha raha hai — toh max exactly wahan sabse chhota hai jahan do curves cross karte hain. Dono ko equal set karo:
Kisi bhi factor mein wapas plug karo:
PICTURE.
Upar: do factors (green, falling) aur (red, V-shaped) ke against plot kiye hue; unka crossing point yellow star hai par, jo sabse chhota achievable max hai. Neeche: stretched valley par resulting path zig-zag karta hai narrow -direction mein jabki lambe -floor par creep karta hai — bade ka visual meaning.
Step 8 — Degenerate walls: aur
KYA. Do extreme condition numbers poora spectrum explain karte hain.
- (): round bowl. ke saath multiplier har jagah hai — GD ek hi step mein khatam ho jaata hai. Best case.
- (sirf convex, flat bottom): floor wall gayab ho jaata hai. Rate aur — koi fixed shrink factor nahi; hum slow rate par wapas aa jaate hain. Isliye parent warn karta hai "convexity alone linear convergence nahi deta." Socho : iska bottom spoon-flat hai, slope kisi bhi straight-line shrink se tezi se mar jaata hai.
KYUN dono dikhana zaroori hai. Yeh do endpoints hain: round bowls trivial hain, flat-bottomed valleys stubborn hain, baaki sab rate ke saath beech mein hain.
PICTURE.
Left: round bowl, ek yellow arrow seedha centre mein (). Right: flat-bottomed curve — steps (red) chhote se chhote hote jaate hain jaise slope flat hoti hai, kabhi fixed factor se contract nahi karti ().
Ek-picture summary
Sab kuch ek canvas par: true hill -ceiling aur -floor ke beech trapped (Steps 2–3), drop-vs- curve par peak karti aur par khatam hoti (Steps 4–5), strong-convexity contraction (Step 6), aur anisotropic zig-zag jiska speed set karta hai (Step 7). Left se right padho: hill ko bound karo → safe step chuno → floor rate deta hai → condition number speed cap karta hai.
Recall Feynman retelling — poori walk plain words mein
Tum ek foggy hill par ho. Apne paon ke paas tumhe ek arrow feel hota hai: upar ki taraf. Ise flip karo — woh neeche ki taraf hai — aur wahan step lo (Step 1). Lekin safe step kitna bada hai? Tum hill nahi jaante, toh do rules par agree karte ho: yeh kabhi bhi ceiling se tezi se upar nahi jhukta, aur (agar lucky ho) yeh hamesha thoda upar jhukta hai kam se kam se (Step 2). Ceiling tumhe ek bowl-shaped lid draw karne deta hai jo real hill ke upar baithti hai aur tumhare paon ke neeche touch karti hai; us lid ke bottom par slide karna real hill ko bhi provably lower karta hai (Step 3). Kitna slide karna hai? Step size tumhe sabse zyada drop karta hai; ke baad tum valley ke across fly karte ho aur upar chadhte ho — tum explode karte ho (Steps 4–5). Floor hi real speed ka vaada karta hai: yeh guarantee karta hai ki slope hamesha itna steep hai ki har step remaining gap ka ek fixed fraction kaat deta hai (Step 6). Do dimensions mein ek step size ko ek steep direction aur ek gentle direction dono ko please karna hota hai; best jo tum kar sakte ho woh yeh hai ki unke do shrink-factors equal bana do, jo tumhe par aur ek zig-zag par le jaata hai jiska speed hai (Step 7). Do extremes: ek round bowl ek step mein khatam ho jaata hai, ek spoon-flat bottom () tumhe forever crawl karwata hai (Step 8). Yahi poori theory hai — hill ko bound karo, safe step chuno, floor ko rate set karne do, aur kisi bhi slowness ke liye condition number ko blame karo.
Recall Quick self-check
Strongly convex quadratic ke liye best step size? ::: Us ke saath best per-step shrink factor? ::: ke saath per-step value-gap contraction? ::: Round bowl () ko ek step mein finish karne wala step size? ::: (multiplier ) ka woh range jahan GD progress karne ki guarantee hai? ::: Flat-bottomed convex function () linear convergence kyun kho deta hai? ::: ; koi fixed shrink factor nahi, sirf .
Yeh bhi dekho: Nesterov Acceleration aur momentum ko mein badal deta hai (Step 7 ka zig-zag fix karta hai); Newton's Method (second-order methods) har direction ko rescale karta hai taaki effectively ban jaaye; Stochastic Approximation (Robbins–Monro) explain karta hai kyun noisy gradients ek shrinking step force karte hain.