4.9.23 · D1 · Maths › Probability Theory & Statistics › Multiple regression
Multiple regression data points ke ek cloud ko leta hai aur unke beech ek flat surface slide karta hai — taaki surface se upar-neeche ke gaps (differences) jitne ho sake utne chote rahein. Baaki sab — matrices, transposes, inverses — sirf ek tarah ki bookkeeping hai jo computer ko allow karti hai ki woh kai saari input variables ke liye woh best surface dhundh sake.
Is page par assume kiya gaya hai ki tumne kuch bhi nahi dekha. Hum har woh symbol naam denge jo parent note Multiple regression use karta hai, uske peeche ki picture draw karenge, aur batayenge ki is topic ko uske bina kaam kyon nahi chalega. Upar se neeche padho; har block mein sirf wahi symbols use hain jo uske upar already explain ho chuke hain.
Kisi bhi formula se pehle, hume ek observation ke baare mein baat karni hai aur yeh samajhna hai ki hum unhe kaisa count karte hain.
Definition Observation aur index
i
Ek observation measurements ki ek poori row hai: ek plant, ek student, ek ghar. Hum unhe line up karte hain aur har ek ko ek number dete hain. Chhota sa symbol i ek counter hai jo kehta hai "main kaun si row ki baat kar raha hoon". Agar humare paas n rows hain, toh i run karta hai 1 , 2 , 3 , … , n .
n = total number of observations (cloud mein kitne dots hain).
y i = row i par measure kiya gaya outcome.
x ij = row i par input number j ki value — do subscripts: pehla kehta hai kaun si row , doosra kehta hai kaun sa input .
Yeh kyun chahiye: regression har ek row ke liye ek prediction ko ek truth se compare karta hai, phir mistakes ko add karta hai. Counter ke bina hum yeh nahi keh sakte "row 3 par mistake kya thi".
Worked example Figure s01 kaise padhein
Left mein ek raw data table hai: har row ek observation hai, i se tagged. Right mein wahi rows dots ban jaati hain ek picture mein, jisme horizontal axis = predictor x 1 aur vertical axis = response y . Red dot row i = 2 hai: label follow karo to dekho ki x 2 , 1 = 2 (row 2, input 1) aur y 2 = 65 . Poora point yeh hai: numbers ki ek table aur dots ka ek cloud — yeh ek hi cheez hain — regression cloud par kaam karta hai.
y aur predictors x 1 , … , x p
Response y woh cheez hai jo hum predict karna chahte hain (exam score, plant ki height).
Predictor x j ek aisa input hai jiske baare mein hum sochte hain ki yeh y explain karne mein help karta hai (padhai ke ghante, paani ke cups).
p = number of predictors (kitne input columns hain).
Yeh sirf measured numbers hain — abhi kuch choose ya fit nahi kiya gaya hai. Aage hum inhe combine karenge, lekin pehle hume woh numbers introduce karne honge jinhe hum tune kar sakte hain.
β (beta) — woh dials jo hum ghuma sakte hain
Har β j (padho "beta-jay") ek aisa number hai jo hum choose kar sakte hain fit ko accha banane ke liye.
β 0 = intercept : predicted y jab har input zero ho — jahan surface vertical axis ko cross karti hai.
β j (for j ≥ 1 ) = input x j ki direction mein slope : x j mein ek unit badhne par y kitna badhta hai.
Ab jab ki hume fixed inputs x j aur tunable dials β j dono mil gaye hain, hum inhe combine kar sakte hain.
Definition "Linear" ka matlab kya hai (woh zaroori word)
Predictors ka ek linear combination yeh hota hai: har predictor x j ko uske dial β j se multiply karo, phir sab kuch add karo (intercept β 0 apne aap ke saath):
prediction = β 0 + β 1 x 1 + β 2 x 2 + ⋯ + β p x p
Yahan "Linear" ka matlab hai koi bending nahi : na x 2 , na x , na x 1 x 2 . Kisi input ki contribution ko double karna sirf uske term ko double karna hai. Isi liye fitted shape ek flat surface hoti hai, curved nahi.
Topic ko yeh kyun chahiye: flatness hi woh cheez hai jo maths ko ek clean formula mein solvable banati hai. Ek curved fit ka koi simple closed-form answer nahi hota.
ε (epsilon) — bacha hua wiggle
ε i (padho "epsilon-eye") error hai: y i ka woh hissa jo flat surface explain nahi kar sakti — measurement noise, luck, hidden causes. Hum assume karte hain ki yeh average ho ke zero ho jata hai:
E [ ε i ] = 0
Symbol E [ ⋅ ] padho "ki average value ". Yeh kehna ki average error zero hai, matlab surface systematically na zyada upar hai na zyada neeche.
Dono kyun matter karte hain: β 's woh hain jinhe hum solve karte hain; ε 's woh hain jinhe hum chota karne ki koshish karte hain. Poora game yeh hai ki β 's aise choose karo ki ε 's chote ho jayein.
Error ε i invisible hai (hume true surface nahi pata). Jab hum β 's pick kar lete hain toh jo hum measure kar sakte hain woh hai residual .
Definition Residual aur squared residual
Residual real point aur humari surface ke beech ka vertical gap hai:
e i = y i − y ^ i
jahan y ^ i (kaho "y-hat") row i ke liye humari prediction hai. Chhoti si hat ^ hamesha matlab "estimated / fitted", kabhi bhi true unknown nahi.
Hum har gap ko square karte hain, e i 2 , aur sab add karte hain:
S = ∑ i = 1 n e i 2
Symbol ∑ i = 1 n (capital sigma) padho "add karo , i ko 1 se n tak jaane do".
Intuition Square kyun karein, sirf gap kyun nahi lein?
Raw gap negative ho sakta hai (point surface ke neeche); positives aur negatives cancel ho jaate aur bad fits chhup jaate. Squaring har gap ko positive banata hai.
Squaring ek bade miss ko kai chote misses se zyada punish karta hai, isliye surface wild errors avoid karti hai.
Squares smooth hote hain — tum calculus se inke bottom tak slide kar sakte ho. Absolute values mein ek sharp corner hoti hai aur solve karna mushkil hota hai.
Worked example Figure s02 kaise padhein
Black line humari fitted surface hai (1D mein yeh sirf ek line hai). Black dots real data hain; red vertical segments jo har dot ko line se jodte hain woh residuals e i = y i − y ^ i hain. Notice karo yeh strictly vertical hain — regression gap ko sirf y direction mein measure karta hai, sabse choti slanted distance mein nahi. Least squares tab tak line slide karta hai jab tak squared red lengths ka total sabse chota na ho jaye. Yahi Ordinary Least Squares ka dil hai.
n alag-alag equations likhna thakaan wali baat hai. Hum numbers ko grids mein bundle karte hain.
Ek vector numbers ka ek single column hota hai. y (bold) saare responses ko stack karta hai:
y = y 1 y 2 ⋮ y n
Bold letters = poore stacks; plain letters = ek number.
Definition Parameter vector
β aur error vector ε
Hum Section 3 ke tunable dials ko ek column mein stack karte hain, parameter vector , aur bacha hua wiggles ko doosre column mein, error vector :
β = β 0 β 1 ⋮ β p ( length p + 1 ) , ε = ε 1 ε 2 ⋮ ε n ( length n ) .
Toh bold β hai ek saath saare coefficients aur bold ε hai ek saath saari errors — same numbers pehle jaisi, bas columns mein gather kiye gaye.
Definition Matrix aur design matrix
X
Ek matrix numbers ka ek rectangle hota hai (rows × columns). Design matrix X mein har predictor value hoti hai, saath mein ek leading column of 1's :
X = 1 1 ⋮ 1 x 11 x 21 x n 1 ⋯ ⋯ ⋯ x 1 p x 2 p ⋮ x n p
Isme n rows hain (har observation ke liye ek) aur p + 1 columns hain (har predictor ke liye ek, plus 1's column).
Intuition 1's ka column kyun?
Har 1 intercept β 0 se multiply hota hai, isliye β 0 har row ki prediction mein appear karta hai. Iske bina, surface origin se guzarni padti hai (sab inputs zero hon toh 0 predict karo) — jo almost hamesha galat hota hai.
y , X , β aur ε sab define hone ke baad, n equations ek seedhi line mein aa jaati hain:
y = X β + ε
Poori derivation teen operations par chalti hai. Hum har ek ko uski picture ke saath define karte hain.
Definition Matrix–vector product
X β
Row i ki prediction paane ke liye, X ki row i ke across aur vector β ke neeche chalo, matching entries multiply karo, aur add karo:
( X β ) i = 1 ⋅ β 0 + x i 1 β 1 + ⋯ + x i p β p = y ^ i
Toh X β simply ek saath saari predictions hai. Isliye humne stack karne ki zehmat uthayi.
X ⊤
Transpose ek matrix ko uske diagonal ke upar se flip karta hai: rows columns ban jaati hain. Agar X n × ( p + 1 ) hai, toh X ⊤ ( p + 1 ) × n hoga.
Yeh kyon aata hai: X ke columns ko ek doosre ke saath combine karne ke liye (quantity X ⊤ X ) ya y ke saath, shapes ka align hona zaroori hai, aur transpose hi unhe align karta hai.
∥ ⋅ ∥
Ek vector v ke liye, uski squared length hai
∥ v ∥ 2 = v ⊤ v = v 1 2 + v 2 2 + ⋯ + v n 2
Yeh n dimensions mein Pythagoras theorem hai. Notice karo: squared residuals ka sum exactly ∥ y − X β ∥ 2 hai — residual vector ki squared length . Error minimize karna ek arrow ko chota karna hai.
Worked example Figure s03 kaise padhein
Shaded flat sheet X ka column space hai — har prediction X β jo hum possibly kar sakte hain woh isi par exist karti hai, chahe dials kaise bhi set karein. Lamba arrow y (real data) usually sheet se bahar nikalti hai. Red arrow residual y − X β hai. Uski length tab sabse choti hoti hai jab woh sheet ke perpendicular khadi hoti hai — woh perpendicular drop best fit hai, aur Orthogonal Projection ka seed.
Definition Dot product aur "perpendicular"
Do vectors a , b ka dot product hai a ⊤ b = a 1 b 1 + ⋯ + a n b n , ek number.
Jab yeh number zero ho, toh do vectors perpendicular (right angle par) hain .
Ab hum woh condition earn karte hain jo figure s03 ne geometrically dikhaayi thi. Yaad karo S ( β ) = ∥ y − X β ∥ 2 .
Definition Matrix inverse
Ek square matrix A ke liye, uska inverse A − 1 woh matrix hai jo use undo karta hai: A − 1 A = I , jahan I (identity) woh matrix hai jisme diagonal par 1's aur baaki jagah 0's hain — "kuch nahi karta" wali matrix (I v = v ).
Invert karna matrix version hai divide karne ka .
Common mistake "Har matrix invert ho sakti hai."
Kyun sahi lagta hai: har non-zero number se divide kiya ja sakta hai.
Fix: ek matrix ka koi inverse nahi hota jab uske columns redundant hote hain (ek doosron ka combination hota hai). X ⊤ X ke liye yeh tab hota hai jab do predictors ek hi information carry karte hain — Multicollinearity & VIF ka trap. Poori story ke liye Matrix Inverse dekho.
Last symbols measure karte hain ki fit kitni achi hai.
y ˉ
y ˉ ("y-bar") saare responses ka average hai: y ˉ = n 1 ∑ i y i . Average height par ek flat horizontal line imagine karo — woh sabse dumb possible predictor jo har input ko ignore karta hai.
Definition Teen sums of squares
S S T = ∑ i ( y i − y ˉ ) 2 — y ka total spread uske mean ke aas-paas (kitna variation hai взагалі).
S S E = ∑ i ( y i − y ^ i ) 2 — fitting ke baad bacha hua error (jo surface miss kar gayi).
S S R = ∑ i ( y ^ i − y ˉ ) 2 — regression / explained part (jo surface ne capture kiya).
Least-squares fit ke liye yeh S S T = S S R + S S E obey karte hain: total = explained + leftover. (Yeh clean split precisely isliye hoti hai kyunki residual fit ke perpendicular hai — s03 picture phir se.)
Ratio R 2 = S S R / S S T (explain kiya gaya fraction) inhi se bana hai — topic Coefficient of Determination .
Observation index i and n
Response y and predictors x
Beta dials and linear combination
Residual and sum of squares S
Vectors beta and epsilon and design matrix X
Matrix product transpose norm
Dot product and perpendicular
Mean and sums of squares SST SSE SSR
Multiple Regression estimator
Har arrow ka matlab hai "target samajhne se pehle source box samajhna zaroori hai." Final box parent topic Multiple regression hai, jo Gauss–Markov Theorem aur Positive Semidefinite Matrices ka darwaza bhi kholti hai.
Left side padho, zor se jawab do, phir reveal karo.
y i mein subscript i kya count karta hai?Kaun sa observation (row) mean hai; yeh 1 se n tak run karta hai.
"Linear" fitted surface ko kya force karta hai? Flat — koi curves nahi, inputs ke squared ya product terms nahi.
Residual e i kya hota hai? Real point aur fitted surface ke beech ka vertical gap y i − y ^ i .
Residuals ko add karne se pehle square kyun karte hain? Taaki positives aur negatives cancel na karein, bade misses ko punish kiya jaye, aur total calculus ke liye smooth rahe.
X mein leading column of 1's kya karta hai?Intercept β 0 se multiply karta hai taaki woh har row ki prediction mein appear kare.
Parameter vector β kya hai? Woh column jo saare coefficients β 0 , … , β p stack karta hai (length p + 1 ).
Transpose X ⊤ kya karta hai? Rows ko columns mein flip karta hai taaki multiplication ke liye shapes align ho sakein.
Dot product ke terms mein do vectors perpendicular kab hote hain? Jab unka dot product a ⊤ b zero ho.
Normal equations geometrically kya condition state karte hain? Residual X ke har column ke perpendicular hai: X ⊤ ( y − X β ^ ) = 0 .
Left se ( X ⊤ X ) − 1 se multiply karna β ^ ko isolate kyun karta hai? Kyunki ( X ⊤ X ) − 1 ( X ⊤ X ) = I aur I β ^ = β ^ .
X ⊤ X ka inverse kab nahi hota?Jab predictor columns redundant hon (perfect collinearity).
Least-squares fit ke teen sums of squares ko jodne wali identity batao. S S T = S S R + S S E (total = explained + leftover).