| Action-value function | Qπ(s,a)=Eπ[Gt∣St=s,At=a] | Reinforcement learning | 1 |
| Adam | θt+1=θt−ηv^t+ϵm^t | Optimization, Deep learning | 2 |
| Advantage function | Aπ(s,a)=Qπ(s,a)−Vπ(s) | Reinforcement learning | — |
| Arithmetic intensity | I=bytes movedFLOPs | Inference | 4 |
| Batch normalization | BN(xi)=γσB2+ϵxi−μB+β | Deep learning | 1 |
| Bayes' theorem | P(A∣B)=P(B)P(B∣A)P(A) | Probability | — |
| Bellman expectation equation | Vπ(s)=Eπ[r+γVπ(s′)∣s] | Reinforcement learning | 1 |
| Bellman optimality equation | V∗(s)=maxaE[r+γV∗(s′)∣s,a] | Reinforcement learning | — |
| Bernoulli distribution | p(x)=θx(1−θ)1−x,x∈{0,1} | Probability | — |
| Binomial distribution | P(k)=(kn)θk(1−θ)n−k | Probability | — |
| Central limit theorem | σ/nXˉn−μdN(0,1) | Probability | — |
| Chain rule | dxdf(g(x))=f′(g(x))⋅g′(x) | Calculus | 1 |
| Channel capacity | C=maxp(x)I(X;Y) | Information theory | — |
| Chinchilla scaling law | L(N,D)=E+NαA+DβB | Inference | 1 |
| Conditional entropy | H(Y∣X)=H(X,Y)−H(X) | Information theory | — |
| Conditional probability | P(A∣B)=P(B)P(A∩B) | Probability | — |
| Cosine learning-rate schedule | ηt=ηmin+21(ηmax−ηmin)(1+cosTtπ) | Optimization | — |
| Cosine similarity | sim(a,b)=∥a∥∥b∥a⋅b | Linear algebra | 4 |
| Covariance | Cov(X,Y)=E[(X−E[X])(Y−E[Y])] | Probability | 1 |
| Cross-entropy | H(P,Q)=−∑xP(x)logQ(x) | Information theory, Deep learning | 3 |
| Derivative | f′(x)=limh→0hf(x+h)−f(x) | Calculus | — |
| Determinant (2 by 2) | det(acbd)=ad−bc | Linear algebra | — |
| Directional derivative | Duf=∇f⋅u | Calculus | — |
| Discounted return | Gt=∑k=0∞γkrt+k+1 | Reinforcement learning | 1 |
| Discrete convolution | (f∗g)[n]=∑mf[m]g[n−m] | Deep learning | 1 |
| Dot product | a⋅b=∑i=1naibi=∥a∥∥b∥cosθ | Linear algebra | 3 |
| Dropout | h~=1−pm⊙h,mi∼Bernoulli(1−p) | Deep learning | 1 |
| Eigenvalue equation | Av=λv,v=0 | Linear algebra | 1 |
| Euclidean norm | ∥x∥2=∑i=1nxi2 | Linear algebra | 4 |
| Expected value | E[X]=∑xxp(x) | Probability | 1 |
| Fundamental theorem of calculus | ∫abf′(x)dx=f(b)−f(a) | Calculus | — |
| GELU | GELU(x)=x⋅Φ(x) | Deep learning | 1 |
| Gradient | ∇f=(∂x1∂f,…,∂xn∂f) | Calculus | 1 |
| Gradient descent | θt+1=θt−η∇θL(θt) | Optimization | 2 |
| Hessian | Hij=∂xi∂xj∂2f | Calculus | — |
| Integration by parts | ∫udv=uv−∫vdu | Calculus | — |
| Jacobian | Jij=∂xj∂fi | Calculus | — |
| Jensen–Shannon divergence | JSD(P∥Q)=21DKL(P∥M)+21DKL(Q∥M) | Information theory | — |
| Joint entropy | H(X,Y)=−∑x,yp(x,y)logp(x,y) | Information theory | — |
| Kullback–Leibler divergence | DKL(P∥Q)=∑xP(x)logQ(x)P(x) | Information theory, Probability | — |
| KV-cache size | MKV=2⋅L⋅H⋅dh⋅S⋅B⋅b | Inference | 8 |
| L1 regularization | Ltotal=L+λ∑i∣θi∣ | Optimization | 1 |
| L2 regularization | Ltotal=L+λ∥θ∥22 | Optimization | 1 |
| Lagrange multipliers | L(x,λ)=f(x)−λg(x) | Optimization | — |
| Law of total probability | P(A)=∑iP(A∣Bi)P(Bi) | Probability | — |
| Layer normalization | LN(x)=γ⊙σ2+ϵx−μ+β | Deep learning | — |
| Little's law | L=λW | Inference | 5 |
| Matrix multiplication | (AB)ij=∑k=1nAikBkj | Linear algebra | — |
| Memory-bound token latency | ttoken≈BWMweights+MKV | Inference | 4 |
| Model memory footprint | Mweights=N⋅b | Inference | 7 |
| Momentum | vt+1=βvt+∇θL,θt+1=θt−ηvt+1 | Optimization | 1 |
| Mutual information | I(X;Y)=∑x,yp(x,y)logp(x)p(y)p(x,y) | Information theory | — |
| Newton's method | θt+1=θt−H−1∇θL | Optimization | — |
| Normal distribution | p(x)=σ2π1exp(−2σ2(x−μ)2) | Probability | 1 |
| Outer product | (uv⊤)ij=uivj | Linear algebra | — |
| Perplexity | PPL=exp(−N1∑i=1Nlogp(xi∣x<i)) | Information theory, Inference | 2 |
| PPO clipped objective | L=E[min(ρtAt,clip(ρt,1−ϵ,1+ϵ)At)] | Reinforcement learning | — |
| Product rule | (fg)′=f′g+fg′ | Calculus | — |
| Q-learning update | Q(s,a)←Q(s,a)+α[r+γmaxa′Q(s′,a′)−Q(s,a)] | Reinforcement learning | 1 |
| REINFORCE policy gradient | ∇θJ=Eπθ[∇θlogπθ(a∣s)Gt] | Reinforcement learning | — |
| ReLU | ReLU(x)=max(0,x) | Deep learning | 2 |
| RMSProp | st+1=ρst+(1−ρ)(∇θL)2,θt+1=θt−st+1+ϵη∇θL | Optimization | 1 |
| Scaled dot-product attention | Attention(Q,K,V)=softmax(dkQK⊤)V | Deep learning | 4 |
| Self-information | I(x)=−logp(x) | Information theory | — |
| Shannon entropy | H(X)=−∑xp(x)logp(x) | Information theory, Probability | 1 |
| Sigmoid | σ(x)=1+e−x1 | Deep learning | 3 |
| Singular value decomposition | A=UΣV⊤ | Linear algebra | 1 |
| Sinusoidal positional encoding | PE(pos,2i)=sin(100002i/dpos) | Deep learning | 1 |
| Softmax | σ(z)i=∑j=1Kezjezi | Deep learning, Probability | 5 |
| Speculative decoding speedup | E[tokens per step]=1−α1−αk+1 | Inference | — |
| State-value function | Vπ(s)=Eπ[Gt∣St=s] | Reinforcement learning | 1 |
| Stochastic gradient descent | θt+1=θt−η∇θLB(θt) | Optimization | 2 |
| Taylor series | f(x)=∑n=0∞n!f(n)(a)(x−a)n | Calculus | — |
| Temperature sampling | pi=∑jexp(zj/T)exp(zi/T) | Inference, Deep learning | 3 |
| Temporal-difference error | δt=rt+1+γV(st+1)−V(st) | Reinforcement learning | — |
| Top-p (nucleus) sampling | Vp=min{V′⊆V:∑x∈V′p(x)≥p} | Inference | 3 |
| Trace | tr(A)=∑i=1nAii | Linear algebra | — |
| Transformer forward FLOPs | Cfwd≈2ND | Inference | 2 |
| Variance | Var(X)=E[(X−E[X])2] | Probability | 2 |
| Vector projection | projba=b⋅ba⋅bb | Linear algebra | — |