#P04 · Probability, Statistics & AI · Lv.2View in 3D Mind-Map

Expected Value & Variance

Christiaan Huygens & Pafnuty Chebyshev · 1657 CE

E[X]=∑ixipi,Var⁡(X)=E[(X−μ)2]=E[X2]−(E[X])2E[X] = \sum_i x_i p_i, \quad \operatorname{Var}(X) = E[(X-\mu)^2] = E[X^2] - (E[X])^2
σX=Var⁡(X),E[aX+b]=aE[X]+b\sigma_X = \sqrt{\operatorname{Var}(X)}, \quad E[aX+b] = aE[X]+b

Measures the center of mass (mean μ) and the squared spread around the mean (variance σ²) of a random variable.

🧮 Live Formula Calculator & Plotter
Payoff x₁ (p=0.5)
Payoff x₂ (p=0.3)
Payoff x₃ (p=0.2)
E[X]=10.00,Var⁡(X)=175.0−(10.0)2=75.00E[X] = 10.00, \quad \operatorname{Var}(X) = 175.0 - (10.0)^2 = 75.00
기댓값 E[X] (평균 μ)
10.000
분산 Var(X) = σ²
75.000
표준편차 σ
8.660
x₁(10)10.0x₂(20)20.0x₃(-5)-5.0E[X]10.0

Prerequisite Path (7 STEP)

Full Path Analyzer

Click steps in order to follow the 3D neon path from basics to target.

Geometric & Intuitive Insight

'제곱의 평균 빼기 평균의 제곱(E[X²] - E[X]²)'은 매번 편차를 구하지 않고도 한 번의 순회로 분산을 빠르게 계산하게 해 줍니다.

Step-by-Step Derivation

  1. Step 1.Var(X) = E[(X - μ)²] = E[X² - 2μX + μ²] (단, μ = E[X])
  2. Step 2.기댓값의 선형성에 의해 E[X²] - 2μE[X] + μ² = E[X²] - 2μ² + μ²
  3. Step 3.따라서 Var(X) = E[X²] - (E[X])²

AI & Coding Real-World Use

Core to Reinforcement Learning expected reward maximization, Batch/Layer Normalization, and Xavier/He weight initialization.

#Reinforcement Learning#Batch Normalization#Quant Risk#Weight Initialization
const mean = xs.reduce((a,b)=>a+b,0)/xs.length; const variance = xs.reduce((s,x)=>s+(x-mean)**2,0)/xs.length;

Probability, Statistics & AI — Related Formulas in This Cluster