Teen "scorecards" ka quick reminder jo hum test karte hain, sab parent page pe defined hain:
Yahan θ^ hamaara guessing rule hai (ek random variable), θtrue unknown number hai, E[⋅] ka matlab hai "sabhi possible samples pe average", aur Var(⋅) ka matlab hai "guess sample-to-sample kitna wobble karta hai".
Upar ki picture is poore page ka mental model hai: ek dartboard. Bias = cloud ke centre ka bullseye se kitna door hona. Variance = cloud kitna spread out hai. MSE = ek dart ka bullseye se average squared distance — yeh dono cheezein feel karta hai.
Estimator woh rule/random variable hai Xˉ=n1∑Xi — yeh data dekhne se pehle exist karta hai aur iska poora distribution hota hai.
Estimate woh single number hai 12.4 — real data plug in karne ke baad ka output.
Analogy: estimator recipe hai; estimate aaj aapne jo cake banayi woh hai.
Recall Solution L1.2
Bias =E[θ^]−θ=n3. Kyunki finite n ke liye yeh zero nahi hai, estimator biased hai.
Lekin n3→0 jab n→∞, toh yeh asymptotically unbiased hai — systematic error zyada data ke saath shrink hoti hai.
Linearity of expectation se (yeh sums aur constants ke through pass hoti hai):
E[μ^]=0.3E[X1]+0.7E[X2]=0.3μ+0.7μ=(0.3+0.7)μ=μ.
Unbiased ✓ — kyunki weights sum to 1 hain. Same-mean variables ke weighted average ke liye yahi poora rule hai.
Recall Solution L2.2
Var(Xˉ)=nσ2=25100=4,standard error=4=2.
Dhyaan do: n ko chaar guna karo aur standard error sirf half hoti hai — diminishing returns ka n law. (Dekho Law of Large Numbers kyun Var(Xˉ)→0 hota hai.)
Recall Solution L2.3
Mean Xˉ=32+4+6=4. Squared deviations: (2−4)2=4, (4−4)2=0, (6−4)2=4; sum =8.
s2=n−18=28=4,σ^2=n8=38≈2.667.
Biased wala chhota hai — exactly woh "shrink" jo n−1 correction undo karta hai.
Independent variables ke liye, Var(∑wiXi)=∑wi2σ2.
Var(μ^A)=(4⋅161)σ2=41σ2=0.25σ2.Var(μ^B)=(41+3⋅361)σ2=(41+121)σ2=31σ2≈0.333σ2.
Kyunki 0.25<0.333, μ^Azyada efficient hai. A ki B ke relative mein relative efficiency:
Var(μ^A)Var(μ^B)=1/41/3=34≈1.333.Lesson: equal-variance data ke liye, equal weights (1/n each) variance minimise karte hain — isliye Xˉ winner hai.
Recall Solution L3.2
MSE=Var+Bias2 use karke:
MSE1=5+22=9,MSE2=8+0=8.Unbiased rival yahan jeetta hai (8<9) — lekin dhyaan do biased wala jeet sakta tha agar uski variance kaafi low hoti. Yahi ek line mein Bias–Variance Tradeoff hai: thoda bias tabhi worth it hai jab yeh enough variance reduction khareed le.
Recall Solution L3.3
MSE(θ^n)=n9+(n4)2=n9+n216n→∞0.
Kyunki MSE→0, sufficient condition (Chebyshev) se θ^nPθ: consistent hai. Wobble aur off-centre dono parts vanish ho jaate hain.
Unbiased:E[X1]=μ. ✓
Consistency check variance se:Var(μ^)=Var(X1)=σ2harn ke liye — yeh kabhi shrink nahi karta. Estimate σ2 se wobble karta hai chahe aap kitna bhi data collect karo, kyunki aap saara extra data throw away kar dete ho.
Toh MSE=σ2→0, aur P(∣X1−μ∣>ε) fixed rehti hai. Consistent nahi.
Yeh prove karta hai unbiased ⇒ consistent: yeh dono alag cheezein measure karte hain.
Recall Solution L4.2
(a) Bias(M)=E[M]−θ=n+1nθ−θ=−n+11θ. Yeh hamesha underestimate karta hai — sample max true ceiling θ se kabhi exceed nahi kar sakta.
(b) Shrink factor ke reciprocal se multiply karo: θ^unb=nn+1M. Tab E[nn+1M]=nn+1⋅n+1nθ=θ. ✓
(c) n=4 ke liye: factor =nn+1=45=1.25.
Recall Solution L4.3
Var(Xˉ)Var(median)=σ2/n2πσ2/n=2π≈1.571.
Mean π/2≈1.571 ke factor se zyada efficient hai: median lagbhag 36% information waste karta hai (yeh sirf ≈64% efficiency tak pahunchta hai, kyunki 2/π≈0.637). Normal data ke liye mean efficient choice hai; median tabhi payoff karta hai jab tails heavy hon.
Var(μ^)=σ2∑wi2 minimise karo subject to ∑wi=1.
Squares kyun phir? Independence ⇒ variance wi2 add karta hai. ∑wi2 ko fixed sum ke under minimise karna ek classic hai:
Likho wi=n1+di jahan ∑di=0 (equal weights se deviations). Tab
∑wi2=∑(n1+di)2=∑n21+n2=0∑di+∑di2=n1+∑di2.
Kyunki ∑di2≥0 equality ke saath iff har di=0, minimum wi=n1 pe hai. ∎
Minimum variance =σ2/n — woh value jo Xˉ achieve karta hai. Equal weights se koi bhi deviation variance strictly badhata hai.
Recall Solution L5.2
(a) n i.i.d. points ke liye information add hoti hai: In(λ)=nI1(λ)=λn. Toh
Var(λ^)≥In(λ)1=nλ.
(b) Poisson ke liye, Var(Xi)=λ, isliye Var(Xˉ)=nλ. Yeh bound ke barabar hai, aur Xˉ unbiased hai (E[Xˉ]=λ). Isliye Xˉ, λ ka efficient (variance-attaining) estimator hai. ∎
I1=1/λ ki sanity:lnf=−λ+xlnλ−lnx!, toh ∂λlnf=−1+x/λ; iska variance hai Var(x)/λ2=λ/λ2=1/λ. ✓
Recall Solution L5.3
E[θ^c]=cθ, toh Bias=cθ−θ=(c−1)θ, aur Var(θ^c)=c2v.
MSE(c)=c2v+(c−1)2θ2.
Differentiate karo aur 0 set karo: dcd=2cv+2(c−1)θ2=0⇒c(v+θ2)=θ2, toh
c⋆=θ2+vθ2<1.1 se chhota kyun? Thodi si shrinkage ek chhota bias trade karta hai variance mein badi cut ke liye — Bias–Variance Tradeoff quantitatively. Example: θ2=4, v=1 deta hai c⋆=4/5=0.8, aur MSE(0.8)=0.82⋅1+(0.8−1)2⋅4=0.64+0.16=0.8<v=1. Unbiased choice c=1 MSE =1 deta hai, toh shrinkage strictly jeetta hai.
Recall Ladder ka one-line summary
Terms ki recognition ::: L1 — estimator vs estimate, bias spot karna.
Formulas mein plug in karna ::: L2 — Var(Xˉ)=σ2/n, s2 with n−1.
Compare aur decompose karna ::: L3 — relative efficiency, MSE = Var + Bias2.
Ideas combine karna ::: L4 — unbiased = consistent, Uniform max ko unbiasing karna.
Prove aur design karna ::: L5 — optimal weights, Cramér–Rao attainment, MSE-optimal shrinkage.