Ek neural network par gradient descent se shuru karo. Loss function L saare parameters θ par depend karta hai, isliye:
∂θi∂L=∑paths∂output∂L⋅∂θi∂output
Key insight: Saare paths equally contribute nahi karte. Gradient routing ke through, sirf kuch specific weight combinations kisi task ke liye reinforce hote hain. Training ke dauran:
Specialization: Weights task-relevant paths ke saath strong connections banate hain
Pruning: Irrelevant paths ke gradients near-zero hote hain, unke weights chote rehte hain
Emergence: High-weight paths milke interpretable circuits banate hain
Setup: Model ke paas n dimensions hain, m features represent karne hain (m>n). Har feature i probability p se appear hoti hai (sparsity).
Claim: Agar features sparse hain, toh superposition m ko n se bahut zyada exceed karne deta hai.
Derivation:
Orthogonal baseline: Har feature ke liye ek dimension dedicate karo. Capacity: exactly n features. Agar features sparse hain, toh zyaatar dimensions zyaatar time zero hote hain — wasteful.
Superposition alternative: Feature i ko unit vector vi ke roop mein represent karo, chhota overlap ∣⟨vi,vj⟩∣≤s for i=j tolerate karte hue (ek "almost-orthogonal" set).
Kitne almost-orthogonal vectors fit hote hain? Ye spherical-code / Johnson–Lindenstrauss question hai. Key, correct fact ye hai:
m≲exp(cs2n)
ek fixed maximum overlap s ke liye. Yaani, jinhe aap pack kar sakte ho while overlaps s se neeche rakhte ho unki sankhya n mein exponentially badhti hai (fixed s ke liye), linearly nahi. Isliye sirf n dimensions wala ek model n se bahut zyada features encode kar sakta hai.
Exponential kyun, n/s2 nahi?Rn mein random unit vectors ka pairwise overlap 0 ke aas-paas concentrated hota hai standard deviation ≈1/n ke saath. Probability ki ek random pair overlap s exceed kare, exp(−cs2n) ki tarah decay hoti hai. (2m) pairs par union bound tab tak chhota rehta hai jab tak m≲exp(cs2n) — isliye exponential capacity.
Sparsity hi use karne layak banati hai: Kai vectors pack karna geometrically possible hai, lekin interference ke saath unhe decode karne ke liye active features kam hone chahiye. Agar ek waqt mein sirf k≈mp features active hain, toh kisi bhi feature par total interference ∼sk hai (random-sign accumulation). Ise signal (≈1) se neeche rakhne ke liye p chhota hona chahiye — isliye sparse features → zyada usable superposition.
Superpositionstorage format hai (features kaise pack hote hain)
Ek circuit "edges detect karo phir cat classify karo" implement kar sakta hai. "Edge" features 50 neurons mein superpose ho sakti hain, aur "cat" feature "dog" aur "fox" ke saath superpose ho sakti hai. Circuit specific linear combinations use karta hai un neurons ki taaki sahi features extract ho sakein.
Induction heads (Anthropic, 2022): Repeating-token circuits identify kiye gaye jo previous-token heads (earlier) aur induction heads (deeper) ke cross-layer composition se bante hain. Ablation in-context copying ko strongly degrade karta hai.
Toy models mein superposition (Elhage et al., 2022): Sparse features par ReLU networks train kiye. Paya ki networks reliably dimensions se bahut zyada features superposition ke through seekhte hain jab features sufficiently sparse hoon.
Vision models mein polysemanticity (Olah et al., 2020): InceptionV1 mein neurons multiple unrelated concepts ke liye respond karte hain (e.g., "car" + "dog face"). Sparse autoencoders inhe monosemantic features mein disentangle karte hain.
Recall Ek 12-Saal Ke Bacche Ko Samjhao
Socho tumhara brain 1,000 alag types ke Pokemon yaad karna chahta hai, lekin tumhare paas sirf 100 storage boxes hain. Ek Pokemon per box nahi aa sakta!
Solution: Tum notice karte ho ki tum saare Pokemon ek saath kabhi nahi dekhte — shayad kisi bhi battle mein sirf 10 appear hote hain. Toh tum ek smart labeling system banate ho: "Box 47 thoda Pikachu, thoda Charizard, aur thoda Mewtwo store karta hai." Jab Pikachu appear hota hai, tum Box 47 (aur Boxes 12, 89) mein dekhte ho aur clues combine karke Pikachu pehchante ho.
Ye hai superposition: overlap use karke apni jagah se zyada cheezein store karna (kyunki cheezein ek saath nahi aati).
Circuits teri battle strategies ki tarah hain: "Agar Pikachu dikhe, Water-type use karo." Ye wo rules hain jo tum follow karte ho. Storage trick (superposition) sirf zyada Pokemon yaad rakhne mein help karti hai taaki tumhari strategies smarter ho sakein!
2.1.02-ReLU-and-activation-functions: Nonlinearity interference ke bawajood feature recovery mein help karta hai (lekin superposition khud linear compression hai)
Network ka ek subgraph (neurons + weighted connections) jo ek coherent, interpretable computational algorithm implement karta hai. Ise ablate karne se corresponding behavior causally toot jaata hai.
Neural networks mein superposition kya hai?
Jab ek model dimensions se zyada features represent karta hai features ko nearly-orthogonal (lekin perfectly orthogonal nahi) directions ke roop mein store karke. Ye fundamentally linear compression hai: n dimensions mein m>n features.
Kyunki ek waqt mein sirf kuch features active hote hain, accumulated interference ∼smp signal se neeche rehta hai, isliye features decodable rehte hain. Sparse features → zyada usable superposition.
Rn mein fixed overlap s ke liye roughly kitne almost-orthogonal vectors fit hote hain?
Exponentially many: m≲exp(cs2n). Geometric ceiling n mein exponentially badhta hai, isliye ye rarely binding constraint hota hai — sparsity hoti hai.
Polysemantic neuron kya hota hai?
Ek neuron jo multiple unrelated features ke liye activate hota hai. Ye superposition ka consequence hai: multiple feature vectors ke components us neuron ke axis ke saath hote hain.
Circuit kaise identify karte hain?
(1) Behavior observe karo, (2) Hypothesize karo kaunse neurons/heads involved hain, (3) Un components ko ablate (zero out) karo, (4) Check karo ki behavior toot jaata hai ya nahi. Circuits causal necessity se define hote hain, correlation se nahi.
Middle/deep layers mein (e.g. GPT-2 mein layers 5, 7, 9), un previous-token heads se deeper jo unhe read karte hain — cross-layer composition ke liye writer (earlier) ko reader (later) se pehle run karna hota hai.
Kya superposition ke liye nonlinear activation chahiye?
Nahi. Superposition linear compression hai (m>n ek linear map ke through, jaise random projections). Nonlinearity features recover/denoise karne mein help karta hai, lekin unhe superposition mein store karne ke liye zaruri nahi.
Circuits aur superposition kaise related hain?
Circuits algorithm hain (computational graph); superposition storage format hai (features kaise compress hote hain). Circuits superposed features ke linear combinations par operate karte hain.
Sirf activation magnitude se circuits kyun identify nahi kar sakte?
Kyunki (1) circuits causal paths ke baare mein hain, magnitude ke nahi, aur (2) superposition ka matlab hai same neuron multiple circuits mein participate karta hai. Causal necessity test karne ke liye ablation use karna padta hai.