WHAT model aapko deta hai: ek sasta simulator.
WHY hum ise chahte hain: plan karne ke liye / synthetic experience generate karne ke liye.
HOW hum ise paate hain: ya toh yeh given hai (chess ke rules exactly known hain) ya phir supervised regression se data se seekha jaata hai.
Hum koi formula seedha nahi denge. Isko build karte hain.
Step 1 — Hum kya observe karte hain? Data tuples D={(si,ai,si′,ri)} acting se collect kiye.
Yeh step kyun? Kyunki ek model ko real cause→effect samples pe train karna padta hai.
Step 2 — Target choose karo. Hum ek function f^θ(s,a) chahte hain jo s′ predict kare. Natural learning objective yeh hai ki predictions reality se match karein. Gaussian noise assumption s′=f(s,a)+ε, ε∼N(0,σ2I) use karke, maximum likelihood least squares ban jaata hai.
Yeh step kyun? Gaussian MLE ⇔ squared error minimize karo — loss yahan se aata hai, magic nahi hai.
Jab aapke paas P^,r^ ho, planning wohi Bellman idea use karti hai jaise model-free — lekin internally compute kiya jaata hai.
Continuous control ke liye hum aksar trajectory optimization / MPC use karte hain: current s0 se, action sequence a0:H search karo jo maximize kare
∑t=0H−1γtr^(s^t,at),s^t+1=f^(s^t,at),
sirf a0 execute karo, phir re-plan karo. WHY har step pe re-plan? Compounding model error correct karne ke liye (neeche steel-man).
Socho tum ek video game seekh rahe ho. Ek model-free bachcha bas buttons press karta rehta hai jab tak jeet na jaye — bahut time lagta hai aur kaafi lives jaati hain. Ek model-based bachcha pehle rules samajhta hai ("agar main yahan jump karun toh wahan land karunga"), phir level apni imagination mein plan test karne ke liye khelta hai, aur sirf tab buttons press karta hai jab soch liya. Woh bahut kam real lives kharach karta hai. Khatara yeh hai: agar unke imagined rules thodi galat hain, toh unka imagined plan bilkul galat ho sakta hai — isliye woh sirf kuch steps aage tak apni imagination pe trust karte hain, phir real screen dobara dekhte hain.
Model-based vs model-free RL ka core trade-off kya hai?
MBRL zyada computation use karta hai (planning/imagining) zyada sample efficiency achieve karne ke liye (kam real environment interactions).
Least-squares model-fitting loss kahan se aata hai?
Gaussian next-state noise assumption ke under maximum likelihood se; log-likelihood reduce hoti hai −2σ21∥s′−f^θ(s,a)∥2 mein.
s′ directly predict karne ki jagah Δs=s′−s kyun predict karo?
Change chhota aur stable hai regress karne ke liye (states slowly change hoti hain), large-magnitude near-identity targets se bachte hain; baad mein s add karo.
Learned MBRL ka #1 failure mode kya hai?
Long rollouts mein compounding model error — small per-step errors accumulate hoti hain, isliye plans ek galat "fantasy" model ke against banaye jaate hain.
Compounding model error ke liye do remedies?
Frequent re-planning ke saath short planning horizons (MPC) aur model ensembles / uncertainty estimation.
Dyna ka key idea kya hai?
Learned model use karke synthetic (imagined) transitions generate karo aur unpe extra value/policy updates run karo, scarce real data ko amplify karke.
Har step pe true observed next state se re-plan karne ke liye, model inaccuracies correct karne ke liye.
"Model given" aur "model learned" settings mein kya fark hai?
Given = exact rules known hain (e.g. chess/AlphaZero), sirf planning hard hai; learned = data se dynamics fit karo (e.g. robotics), model-error problems add ho jaati hain.
Model ke andar planning ke liye use hone wali Bellman optimality equation?