5.6.1 · D1 · Coding › Machine Learning (Aerospace Applications) › Linear regression — normal equation, gradient descent deriva
Intuition Ek hi main idea
Hamare paas ek graph pe dots ka ek samooh hai, aur hum chahte hain wo ek seedhi line jo un sab ke jitna paas se ho sake. Is topic mein jo bhi hai — woh strange matrices, derivatives, "normal equation" — sab kuch sirf is cheez ka careful hisaab hai ki "line kitni zyada galat hai?" aur line ko tab tak thoda-thoda adjust karna hai jab tak woh miss chhoti se chhoti na ho jaye.
Tumhe parent note Linear Regression fluently padhne se pehle, us mein aane wala har ek symbol apna banana hoga. Yeh page har ek symbol ko scratch se build karta hai, ek aisi order mein jahan har block usse pehle waale par tikaa ho. Upar se neeche padho.
Definition Data point kya hota hai
Ek data point ek measurement pair hota hai: ek input x i aur uske saath wala answer y i . Neeche ka chhota sa i sirf ek naam tag hai — "point number i " — kuch multiply nahi ho raha ya power nahi chadh rahi.
Socho dots ki ek scatter. Har dot ek horizontal position x i aur ek height y i par baithi hai.
x i → dot kitni right mein hai (woh cheez jo tum jaante ho, jaise altitude).
y i → dot kitni upar hai (woh cheez jo tum predict karna chahte ho, jaise fuel burn).
n → dots ki count . Agar i runs 1 , 2 , 3 karta hai toh n = 3 .
Yeh topic isko kyun chahta hai. Regression ka poora kaam in sab dots ko ek rule se summarise karna hai. "Dot number i " ke liye koi symbol ke bina hum "ek saath saare dots" ke baare mein baat nahi kar sakte.
Is line ko padho x 5 paanchwe data point ka input hai; subscript ek label hai, exponent nahi.
Definition Hat ka matlab "guessed" hai
y ^ (padho "y-hat") line ka height ka guess hai, y ke ulat jo actually measured ki gayi true height hai. Hat ek reminder hai: yeh number hamare formula se aaya, reality se nahi.
Ek seedhi line ke do knobs hote hain:
Do knobs kyun, ek kyun nahi? Sirf w se line origin ( 0 , 0 ) se guzarne par majboor hoti; real data rarely zero se guzarta hai, isliye b line ko upar ya neeche freely slide karne deta hai.
Machine learning mein w decide karta hai ki input kitna matter karta hai. Bada w matlab "x prediction ko strongly pull karta hai." Baad mein, jab bahut saare inputs honge, har ek ko apna weight milega — isliye hum isko letter w (weight) likhte hain, school wala m nahi.
Definition Ek point ka error
Point i ka error truth aur guess ke beech ka gap hai: y i − y ^ i . Yeh positive hai agar line dot ke neeche ho, negative agar upar ho.
Figure mein vertical dashed sticks dekho — har ek ek error hai. Hum chahte hain ki saari sticks ki total length chhoti ho. Lekin ek trap hai:
Common mistake Errors ko directly add kyun nahi karte?
Agar tum raw errors add karo, toh ek dot + 3 upar aur ek dot − 3 neeche 0 pe cancel ho jaate hain — line "perfect" lagti hai jabki dono dots miss kar rahi ho. Squaring har error ki sign khatam kar deta hai (square kabhi negative nahi hota), isliye misses kabhi cancel nahi ho sakti. Yeh bade misses ko chhote se bahut zyada punish bhi karta hai, aur — sabse zaroori — yeh smooth hai, isliye calculus har jagah kaam karta hai.
Toh hum jo quantity minimise karte hain woh squared errors ka sum hai:
∑ i = 1 n ( y i − y ^ i ) 2
Symbol ∑ i = 1 n (capital Greek sigma) ka matlab hai "dayi taraf ki cheez ko i = 1 , 2 , … , n ke liye jod do." Yeh ek compact "sab jod do" hai.
J
J ek akela number hai jo score karta hai ki current line kitni buri hai — average squared error. Chhota J = achhi line. Yeh ==knobs w aur b ka function== hai, kyunki unhe badalne se har error badal jaata hai.
J ( w , b ) = 2 n 1 ∑ i = 1 n ( y i − ( w x i + b ) ) 2
2 n 1 kyun?
n 1 isko ek mean (average) banata hai, taaki score sirf isliye blow up na ho kyunki tumhare paas zyada data hai.
Extra 2 1 ek convenience hai: jab hum differentiate karte hain, square upar se 2 ka factor laata hai, aur 2 1 usse cancel kar deta hai toh formulas clean rehte hain. Yeh kabhi nahi badalta kahan minimum hai.
J ko ek valley ki tarah picture karo
J ko do knobs w aur b ke against plot karo aur tumhe ek smooth bowl milega. Bowl ka bottom best line hai. Parent note ke dono methods sirf us bottom ko dhundhne ke do tarike hain: normal equation ek hi chhalaang mein wahan pahunch jaata hai, gradient descent dheeray-dheeray neeche roll karta hai.
Jab bahut saare inputs aur bahut saare points hote hain, toh sums haath se likhna unbearable ho jaata hai. Hum numbers ko grids mein pack karte hain.
Definition Vector aur matrix
Ek vector (bold lowercase, x ) numbers ka ek single column hai — ek list. Ek matrix (bold uppercase, X ) numbers ka ek rectangle hai — rows aur columns.
x i → point i ke saare inputs ek column mein stack kiye hue.
X ∈ R n × d → design matrix : n rows (ek per point), d columns (ek per input feature). Symbol R n × d sirf kehta hai "real numbers ki ek grid jisme n rows aur d columns hain."
y ∈ R n → true answers ka column.
w → weights ka column, har feature ke liye ek.
b ko alag track karne se bachne ke liye, hum X ke aage 1 s ka ek column chipka dete hain. Tab pehla weight hi bias ban jaata hai, kyunki 1 ⋅ b = b . Isliye worked example mein X = 1 1 1 1 2 3 hai — ones ka baaya column b carry karta hai.
X T (padho "X transpose") ek grid ko uski diagonal par flip karta hai: rows columns ban jaate hain. Ek ( n × d ) matrix ( d × n ) ban jaati hai.
Yeh saari predictions ek object mein pack karta hai. Xw ki row i exactly w x i + b hai. Toh Xw = guesses y ^ ka poora column ek symbol mein.
w T x = w 1 x 1 + w 2 x 2 + … — matching entries multiply karo, unhe jod do. Yeh single number ek point ke liye prediction hai jab bahut saare features hon. Yeh tool kyun? Yeh likhne ka sabse chhota tarika hai "har input ko uski importance se weight karo aur unhein total karo."
∥ v ∥ vector v ki length hai: v 1 2 + v 2 2 + … . Aur ∥ v ∥ 2 = v 1 2 + v 2 2 + … — squares ka sum, koi square root nahi. Topic ko isko kyun chahiye: cost 2 n 1 ∥ y − Xw ∥ 2 literally "error vector ki squared length ka half-average" hai — bilkul wahi idea jo Section 3 mein tha, ab ek clean symbol mein.
∥ y − Xw ∥ 2 in wordsek saath har point ka total squared error.
Yeh Least Squares Estimation ki language hai aur Matrix Pseudoinverse par tikaa hai.
Ek derivative ek sawaal ka jawaab deta hai: "agar main is knob ko thoda sa nudge karun, toh cost kis direction mein aur kitni tezi se badlegi?" Yeh aapki current jagah par cost curve ka slope hai. Yeh tool kyun, koi doosra kyun nahi? Valley ka bottom dhundhna = woh jagah dhundhna jahan slope flat (zero) ho. Derivatives hi ek maatra tool hai jo slope measure karta hai.
∇ w J
Jab kai knobs hon, gradient ∇ J (ulta triangle "nabla") saari partial slopes ka column hai — har knob ke liye ek. Yeh ek arrow hai jo cost ki steepest increase ki direction mein point karta hai.
Gradient descent mein minus sign kyun? Gradient uphill (zyada cost ki taraf) point karta hai. Hum kam cost chahte hain, isliye hum opposite direction mein step lete hain: − ∇ J . Yahi hai w t + 1 = w t − α ∇ J ka poora logic.
α = learning rate : kitna bada step lena hai. Zyada bada → valley overshoot karo aur bounce karo; bahut chhota → rengna. Feature Scaling dekho ki kyun unequal input sizes α ko tiny rehne par majboor karti hain.
Subscript t = iteration number (w 0 , w 1 , … ), ek time step , koi power nahi.
ϵ (epsilon) = ek tiny threshold; "jab change ϵ se chhota ho tab ruk jao."
Minimum par gradient equals zero (valley floor flat hota hai).
Bowl-shaped J ka exactly ek hi bottom hai kyunki yeh convex hai — dekho Convex Optimization . Yahi guarantee hai ki dono methods ek hi best line tak pahunchte hain.
Line model y-hat = w x + b
Square and average = cost J
Vectors and matrices X w y
Gradient = downhill arrow
Gradient descent many steps
Aage yahi machinery Regularization (Ridge, Lasso) , Kalman Filtering , aur Neural Networks mein badhti hai.
Dayi taraf cover karo aur oonchi awaaz mein jawab do. Agar koi ruk jaaye, toh woh section dobara padho.
y ^ mein hat ka kya matlab hai?Yeh line ki guessed value hai, measured truth nahi.
Do knobs w aur b kya hain aur har ek kya karta hai? w slope (steepness), b bias (vertical shift).
Hum errors ko raw add karne ki jagah square kyun karte hain? Taaki positive aur negative misses cancel na ho sakein, aur taaki cost calculus ke liye smooth rahe.
∑ i = 1 n tumhe kya karne ko kehta hai?Aane wale expression ko 1 se n tak har point ke liye jod do.
J kya single number report karta hai?Average squared error — current line kitni buri hai.
Xw plain words mein kya hai?Ek saath har data point ke liye predictions ka poora column.
∥ v ∥ 2 kya compute karta hai?Entries ke squares ka sum — squared length.
Gradient kya hai aur woh kahan point karta hai? Saari partial slopes ka vector; yeh cost ki steepest increase ki taraf point karta hai.
Update w t + 1 = w t − α ∇ J mein minus sign kyun hai? Hum cost kam karne ke liye uphill gradient ke opposite step lete hain.
"Bias trick" kya hai? X mein ones ka ek column add karna taaki pehla weight automatically b ban jaaye.