4.5.13-Denoising-objective — Schedule loss weighting across timesteps determine karta hai
4.5.15-Score-matching — SNR score function magnitude ∇xtlogp(xt) ko affect karta hai
4.5.18-Fast-sampling — Schedule choice step-skipping strategies (DDIM) enable karta hai
Recall Ek 12-saal ke bacche ko samjhao
Socho tum guess karne ki koshish kar rahe ho ki ek picture kaisi dikhti hai, par koi baar-baar usme aur zyada blur add karta ja raha hai. Noise schedule aise recipe hai jo batata hai ki har second mein kitna blur add karna hai.
Agar tum shuru mein hi bahut zyada blur add kar do, to zaroori details jaise faces ya text kho jaayenge — game over. Agar blur bahut dheere add karo, to use poora blur karne mein bahut time lagega. Best schedules (jaise "cosine") pehle dheere blur add karte hain (details bacha ke), beech mein tezi aate hain, phir end mein phir se dheere ho jaate hain.
Kyun? Kyunki hamara "de-blurring robot" (neural network) tab better seekhta hai jab har step equally hard ho. Agar ek step bahut easy hai aur doosra impossible, to robot confuse ho jaata hai. Ek achha schedule har step ko just-right difficult banata hai!
αt=1−βt (per-step signal retention), αˉt=∏s=1tαs (x0 se xt tak cumulative signal retention)
Correct linear schedule formula kya hai?
βt=β1+T−1(t−1)(βT−β1) — β1 (typically 10−4) se βT (typically 0.02) tak linear interpolation
Diffusion models mein cosine schedule linear schedule se better kyun perform karta hai?
Cosine S-curve decay deta hai: shuruaat mein signal zyada der preserve karta hai (kam early artifacts), smoother SNR gradient (stable training), linear schedule ka early collapse avoid karta hai jahan midpoint tak signal almost khatam ho jaata hai aur late steps waste ho jaate hain
Direct sampling formula xt=αˉtx0+1−αˉtϵ derive karo
xt=αtxt−1+1−αtϵt−1 se shuru karo. Recursively expand karo, Gaussian sum property N(0,σ12)+N(0,σ22)=N(0,σ12+σ22) use karo, variances simplify karo taaki x0 pe αˉt coefficient mile
Timestep t pe SNR kya hai aur schedule design ke liye yeh kyun matter karta hai?
SNR(t)=αˉt/(1−αˉt). Signal-to-noise ratio measure karta hai; constant logSNR decay ensure karta hai ki har denoising step mein uniform difficulty ho, jisse stable gradients aur better convergence milti hai
logSNR(0) ill-defined kyun hai aur SNR-based schedule mein hum ise kaise fix karte hain?
t=0 pe, αˉ0=1 isliye SNR(0)=1/0=∞ aur logSNR=+∞. Fix: regularize karo — αˉ0 ko 1−ε pe cap karo (finite λmax=logε1−ε milta hai) ya schedule ko tmin>0 se start karo
β1>0 (exactly zero nahi) kyun hona chahiye jabki hum shuruaat mein information preserve karna chahte hain?
Exactly zero se: (1) α1=1 se divide karne mein numerical issues, (2) zero gradient flow (koi learning signal nahi), (3) infinite/undefined log-SNR kyunki αˉ1=1. Chhota β1≈10−4 significant information loss ke bina stability deta hai
Ek achhe noise schedule ko kaunsi boundary conditions satisfy karni chahiye?
t=0 pe: αˉ0≈1 (no noise; finite log-SNR ke liye 1−ε pe cap). t=T pe: αˉT<0.01 (almost pure noise, prior N(0,I) se match kare). Kharab boundaries edge artifacts cause karti hain
αˉt schedule se βt kaise compute karte hain?
Definition αˉt=αˉt−1αt=αˉt−1(1−βt) se, rearrange karo: βt=1−αˉt/αˉt−1. Numerical stability ke liye valid range [10−4,0.999] mein clamp karo