Free CAS MAS-II (Modern Actuarial Statistics II) Formula Sheet (2026)

Every MAS-II formula you need on the test, grouped by topic and rendered with full math notation. 146 formulas across 4 topics, calibrated to the 2026 syllabus. Free forever, no signup required.

146 formulas 4 topics 2026 syllabus Free forever
Print-ready PDF: 1080x1350 portrait, math pre-rendered, fonts embedded. Download once, study anywhere.
Download PDF →

All MAS-II Formulas

Introduction to Credibility 25 items
Limited fluctuation full credibility standard (claim count)
nF=(z(1+P)/2k)2n_F = \left( \dfrac{z_{(1+P)/2}}{k} \right)^2
where P = probability the estimate is within k of the expected value (Poisson claim counts).
Full credibility for pure premium
nFPP=nFN×(1+CVX2)n_F^{PP} = n_F^{N} \times (1 + CV_X^2)
where nFNn_F^N is the full credibility standard for claim count, CVX=σX/μXCV_X = \sigma_X/\mu_X is severity coefficient of variation.
Full credibility for aggregate losses (compound Poisson)
nFAgg=nFN(1+CVX2)n_F^{Agg} = n_F^N (1 + CV_X^2)
Same as pure premium, because aggregate losses = N ×\times X under compound Poisson with independence.
Partial credibility (limited fluctuation)
Z=nnFZ = \sqrt{\dfrac{n}{n_F}}
Capped at 1. Credibility-weighted estimate: X^=ZXˉ+(1−Z)M\hat{X} = Z \bar{X} + (1 - Z)M where M is the complement.
Bühlmann credibility (greatest accuracy)
Z=nn+kZ = \dfrac{n}{n + k} where k=EPVVHMk = \dfrac{\text{EPV}}{\text{VHM}}
EPV = Expected Process Variance, VHM = Variance of Hypothetical Means.
PC=ZXˉ+(1−Z)μP_C = Z \bar{X} + (1 - Z)\mu
Expected process variance (EPV)
EPV=E[Var(X∣Θ)]\text{EPV} = E[\text{Var}(X | \Theta)]
Average of conditional variances across risk types (within-risk variation).
Variance of hypothetical means (VHM)
VHM=Var(E[X∣Θ])\text{VHM} = \text{Var}(E[X | \Theta])
Variance of conditional means across risk types. Total variance: Var(X)=EPV+VHM\text{Var}(X) = \text{EPV} + \text{VHM}
Bühlmann-Straub credibility (varying exposures)
Zi=mimi+kZ_i = \dfrac{m_i}{m_i + k} where mi=∑jmijm_i = \sum_j m_{ij}, k=vak = \dfrac{v}{a}, v = expected process variance per unit exposure, a = variance of hypothetical means.
Bayesian credibility (conjugate prior families)
X | λ\lambda is Poisson, λ\lambda is Gamma(α,β)(\alpha, \beta). Posterior Gamma(α+∑Xi,β+n)(\alpha + \sum X_i, \beta + n), mean α+∑Xiβ+n\dfrac{\alpha + \sum X_i}{\beta + n}, Z=n/(n+β)Z = n/(n + \beta).
Bayesian credibility (Normal-Normal)
X | μ\mu ~ N(μ,σ2)(\mu, \sigma^2), μ\mu ~ N(μ0,τ2)(\mu_0, \tau^2). Posterior mean σ2/n⋅μ0+τ2Xˉσ2/n+τ2\dfrac{\sigma^2/n \cdot \mu_0 + \tau^2 \bar{X}}{\sigma^2/n + \tau^2}. Z=nn+σ2/τ2Z = \dfrac{n}{n + \sigma^2/\tau^2}.
Empirical Bayes (non-parametric) credibility
EPV^=1r∑isi2\widehat{\text{EPV}} = \dfrac{1}{r} \sum_i s_i^2 (avg within-risk sample variance)
VHM^=sXˉ2−EPV^/n\widehat{\text{VHM}} = s_{\bar{X}}^2 - \widehat{\text{EPV}}/n
Empirical Bayes (semi-parametric) credibility
For Poisson, Var(X∣Θ)=Θ\text{Var}(X | \Theta) = \Theta, so EPV^=Xˉ\widehat{\text{EPV}} = \bar{X} (the grand mean). VHM estimated from cross-risk variation in observed rates.
Linear least-squares (Bühlmann) credibility derivation
Choose Z to minimize E[(ZXˉ+(1−Z)μ−E[X∣Θ])2]E[(Z \bar{X} + (1 - Z)\mu - E[X | \Theta])^2]. Solution: Z=aa+v/nZ = \dfrac{a}{a + v/n} where a = VHM, v = expected process variance per observation.
Credibility complement
PC=ZXˉ+(1−Z)MP_C = Z \bar{X} + (1 - Z) M
Benchmark M: overall manual rate, larger-class rate, prior-year experience adjusted for trend, present rates underlying current rates.
Loss-ratio credibility weighting
Indicated rate change I=Z⋅Actual LRTarget LR+(1−Z)⋅Trended Current Rate ChangeI = Z \cdot \dfrac{\text{Actual LR}}{\text{Target LR}} + (1 - Z) \cdot \text{Trended Current Rate Change}
Bühlmann credibility for severity
Z=NN+kZ = \dfrac{N}{N + k} where N = observed claim count and k reflects EPV and VHM in the severity dimension.
Conjugate priors summary
Likelihood / Conjugate Prior (= Posterior):
Poisson / Gamma
Binomial / Beta
Normal (known σ\sigma) / Normal
Normal (unknown σ\sigma) / Normal-Inverse-Gamma
Exponential / Gamma
Credibility-weighted reserving (Cape Cod)
ELR^=∑Ci∑(Pi⋅fi)\widehat{\text{ELR}} = \dfrac{\sum C_i}{\sum (P_i \cdot f_i)}, fif_i = expected reporting percent
Ulti=Ci+(1−fi)⋅Pi⋅ELR^\text{Ult}_i = C_i + (1 - f_i) \cdot P_i \cdot \widehat{\text{ELR}}
Effect of trend and benefit changes on credibility
Develop and trend experience to current level BEFORE applying credibility. Z is unchanged; the trended experience replaces Xˉ\bar{X}.
Mahler credibility (changing risk parameters)
ρ1,t2\rho_{1, t}^2 is the squared correlation between year 1 and year t hypothetical means. When the risk parameter evolves over time, older years receive lower weight.
Exposure-weighted risk average in Buhlmann-Straub
Xˉi=∑jmij Xijmi\bar{X}_i = \frac{\sum_j m_{ij}\,X_{ij}}{m_i}
mijm_{ij} = exposure for risk i period j, XijX_{ij} = loss per unit exposure, mim_i = total exposure
Bayesian predictive premium
PB=∫μ(θ) π(θ∣x) dθP_B = \int \mu(\theta)\,\pi(\theta\mid\mathbf{x})\,d\theta
μ(θ) = hypothetical mean, π(θ|x) = posterior density of Θ, x = observed data
Classical limited fluctuation reliability criterion
Pr⁡(∣Xˉ−μ∣≤kμ)≥1−α\Pr(|\bar{X} - \mu| \le k\mu) \ge 1 - \alpha
X̄ = sample mean, μ = true mean, k = tolerance fraction, α = error probability
Poisson-Gamma posterior mean
α+∑xiβ+n\dfrac{\alpha + \sum x_i}{\beta + n}
α, β = Gamma prior hyperparameters, ΣxiΣx_i = sum of observed claim counts, n = number of exposure periods
Credibility-weighted premium
Pc=ZXˉ+(1−Z)μP_c = Z\bar{X} + (1-Z)\mu
Z = credibility weight, X̄ = observed risk mean, μ = collective/prior/manual mean
Linear Mixed Models 22 items
Linear mixed model general form
Y=Xβ+Zb+ε\mathbf{Y} = \mathbf{X} \boldsymbol{\beta} + \mathbf{Z} \mathbf{b} + \boldsymbol{\varepsilon}
β\boldsymbol{\beta} = fixed-effect coefficients, b\mathbf{b} = random effects (with b∼N(0,G)\mathbf{b} \sim N(\mathbf{0}, \mathbf{G})), ε∼N(0,R)\boldsymbol{\varepsilon} \sim N(\mathbf{0}, \mathbf{R}).
Fixed effects vs random effects
Fixed: coefficients for ALL levels of interest, estimated directly.
Random: levels sampled from a population; estimate VARIANCE of the level effects rather than each effect.
Random intercept model
Yij=(β0+b0i)+β1xij+εijY_{ij} = (\beta_0 + b_{0i}) + \beta_1 x_{ij} + \varepsilon_{ij} where b0i∼N(0,σb2)b_{0i} \sim N(0, \sigma_b^2). Common slope β1\beta_1 across groups.
Random slope model
Yij=β0+(β1+b1i)xij+εijY_{ij} = \beta_0 + (\beta_1 + b_{1i}) x_{ij} + \varepsilon_{ij} where b1i∼N(0,σb12)b_{1i} \sim N(0, \sigma_{b1}^2). Each group has its own slope.
Intraclass correlation coefficient (ICC)
ICC=σb2σb2+σ2\text{ICC} = \dfrac{\sigma_b^2}{\sigma_b^2 + \sigma^2}
Proportion of total variance attributable to between-group differences.
Best linear unbiased predictor (BLUP)
b^=GZ′(ZGZ′+R)−1(Y−Xβ^)\hat{\mathbf{b}} = \mathbf{G} \mathbf{Z}' (\mathbf{Z} \mathbf{G} \mathbf{Z}' + \mathbf{R})^{-1} (\mathbf{Y} - \mathbf{X} \hat{\boldsymbol{\beta}})
Shrinks group means toward the grand mean.
REML vs ML estimation
ML: maximizes full likelihood; variance components biased downward in small samples.
REML: maximizes likelihood of contrasts orthogonal to fixed effects; less biased variance estimates.
Likelihood ratio test for variance components
Test H0:σb2=0H_0: \sigma_b^2 = 0 vs Ha:σb2>0H_a: \sigma_b^2 > 0: Λ=−2(ℓ0−ℓa)\Lambda = -2(\ell_0 - \ell_a)
Null: 12χ02+12χ12\frac{1}{2}\chi_0^2 + \frac{1}{2}\chi_1^2 (boundary); divide the χ12\chi_1^2 p-value by 2.
LMM vs GEE (marginal models)
LMM: subject-specific (conditional) interpretation of β\beta.
GEE: population-average (marginal) interpretation; specifies only the mean and working correlation.
Variance component interpretation in actuarial context
σb2\sigma_b^2 measures cross-territory loss variation NOT explained by fixed-effect covariates. Higher σb2\sigma_b^2 = more value to including territory random effects.
BLUP shrinkage (credibility) factor for group i
Zi=niσu2niσu2+σε2Z_i = \frac{n_i \sigma_u^2}{n_i \sigma_u^2 + \sigma_\varepsilon^2}
nin_i = obs in group i, σu2\sigma_u^2 = random-effect variance, σε2\sigma_\varepsilon^2 = residual variance
Boundary-corrected p-value for variance-component LRT
p=12P(χ12≥LRT)p = \tfrac{1}{2} P(\chi^2_1 \ge \text{LRT})
LRT = likelihood ratio statistic, p = tail probability under 50:50 χ02/χ12\chi^2_0/\chi^2_1 mixture
Marginal distribution of LMM response
y∼N(Xβ,  ZGZ⊤+R)y \sim N(X\beta,\;ZGZ^{\top} + R)
X = fixed-effect design, β = fixed effects, Z = random-effect design, G = Var(u), R = Var(ε)
Marginal covariance matrix V of LMM
V=ZGZ⊤+RV = ZGZ^{\top} + R
Z = random-effect design, G = random-effect covariance, R = residual covariance; V is what REML and ML actually fit
Conditional variance of LMM response given random effects
Var⁡(y∣u)=R\operatorname{Var}(y \mid u) = R
R = residual covariance matrix; conditional on u the LMM reduces to standard linear regression with covariance R
Conditional mean of LMM response given random effects
E[y∣u]=Xβ+ZuE[y \mid u] = X\beta + Zu
X = fixed-effect design, β = fixed effects, Z = random-effect design, u = realized random-effect vector
BLUP shrinkage factor for hierarchical group j
λj=τ2/(τ2+σ2/nj)\lambda_j = \tau^2 / (\tau^2 + \sigma^2/n_j)
τ² = between-group variance, σ² = within-group variance, njn_j = group j sample size
Hierarchical partially pooled group rate
β^0+u^j=β^0+λj(yˉj−β^0)\hat{\beta}_0 + \hat{u}_j = \hat{\beta}_0 + \lambda_j(\bar{y}_j - \hat{\beta}_0)
β₀ = grand intercept, λjλ_j = shrinkage factor, ȳ_j = group j sample mean
Boundary null distribution for variance-component LRT
LRT∼12χ02+12χ12\text{LRT} \sim \tfrac{1}{2}\chi^2_0 + \tfrac{1}{2}\chi^2_1 under H0:τ2=0H_0: \tau^2 = 0
mixture because zero sits on parameter-space boundary
Marginal residuals in linear mixed model
rM=y−Xβ^r^M = y - X\hat{\beta}
y = response vector, X = fixed-effect design matrix, β̂ = estimated fixed-effect coefficients
Likelihood ratio test statistic for nested LMMs
LR=−2(ℓR−ℓF)LR = -2(\ell_R - \ell_F)
ℓ_R = maximized log-likelihood of reduced model, ℓ_F = maximized log-likelihood of full (nesting) model
Conditional residuals in linear mixed model
rC=y−Xβ^−Zb^r^C = y - X\hat{\beta} - Z\hat{b}
Z = random-effect design matrix, b̂ = predicted random effects (BLUPs), X, β̂ as in marginal residuals
Statistical Learning 72 items
Bias-variance decomposition
E[(y−f^(x))2]=(Bias[f^(x)])2+Var[f^(x)]+σε2E[(y - \hat{f}(x))^2] = (\text{Bias}[\hat{f}(x)])^2 + \text{Var}[\hat{f}(x)] + \sigma_\varepsilon^2
Irreducible error σε2\sigma_\varepsilon^2 cannot be reduced.
Training, validation, and test sets
Training: fit model parameters.
Validation: tune hyperparameters, select the model.
Test: estimate generalization error of the FINAL model. Never tune hyperparameters on test data.
k-fold cross-validation
For each fold i: train on the other k-1 folds, evaluate on fold i. CV error =1k∑i=1kMSEi= \dfrac{1}{k} \sum_{i=1}^k \text{MSE}_i. Typical k = 5 or 10.
LOOCV: k = n.
Bootstrap
Sample with replacement: B bootstrap samples, each of size n.
SE^∗=1B−1∑(θ^b∗−θ^ˉ∗)2\widehat{\text{SE}}^* = \sqrt{\dfrac{1}{B-1} \sum (\hat\theta_b^* - \bar{\hat\theta}^*)^2}
OLS estimator (matrix form)
β^=(X′X)−1X′y\hat{\boldsymbol{\beta}} = (\mathbf{X}'\mathbf{X})^{-1} \mathbf{X}'\mathbf{y}
Var(β^)=σ2(X′X)−1\text{Var}(\hat{\boldsymbol{\beta}}) = \sigma^2 (\mathbf{X}'\mathbf{X})^{-1}
Under Gauss-Markov, OLS is BLUE.
Multiple R-squared and adjusted R-squared
R2=1−SSresSStotR^2 = 1 - \dfrac{SS_{res}}{SS_{tot}}. Never decreases when predictors are added.
Radj2=1−SSres/(n−p−1)SStot/(n−1)R^2_{adj} = 1 - \dfrac{SS_{res}/(n - p - 1)}{SS_{tot}/(n - 1)} penalizes extra predictors p.
AIC and BIC
AIC=2k−2ln⁡L\text{AIC} = 2k - 2\ln L (k = parameters, L = max likelihood).
BIC=kln⁡n−2ln⁡L\text{BIC} = k \ln n - 2\ln L.
Lower is better; BIC favors smaller models.
Ridge regression (L2 penalty)
β^ridge=arg⁡min⁡∑(yi−xi′β)2+λ∑βj2\hat{\boldsymbol{\beta}}_{\text{ridge}} = \arg\min \sum (y_i - \mathbf{x}_i' \boldsymbol{\beta})^2 + \lambda \sum \beta_j^2
Closed form: β^ridge=(X′X+λI)−1X′y\hat{\boldsymbol{\beta}}_{\text{ridge}} = (\mathbf{X}'\mathbf{X} + \lambda \mathbf{I})^{-1}\mathbf{X}'\mathbf{y}. Shrinks coefficients toward zero (never to zero).
Lasso regression (L1 penalty)
β^lasso=arg⁡min⁡∑(yi−xi′β)2+λ∑∣βj∣\hat{\boldsymbol{\beta}}_{\text{lasso}} = \arg\min \sum (y_i - \mathbf{x}_i' \boldsymbol{\beta})^2 + \lambda \sum |\beta_j|
L1 penalty produces exact zeros: performs variable selection.
Elastic net
β^=arg⁡min⁡∑(yi−xi′β)2+λ1∑∣βj∣+λ2∑βj2\hat{\boldsymbol{\beta}} = \arg\min \sum (y_i - \mathbf{x}_i' \boldsymbol{\beta})^2 + \lambda_1 \sum |\beta_j| + \lambda_2 \sum \beta_j^2
Combines lasso variable selection with ridge stability.
Variable selection: forward, backward, stepwise
Forward: start empty; add the predictor that most improves fit.
Backward: start full; remove the least helpful predictor.
Stepwise: alternate both; previously-added vars can be removed.
Logistic regression
Pr⁡(Y=1∣x)=11+e−x′β\Pr(Y = 1 | \mathbf{x}) = \dfrac{1}{1 + e^{-\mathbf{x}' \boldsymbol{\beta}}}
ln⁡p1−p=x′β\ln \dfrac{p}{1 - p} = \mathbf{x}' \boldsymbol{\beta}
eβje^{\beta_j} = odds ratio per unit change in xjx_j.
Linear discriminant analysis (LDA)
Assumes each class is Gaussian with a SHARED covariance matrix. Decision boundary is linear.
δk(x)=x′Σ−1μk−12μk′Σ−1μk+ln⁡πk\delta_k(\mathbf{x}) = \mathbf{x}' \boldsymbol{\Sigma}^{-1} \boldsymbol{\mu}_k - \frac{1}{2} \boldsymbol{\mu}_k' \boldsymbol{\Sigma}^{-1} \boldsymbol{\mu}_k + \ln \pi_k. Classify to k with highest δk\delta_k.
Quadratic discriminant analysis (QDA)
Each class has its OWN covariance matrix Σk\boldsymbol{\Sigma}_k. Decision boundary is quadratic.
Preferred when sample size is large and class covariances clearly differ.
k-Nearest Neighbors (KNN)
Majority vote among the k nearest training points.
Low k: low bias, high variance (overfits).
High k: high bias, low variance.
Sensitive to feature scaling (always standardize).
Decision tree splitting criteria
Regression: minimize ∑R(yi−yˉR)2\sum_R (y_i - \bar{y}_R)^2
Gini =∑kpk(1−pk)= \sum_k p_k(1 - p_k); Entropy =−∑kpkln⁡pk= -\sum_k p_k \ln p_k; Classification error =1−max⁡kpk= 1 - \max_k p_k
Bagging (bootstrap aggregating)
Build B trees on bootstrap samples; average predictions (regression) or majority vote (classification). Reduces variance. Each tree uses all p predictors.
Random forest
Bagging plus random subset of predictors at each split (typical m = p\sqrt{p} for classification, m = p/3 for regression). Decorrelates trees, further reducing variance.
Boosting (AdaBoost and gradient boosting)
AdaBoost: fit weak learners to reweighted data (misclassified points up-weighted).
Gradient boosting: fit each new tree to the residuals (or negative gradient of loss) of the current ensemble.
Confusion matrix and classification metrics
Accuracy = (TP + TN) / N
Sensitivity (recall, TPR) = TP / (TP + FN)
Specificity (TNR) = TN / (TN + FP)
Precision (PPV) = TP / (TP + FP)
F1 = 2⋅P⋅RP+R\dfrac{2 \cdot P \cdot R}{P + R}
ROC curve and AUC
ROC plots sensitivity (TPR) vs 1 −- specificity (FPR) across thresholds.
AUC = probability the model ranks a random positive higher than a random negative; 0.5 = random.
Principal Components Analysis (PCA)
Loadings = eigenvectors of X′X/(n−1)\mathbf{X}'\mathbf{X}/(n-1), centered data X\mathbf{X}. Variance explained by PC i = eigenvalue λi/∑jλj\lambda_i / \sum_j \lambda_j.
For K-means clustering, state the objective, the two alternating steps, and why multiple random starts are used.
Partition n points into K clusters minimizing within-cluster sum of squares ∑k=1K∑i∈Ck∥xi−μk∥2\sum_{k=1}^K \sum_{i \in C_k} \|\mathbf{x}_i - \boldsymbol{\mu}_k\|^2. Algorithm: assign each point to nearest centroid; update centroids; repeat until convergence. Local minima possible (run with multiple random starts).
Hierarchical clustering linkage methods
Single: closest points across clusters (chains).
Complete: farthest points (compact clusters).
Average: mean pairwise distance.
Ward: minimize increase in within-cluster variance.
Silhouette score
si=bi−aimax⁡(ai,bi)s_i = \dfrac{b_i - a_i}{\max(a_i, b_i)} where aia_i = mean distance to its own cluster, bib_i = mean distance to nearest other cluster. Range −1-1 to +1+1.
Naive Bayes classifier
P(Y=k∣x)∝P(Y=k)∏jP(xj∣Y=k)P(Y = k | \mathbf{x}) \propto P(Y = k) \prod_j P(x_j | Y = k)
Assumes predictors are independent given the class.
Generalized linear models (GLM) actuarial workhorse
Random component (exponential family distribution), systematic component (η=x′β\eta = \mathbf{x}' \boldsymbol{\beta}), and link function g such that g(μ)=ηg(\mu) = \eta.
GLM deviance and goodness-of-fit
Deviance D=−2(ℓfitted−ℓsaturated)D = -2 (\ell_{\text{fitted}} - \ell_{\text{saturated}}). For Gaussian, D = residual sum of squares. For Poisson, D=2∑[yiln⁡(yi/μ^i)−(yi−μ^i)]D = 2 \sum [y_i \ln(y_i / \hat{\mu}_i) - (y_i - \hat{\mu}_i)]. Asymptotically χn−p2\chi^2_{n - p}. Likelihood ratio test: ΔD∼χΔp2\Delta D \sim \chi^2_{\Delta p} for nested model comparison.
Splines and polynomial regression
Polynomial: x,x2,…,xdx, x^2, \ldots, x^d as predictors; global.
Regression splines: piecewise polynomials joined at knots.
Natural splines: linear past boundary knots (less variance at edges).
Generalized additive models (GAM)
g(μ)=β0+∑jfj(xj)g(\mu) = \beta_0 + \sum_j f_j(x_j) where each fjf_j is a smooth function (spline) of one predictor. Captures nonlinearity without interactions.
Gini index from Lorenz curve
G=2∫01(x−L(x)) dxG = 2\int_0^1 (x - L(x))\,dx
G = Gini index, x = cumulative exposure share, L(x) = cumulative actual loss share at x
Root mean squared error (RMSE)
RMSE=1n∑(yi−y^i)2\text{RMSE} = \sqrt{\tfrac{1}{n}\sum (y_i - \hat{y}_i)^2}
n = hold-out size, yiy_i = actual, ŷ_i = predicted for policy i
Double lift chart sort ratio
Ri=y^iB/y^iAR_i = \hat{y}^B_i / \hat{y}^A_i
R = sort key, ŷ^B = challenger prediction for policy i, ŷ^A = incumbent prediction for policy i
GLM deviance against saturated model
D=2∑(ℓ(yi;yi)−ℓ(yi;y^i))D = 2\sum (\ell(y_i; y_i) - \ell(y_i; \hat{y}_i))
D = deviance, ℓ(y;y) = saturated log-likelihood, ℓ(y;ŷ) = fitted log-likelihood
Gradient boosting pseudo-residual
rim=−∂L(yi,f(xi))∂f(xi)∣f=Fm−1r_{im} = -\left.\frac{\partial L(y_i, f(x_i))}{\partial f(x_i)}\right|_{f=F_{m-1}}
L = loss, yiy_i = target, Fm−1F_{m-1} = current ensemble, rimr_{im} = stage-m pseudo-residual
Variance of bagged ensemble prediction
Var(fˉ)=ρσ2+1−ρBσ2\text{Var}(\bar{f}) = \rho\sigma^{2} + \frac{1-\rho}{B}\sigma^{2}
ρ = pairwise tree correlation, σ² = individual tree variance, B = number of trees
AdaBoost stage weight alpha
αm=log⁡ ⁣((1−errm)/errm)\alpha_m = \log\!\big((1-\text{err}_m)/\text{err}_m\big)
errmerr_m = weighted classification error at stage m, αmα_m = log-odds weight assigned to stump m
Bagged regression ensemble prediction
f^bag(x)=1B∑b=1Bf^∗b(x)\hat{f}_{\text{bag}}(x) = \frac{1}{B}\sum_{b=1}^{B}\hat{f}^{*b}(x)
B = number of bootstrap trees, f^∗b\hat{f}^{*b} = b-th tree fit on bootstrap sample, x = input vector
AUROC as Mann-Whitney concordant-pair estimator
AUROC^=#{p^i>p^j}+0.5 #{p^i=p^j}n1n0\widehat{\text{AUROC}} = \dfrac{\#\{\hat{p}_i > \hat{p}_j\} + 0.5\,\#\{\hat{p}_i = \hat{p}_j\}}{n_1 n_0}
i indexes positives, j negatives; n1n_1, n0n_0 counts; ties get 0.5 credit.
Lorenz-based Gini coefficient
Gini=2∫01(x−L(x)) dx\text{Gini} = 2 \int_{0}^{1} (x - L(x))\,dx
x = cumulative exposure share, L(x) = cumulative loss share at depth x.
Lift in a scored bin
Liftb=positivesb/nbpositivestotal/N\text{Lift}_b = \dfrac{\text{positives}_b / n_b}{\text{positives}_{\text{total}} / N}
nbn_b = records in bin b, N = total records; positives counted in numerator bin and denominator overall.
KNN regression prediction (unweighted mean)
f^(x0)=1K∑i∈NK(x0)yi\hat{f}(x_0) = \frac{1}{K}\sum_{i \in \mathcal{N}_K(x_0)} y_i
K = neighbor count, NK(x0)\mathcal{N}_K(x_0) = K nearest training points to query x0x_0, yiy_i = neighbor response
Inverse-distance weighted KNN regression prediction
f^(x0)=∑i∈NKwiyi∑i∈NKwi,  wi=1d(x0,xi)\hat{f}(x_0) = \frac{\sum_{i \in \mathcal{N}_K} w_i y_i}{\sum_{i \in \mathcal{N}_K} w_i}, \; w_i = \frac{1}{d(x_0, x_i)}
d(x0,xi)d(x_0,x_i) = distance from query to neighbor i
Euclidean distance between feature vectors
d(x,y)=∑j(xj−yj)2d(x,y) = \sqrt{\sum_j (x_j - y_j)^2}
xj,yjx_j, y_j = j-th standardized feature of points x and y, sum runs over all p features
KNN classifier posterior probability estimate
P^(Y=j∣X=x0)=1K∑i∈NK(x0)1{yi=j}\hat{P}(Y=j \mid X=x_0) = \frac{1}{K}\sum_{i \in \mathcal{N}_K(x_0)} \mathbf{1}\{y_i=j\}
NK(x0)\mathcal{N}_K(x_0) = K nearest training points to query x0x_0
Proportion of variance explained by a principal component
PVEm=λm/∑j=1pλj\mathrm{PVE}_m = \lambda_m / \sum_{j=1}^{p}\lambda_j
λm\lambda_m = mth eigenvalue of sample covariance (or correlation) matrix, p = number of variables
First loading vector as variance maximizer
ϕ1=arg⁡max⁡∥ϕ∥=11n∑i=1n(ϕ⊤x~i)2\phi_1 = \arg\max_{\|\phi\|=1}\frac{1}{n}\sum_{i=1}^{n}(\phi^\top \tilde{x}_i)^2
ϕ\phi = unit vector, x~i\tilde{x}_i = centered observation, n = sample size
Principal component score
zim=ϕm⊤x~i=∑j=1pϕjmx~ijz_{im} = \phi_m^\top \tilde{x}_i = \sum_{j=1}^{p}\phi_{jm}\tilde{x}_{ij}
ϕm\phi_m = mth unit loading vector, x~i\tilde{x}_i = centered observation, p = number of variables
Total variance identity in PCA
∑m=1pλm=tr(S)=∑j=1psj2\sum_{m=1}^{p}\lambda_m = \mathrm{tr}(S) = \sum_{j=1}^{p}s_j^{2}
λm\lambda_m = mth eigenvalue, S = sample covariance matrix, sj2s_j^2 = sample variance of variable j
Proportion of variance explained by PC j
PVEj=λj/∑k=1pλk\text{PVE}_j = \lambda_j / \sum_{k=1}^{p} \lambda_k
λj\lambda_j = eigenvalue of PC j, p = number of variables
K-means total within-cluster sum of squares objective
W=∑k=1K∑i∈Ck∥xi−xˉk∥2W = \sum_{k=1}^{K}\sum_{i \in C_k} \lVert x_i - \bar{x}_k \rVert^{2}
K = number of clusters, CkC_k = cluster k, xix_i = observation, \bar{x}_k = cluster k centroid
Centroid linkage distance between two clusters
d(A,B)=∥xˉA−xˉB∥d(A,B) = \lVert \bar{x}_A - \bar{x}_B \rVert
A, B = clusters, \bar{x}_A, \bar{x}_B = centroids of A and B, ∥⋅∥\lVert \cdot \rVert = Euclidean norm
Eigenvalue from prcomp sdev output
λj=sdevj2\lambda_j = \text{sdev}_j^2
λj\lambda_j = variance captured by PC j, sdevj\text{sdev}_j = standard deviation of PC j from prcomp
Single linkage distance between two clusters
d(A,B)=min⁡i∈A, j∈Bd(xi,xj)d(A,B) = \min_{i \in A,\, j \in B} d(x_i, x_j)
A, B = clusters, xix_i, xjx_j = points in A and B, d = pairwise distance metric
Unit-length constraint on PCA loadings
∑i=1pϕij2=1\sum_{i=1}^{p} \phi_{ij}^{2} = 1
ϕij\phi_{ij} = loading of variable i on PC j, p = number of variables
PC score for a standardized observation
zij=∑k=1pϕkj(xik−xˉk)/skz_{ij} = \sum_{k=1}^{p} \phi_{kj} (x_{ik} - \bar{x}_k)/s_k
ϕkj\phi_{kj} = loading, xikx_{ik} = raw value, xˉk\bar{x}_k = mean, sks_k = SD
Complete linkage distance between two clusters
d(A,B)=max⁡i∈A, j∈Bd(xi,xj)d(A,B) = \max_{i \in A,\, j \in B} d(x_i, x_j)
A, B = clusters, xix_i, xjx_j = points in A and B, d = pairwise distance metric
Sigmoid activation function
g(z)=11+e−zg(z) = \frac{1}{1 + e^{-z}}
z = pre-activation, g(z) = predicted probability of class 1, range (0,1)
Permutation importance of feature j
Imp(j)=L(y,f^(x(πj)))−L(y,f^(x))\text{Imp}(j) = L(y, \hat{f}(x^{(\pi_j)})) - L(y, \hat{f}(x))
L = validation loss, πjπ_j = permutation of column j, larger gap = more important variable
Partial dependence of prediction on variable j
PDj(xj)=1n∑i=1nf^(xj,x−j(i))\text{PD}_j(x_j) = \frac{1}{n}\sum_{i=1}^{n} \hat{f}(x_j, x_{-j}^{(i)})
n = observations, x−jx_{-j}^{(i)} = other features at observed values, average marginal effect
Feedforward neural network forward pass
y^=gL(WLgL−1(⋯g1(W1x+b1)⋯ )+bL)\hat{y} = g_L(W_L g_{L-1}(\cdots g_1(W_1 x + b_1)\cdots) + b_L)
x = input, WkW_k = weight matrix, bkb_k = bias, gkg_k = activation at layer k, L = number of layers
Regression tree residual sum of squares
RSS(T)=∑m=1M∑i∈Rm(yi−y^Rm)2\text{RSS}(T) = \sum_{m=1}^{M}\sum_{i\in R_m}(y_i-\hat{y}_{R_m})^2
RmR_m = terminal region m, y^Rm\hat{y}_{R_m} = regional mean, M = number of leaves
Regression tree training risk
R(T)=∑leaves t∑i∈t(yi−yˉt)2R(T) = \sum_{\text{leaves } t}\sum_{i \in t}(y_i - \bar{y}_t)^2
yiy_i = response in leaf t, ȳ_t = mean response in leaf t
Cost-complexity pruning criterion
Cα(T)=Loss(T)+α∣T∣C_\alpha(T) = \text{Loss}(T) + \alpha|T|
Loss(T) = tree RSS or weighted impurity, ∣T∣|T| = number of terminal nodes, α\alpha = complexity parameter from CV
Gini index node impurity
Gm=∑k=1Kp^mk(1−p^mk)=1−∑kp^mk2G_m = \sum_{k=1}^{K}\hat{p}_{mk}(1-\hat{p}_{mk}) = 1 - \sum_{k}\hat{p}_{mk}^{2}
p^mk\hat{p}_{mk} = proportion of class k at node m, K = number of classes
One-standard-error rule threshold
CV(α)≤CVmin⁡+SE\text{CV}(\alpha) \le \text{CV}_{\min} + \text{SE}
CV(α) = K-fold CV error at penalty α, CVminCV_{min} = minimum CV error, SE = standard error across folds; pick largest qualifying α
Weakest-link strength at internal node
g(t)=R(t)−R(Tt)∣Tt∣−1g(t) = \frac{R(t) - R(T_t)}{|T_t| - 1}
R(t) = risk if t is a single leaf, R(T_t) = risk of subtree rooted at t, |TtT_t| = leaves in that subtree
Cross-entropy node impurity
Dm=−∑k=1Kp^mklog⁡p^mkD_m = -\sum_{k=1}^{K}\hat{p}_{mk}\log\hat{p}_{mk}
p^mk\hat{p}_{mk} = class k proportion at node m, K = classes, 0log⁡0=00\log 0 = 0 by convention
Cost-complexity criterion for a subtree
Rα(T)=R(T)+α∣T∣R_\alpha(T) = R(T) + \alpha|T|
R(T) = training risk (RSS or misclassification), α = complexity penalty per leaf, |T| = number of terminal nodes
Complete linkage inter-cluster distance
d(A,B)=max⁡a∈A, b∈Bd(a,b)d(A,B) = \max_{a\in A,\,b\in B} d(a,b)
A, B = clusters, d(a,b) = pairwise distance between points a in A and b in B
Average linkage inter-cluster distance
d(A,B)=1∣A∣∣B∣∑a∈A∑b∈Bd(a,b)d(A,B) = \frac{1}{|A||B|}\sum_{a\in A}\sum_{b\in B} d(a,b)
|A|, |B| = cluster sizes, d(a,b) = pairwise distance between a and b
K-means centroid update
xˉk=1∣Ck∣∑i∈Ckxi\bar{x}_k = \frac{1}{|C_k|}\sum_{i\in C_k} x_i
|CkC_k| = number of points in cluster k, xix_i = data point assigned to cluster k, xˉk\bar{x}_k = updated centroid
Time Series with Constant Variance 27 items
Stationarity (weak and strict)
Weak: mean and variance constant; γ(t,t+h)\gamma(t, t + h) depends only on lag h.
Strict: joint distribution invariant under time shifts. Strict implies weak (finite second moments).
Autocovariance and autocorrelation functions
γh=Cov(Xt,Xt+h)\gamma_h = \text{Cov}(X_t, X_{t + h})
ρh=γhγ0\rho_h = \dfrac{\gamma_h}{\gamma_0}
ρ^h=∑t=1n−h(Xt−Xˉ)(Xt+h−Xˉ)∑t=1n(Xt−Xˉ)2\hat\rho_h = \dfrac{\sum_{t=1}^{n-h}(X_t - \bar{X})(X_{t+h} - \bar{X})}{\sum_{t=1}^n (X_t - \bar{X})^2}
Partial autocorrelation function (PACF)
ϕhh\phi_{hh} = correlation between XtX_t and Xt−hX_{t-h} after removing the linear effects of Xt−1,…,Xt−h+1X_{t-1}, \ldots, X_{t-h+1}. AR(p): PACF cuts off after lag p. MA(q): PACF tails off.
White noise and random walk
White noise: εt\varepsilon_t iid mean 0 variance σ2\sigma^2.
Random walk: Xt=Xt−1+εtX_t = X_{t-1} + \varepsilon_t, variance grows linearly with t, E[Xt+h∣Ft]=XtE[X_{t+h} | \mathcal{F}_t] = X_t.
Autoregressive process AR(p)
Xt=c+ϕ1Xt−1+ϕ2Xt−2+⋯+ϕpXt−p+εtX_t = c + \phi_1 X_{t-1} + \phi_2 X_{t-2} + \cdots + \phi_p X_{t-p} + \varepsilon_t
Stationary if all roots of 1−ϕ1z−⋯−ϕpzp=01 - \phi_1 z - \cdots - \phi_p z^p = 0 lie OUTSIDE the unit circle.
Moving average process MA(q)
Xt=μ+εt+θ1εt−1+⋯+θqεt−qX_t = \mu + \varepsilon_t + \theta_1 \varepsilon_{t-1} + \cdots + \theta_q \varepsilon_{t-q}
Invertible if roots of 1+θ1z+⋯+θqzq=01 + \theta_1 z + \cdots + \theta_q z^q = 0 lie OUTSIDE the unit circle.
ARMA(p, q) and ARIMA(p, d, q)
ARMA: combines AR(p) and MA(q) for stationary series; ACF and PACF both tail off.
ARIMA: ARMA on the d-th difference ΔdXt\Delta^d X_t; d = 1 for random walks.
Yule-Walker equations (AR estimation)
ρh=ϕ1ρh−1+ϕ2ρh−2+⋯+ϕpρh−p\rho_h = \phi_1 \rho_{h-1} + \phi_2 \rho_{h-2} + \cdots + \phi_p \rho_{h-p} for h≥1h \geq 1
Solve ϕ^=R−1ρ\hat{\boldsymbol{\phi}} = \mathbf{R}^{-1} \boldsymbol{\rho} using sample autocorrelations.
Box-Jenkins methodology
1. Identification: ACF/PACF, difference if non-stationary, pick (p, d, q).
2. Estimation: MLE or least squares.
3. Diagnostics: residuals are white noise.
4. Forecasting with the fitted model.
Ljung-Box test for residual autocorrelation
Q=n(n+2)∑k=1mρ^k2n−kQ = n(n + 2) \sum_{k=1}^m \dfrac{\hat\rho_k^2}{n - k}
Under H0H_0 of white-noise residuals, Q∼χm−p−q2Q \sim \chi^2_{m - p - q} where p + q is the number of fitted ARMA parameters.
ARIMA forecast and forecast variance
X^n+1∣n\hat{X}_{n+1 | n} is the conditional expectation given history. AR(1) without drift: X^n+h∣n=ϕhXn\hat{X}_{n+h | n} = \phi^h X_n, Var(eh)=σ2(1+ϕ2+⋯+ϕ2(h−1))\text{Var}(e_h) = \sigma^2(1 + \phi^2 + \cdots + \phi^{2(h-1)}).
Seasonal ARIMA (SARIMA)
ARIMA(p,d,q)(P,D,Q)s\text{ARIMA}(p, d, q)(P, D, Q)_s
Adds seasonal AR, differencing, and MA terms at lag s (e.g., 12 for monthly).
AR(1) bounded h-step forecast variance
Var(Y^t+h∣t)=σε2(1−ϕ12h)/(1−ϕ12)\text{Var}(\hat{Y}_{t+h\mid t}) = \sigma_\varepsilon^2 (1 - \phi_1^{2h}) / (1 - \phi_1^2)
σε2\sigma_\varepsilon^2 = shock variance, ϕ1\phi_1 = AR coefficient, h = horizon
Long-run mean of stationary AR(p) process
μ=c/(1−ϕ1−⋯−ϕp)\mu = c / (1 - \phi_1 - \dots - \phi_p)
c = printed intercept, ϕi\phi_i = AR coefficients, μ\mu = unconditional mean (not the intercept)
t-ratio for ARIMA coefficient significance
ti=ϕ^i/SE(ϕ^i)t_i = \hat{\phi}_i / \text{SE}(\hat{\phi}_i)
ϕ^i\hat{\phi}_i = estimated coefficient, SE = standard error; significant when ∣ti∣>1.96|t_i|>1.96
AR(1) h-step ahead mean-corrected forecast
Y^t+h∣t=μ+ϕ1h(Yt−μ)\hat{Y}_{t+h\mid t} = \mu + \phi_1^{h}(Y_t - \mu)
μ\mu = long-run mean, ϕ1\phi_1 = AR(1) coefficient, YtY_t = last observation, h = horizon
Random walk with drift
Yt=δ+Yt−1+εtY_t = \delta + Y_{t-1} + \varepsilon_t
δ = constant drift per period, Yt−1Y_{t-1} = prior level, εtε_t = iid shock with mean 0 and variance σ²
Random walk h-step forecast variance
Var(Y^n+h)=hσ2\text{Var}(\hat{Y}_{n+h}) = h\sigma^2
h = forecast horizon, σ² = per-period shock variance; SE grows as σh\sigma\sqrt{h}
Deterministic linear trend regression
Yt=β0+β1t+εtY_t = \beta_0 + \beta_1 t + \varepsilon_t
YtY_t = series at time t, t = time index, β1β_1 = fixed per-period drift, εtε_t = iid noise with mean 0 and variance σ²
Seasonal regression with dummy variables
Yt=β0+β1t+∑j=1s−1γjDj,t+εtY_t = \beta_0 + \beta_1 t + \sum_{j=1}^{s-1}\gamma_j D_{j,t} + \varepsilon_t
s = period, Dj,tD_{j,t} = season-j indicator, γjγ_j = additive seasonal effect vs baseline
Invertibility condition for an MA(q) process
All roots of θ(z)=1+θ1z+⋯+θqzq=0\theta(z) = 1 + \theta_1 z + \dots + \theta_q z^q = 0 satisfy ∣z∣>1|z| > 1
θjθ_j = MA coefficients, q = MA order, z = complex root
Stationarity condition for an AR(p) process
All roots of ϕ(z)=1−ϕ1z−⋯−ϕpzp=0\phi(z) = 1 - \phi_1 z - \dots - \phi_p z^p = 0 satisfy ∣z∣>1|z| > 1
φiφ_i = AR coefficients, p = AR order, z = complex root
White-noise confidence bands for sample ACF
±1.96/n\pm 1.96/\sqrt{n}
n = sample size; sample autocorrelations inside the band are not significantly different from zero at the 5% level
Airline model for monthly time series
(1−B)(1−B12)Yt=(1+θ1B)(1+Θ1B12)εt(1-B)(1-B^{12})Y_t = (1+\theta_1 B)(1+\Theta_1 B^{12})\varepsilon_t
B = backshift, θ1θ_1 = regular MA, Θ1Θ_1 = seasonal MA, εtε_t = white noise
AR(1) long-run mean
μ=c1−ϕ1\mu = \dfrac{c}{1 - \phi_1}
c = intercept, φ₁ = AR(1) coefficient with |φ₁| < 1
MA(1) lag-1 autocorrelation
ρ1=θ11+θ12\rho_1 = \dfrac{\theta_1}{1 + \theta_1^2}
θ₁ = MA(1) coefficient with |θ₁| < 1 for invertibility; ρkρ_k = 0 for k ≥ 2
AR(1) unconditional variance
γ0=σ21−ϕ12\gamma_0 = \dfrac{\sigma^2}{1 - \phi_1^2}
σ² = innovation variance, φ₁ = AR(1) coefficient with |φ₁| < 1
Take the free MAS-II diagnostic quiz →
Instant readiness score in about 6 minutes. No signup to start.

Frequently Asked Questions

Is the MAS-II formula sheet free?
Yes. The full MAS-II formula sheet is free, with no signup, no email, and no credit card required. 146 formulas across 4 topics, all rendered with the same KaTeX math notation used in the FreeFellow study app.
Can I download the MAS-II formula sheet as a printable PDF?
Yes. A 1080x1350 portrait PDF (Instagram and LinkedIn carousel native size, also great for tablet study) is linked at the top of this page. The PDF is fully self-contained: math is pre-rendered, fonts are embedded, no internet connection needed once downloaded.
What's covered on the MAS-II formula sheet?
Every formula is grouped by official syllabus topic, with the formula in math notation plus a one-line note on when to use it (or a watch-out from CAIA, CFA, or other prep-provider commentary). Coverage is calibrated to the 2026 syllabus and refreshed when the corpus changes.
What is FreeFellow's relationship with CAS?
No. FreeFellow is not affiliated with the CAS or any examination body. This is an independent study aid covering the published syllabus.
What else is free at FreeFellow for MAS-II candidates?
The full original question bank is free with an account, subject to usage limits. Worked solutions, written lessons, mixed practice, and your readiness score stay free. The formula sheet is free too. Fellow is $39 per month or $79 per quarter, per exam family (USD). Fellow Plus is $49 per month, $99 per quarter, or $199 per year, per exam family (USD). Every annual plan is Fellow Plus. Fellow adds timed mock exams, spaced-repetition flashcards, performance analytics, and a personalized study plan.

About FreeFellow

Jeffrey Ting, founder of FreeFellow
Jeffrey Ting
FSA, CFA · Founder

FreeFellow was built by Jeffrey Ting, a credentialed actuary and CFA charterholder who has passed thirteen of the hardest exams in finance, all on his first attempt. He paid four-figure prep fees along the way.

So he started writing his own questions, then lessons, then mock exams, until it grew into a full prep platform covering 41 exams with more than 48,000 original practice questions.

01
Cost shouldn't decide who gets in.

A CFA charter, a CPA license, an actuarial credential. Each opens a real career, but prep fees add to the cost of getting there. FreeFellow keeps its original question bank and written lessons free so you can study even if a paid course is out of reach.

02
Free should mean free.

The original question bank, the worked solutions, the topic lessons, mixed practice, and your readiness score stay free, forever. Full access needs a free account, and practice usage limits apply. Fellow adds AI grading on supported exams, spaced-repetition flashcards, full-length mock exams, analytics, and a study plan that adapts to your progress.

Free forever

Put the formulas to work.

Every formula on this sheet shows up in the free MAS-II question bank, and every question carries a step-by-step solution.

Practice MAS-II questions free →

No credit card. No trial clock.