Tutorials › Statistical Learning (Graduate) › Brier-Score Aggregation Of Probability Predictors

Finite-Class Aggregation · Tutorial 309 of 989

Brier-Score Aggregation Of Probability Predictors

Learn the Brier-score risk geometry for probability forecasts and when averaging gives a genuine reduction in predictive risk.

Intermediate 9 min read

What You'll Learn

  • Define binary and multiclass Brier scores for valid probability forecasts.
  • Decompose Brier risk into irreducible uncertainty and squared distance from the true conditional probabilities.
  • Derive the exact diversity identity for fixed weighted forecast averages.
  • Identify when averaging strictly improves on the weighted average risk.
  • Distinguish that guarantee from a claim that averaging beats the best candidate.

Why the Brier Score Has Useful Risk Geometry

A probability forecast is judged not only by whether its most likely outcome is correct, but also by whether its probabilities are appropriate. The Brier score measures the squared distance between a forecast probability vector and the indicator vector of the outcome that occurs. Its squared-error form gives probability forecasts a particularly transparent risk geometry: expected score is minimized by the true conditional probabilities, and averaging forecasts has an exact diversity decomposition.

This tutorial uses the sum-of-squares convention for the multiclass Brier score, with no division by the number of classes. Multiplying every score by the same positive constant would change numerical values but not which forecast has lower risk.

Definition: Suppose \(Y\) takes values in \(\{1,\ldots,K\}\). Write \(e_Y\) for the \(K\)-dimensional vector whose \(Y\)th component is one and whose other components are zero. A probability forecast is a vector \(p=(p_1,\ldots,p_K)\) in the simplex \(\Delta_K=\{u\in[0,1]^K:\sum_{k=1}^K u_k=1\}\). Its multiclass Brier loss is \(S(p,Y)=\|p-e_Y\|_2^2=\sum_{k=1}^K(p_k-\mathbf{1}\{Y=k\})^2\). For a binary outcome \(Y\in\{0,1\}\), forecasting probability \(p=P(Y=1)\) gives the equivalent scalar loss \(S(p,Y)=(p-Y)^2\).

A predictor uses available information \(X\) to produce its forecast. For multiclass outcomes, write \(p(X)\in\Delta_K\). Its Brier risk is \(R(p)=E[S(p(X),Y)]\), provided the expectation exists. It always exists here because the forecast and outcome vectors are bounded. Define the conditional class-probability vector by \(\eta(X)=E[e_Y\mid X]\); its \(k\)th component is \(P(Y=k\mid X)\).

A candidate dictionary consists of a finite collection of measurable probability predictors \(p_1,\ldots,p_M\). Given fixed weights \(\alpha_1,\ldots,\alpha_M\) satisfying \(\alpha_j\geq0\) and \(\sum_{j=1}^M\alpha_j=1\), their aggregate is \(\bar p(X)=\sum_{j=1}^M\alpha_jp_j(X)\). Because the simplex is convex, \(\bar p(X)\) is itself a valid probability forecast.

Conditional Risk and the True Probability Vector

The first identity explains what Brier risk measures. Conditional on the predictors \(X\), the expected score is the squared distance from the forecast to the true conditional probabilities, plus a term determined by the outcome distribution that no forecast can remove.

Theorem: For any measurable probability predictor \(p(X)\), the multiclass Brier risk satisfies
$$ E[S(p(X),Y)\mid X] = \|p(X)-\eta(X)\|_2^2+1-\|\eta(X)\|_2^2. $$

Consequently, \(R(p)\) is minimized by \(p(X)=\eta(X)\) almost surely, and for any two probability predictors \(p\) and \(q\),

$$ R(p)-R(q) = E\!\left[\|p(X)-\eta(X)\|_2^2-\|q(X)-\eta(X)\|_2^2\right]. $$

To prove the conditional identity, expand the squared distance after writing \(p-e_Y=(p-\eta)+(\eta-e_Y)\). The cross term has conditional expectation zero because \(E[e_Y-\eta\mid X]=0\). Also, since \(e_Y\) has one component equal to one and the rest zero, \(\|e_Y\|_2^2=1\). Therefore

$$ \begin{aligned} E[\|p-e_Y\|_2^2\mid X] &=\|p-\eta\|_2^2+E[\|\eta-e_Y\|_2^2\mid X]\\ &=\|p-\eta\|_2^2+\|\eta\|_2^2-2\eta^\mathsf{T}E[e_Y\mid X]+E[\|e_Y\|_2^2\mid X]\\ &=\|p-\eta\|_2^2+\|\eta\|_2^2-2\|\eta\|_2^2+1\\ &=\|p-\eta\|_2^2+1-\|\eta\|_2^2. \end{aligned} $$

Taking expectations gives the risk decomposition. The second term does not depend on \(p\), so the conditional probabilities minimize risk. Subtracting the decomposition for \(q\) from the one for \(p\) gives the stated risk difference. \(\square\)

For binary outcomes, let \(\eta(X)=P(Y=1\mid X)\). The same result becomes \(E[(p(X)-Y)^2\mid X]=(p(X)-\eta(X))^2+\eta(X)(1-\eta(X))\). The final term is conditional outcome uncertainty; the first is the squared probability error. Thus a lower Brier risk corresponds exactly to a lower expected squared distance from the true conditional probability, after averaging over \(X\).

Worked Example: Binary Forecasts at One Covariate Value

Suppose \(X\) is fixed and \(P(Y=1\mid X)=0.5\). Two candidates forecast \(p_1=0.2\) and \(p_2=0.8\). Compute their risks and the risk of their equally weighted average.

For a binary forecast \(p\), the conditional risk is \((p-0.5)^2+0.5(1-0.5)=(p-0.5)^2+0.25\). Hence \(R(p_1)=(-0.3)^2+0.25=0.09+0.25=0.34\). By symmetry, \(R(p_2)=(0.3)^2+0.25=0.34\).

The equally weighted forecast is \(\bar p=(0.2+0.8)/2=0.5\), so \(R(\bar p)=(0.5-0.5)^2+0.25=0.25\). The aggregate removes the candidates’ squared probability error entirely; its risk is the irreducible uncertainty \(0.25\).

The Exact Gain from Averaging

For squared probability loss, the benefit of averaging can be quantified exactly. At each value of \(X\), the aggregate’s score is the weighted average of the candidates’ scores minus their weighted dispersion around the aggregate. This identity holds for every realized outcome, not just after taking expectations.

Theorem: For any outcome vector \(e_Y\), probability forecasts \(p_1,\ldots,p_M\), and fixed simplex weights \(\alpha_1,\ldots,\alpha_M\),
$$ \sum_{j=1}^M\alpha_j\|p_j-e_Y\|_2^2 = \|\bar p-e_Y\|_2^2+ \sum_{j=1}^M\alpha_j\|p_j-\bar p\|_2^2, \qquad \bar p=\sum_{j=1}^M\alpha_jp_j. $$

Taking expectations yields the Brier-risk identity

$$ \sum_{j=1}^M\alpha_jR(p_j) = R(\bar p)+ E\!\left[\sum_{j=1}^M\alpha_j\|p_j(X)-\bar p(X)\|_2^2\right]. $$

For the proof, write \(p_j-e_Y=(p_j-\bar p)+(\bar p-e_Y)\), square, and sum using the weights. The cross term vanishes because

$$ \sum_{j=1}^M\alpha_j(p_j-\bar p) = \sum_{j=1}^M\alpha_jp_j-\bar p\sum_{j=1}^M\alpha_j = \bar p-\bar p = 0. $$

The remaining terms are \(\sum_j\alpha_j\|p_j-\bar p\|_2^2\) and \(\|\bar p-e_Y\|_2^2\sum_j\alpha_j=\|\bar p-e_Y\|_2^2\), proving the samplewise identity. Taking expectations proves the risk identity. \(\square\)

The final expectation is the weighted diversity of the candidates. It is nonnegative, so the aggregate risk cannot exceed the weighted average candidate risk. It is strictly smaller exactly when candidates with positive weight disagree on a set of \(X\)-values having positive probability. If all positive-weight forecasts agree almost surely, the diversity term is zero and averaging gives no risk reduction.

Worked Example: Averaging Helps Without Beating the Best Candidate

Again let \(P(Y=1\mid X)=0.2\), but now take forecasts \(p_1=0.1\) and \(p_2=0.9\), with equal weights. Calculate both individual risks, the aggregate risk, and the diversity term.

The irreducible binary risk is \(0.2(1-0.2)=0.16\). Candidate 1 has squared probability error \((0.1-0.2)^2=0.01\), so \(R(p_1)=0.17\). Candidate 2 has squared error \((0.9-0.2)^2=0.49\), so \(R(p_2)=0.65\). The weighted average risk is \((0.17+0.65)/2=0.41\).

The aggregate forecast is \(\bar p=(0.1+0.9)/2=0.5\), and its risk is \((0.5-0.2)^2+0.16=0.09+0.16=0.25\). The diversity term is \(\{(0.1-0.5)^2+(0.9-0.5)^2\}/2=(0.16+0.16)/2=0.16\). Indeed, \(0.41-0.16=0.25\), as the identity requires.

Averaging improves on the weighted average risk \(0.41\), but it does not beat the best candidate, whose risk is \(0.17\). The example shows why the theorem is a guarantee against the weighted benchmark, not a guarantee against every member of the dictionary.

Worked Example: Multiclass Averaging Reaches the Conditional Truth

At a fixed covariate value, suppose three classes have true probabilities \(\eta=(0.5,0.3,0.2)\). Consider forecasts \(p_1=(0.7,0.2,0.1)\) and \(p_2=(0.3,0.4,0.3)\), with equal weights. Verify their Brier risks and the risk of their aggregate.

First, \(1-\|\eta\|_2^2=1-(0.5^2+0.3^2+0.2^2)=1-(0.25+0.09+0.04)=0.62\). For \(p_1\), the squared distance to \(\eta\) is \(0.2^2+(-0.1)^2+(-0.1)^2=0.06\), so its risk is \(0.62+0.06=0.68\). For \(p_2\), the squared distance is \((-0.2)^2+0.1^2+0.1^2=0.06\), giving risk \(0.68\) as well.

Their average is \(\bar p=(0.5,0.3,0.2)=\eta\), so its squared distance from \(\eta\) is zero and its risk is \(0.62\). The weighted diversity is \(\{0.06+0.06\}/2=0.06\); accordingly, the average risk \(0.68\) minus diversity \(0.06\) equals the aggregate risk \(0.62\).

Conditions, Interpretation, and a Common Pitfall

The identities require valid probability forecasts and weights that are nonnegative and sum to one. The risk conclusions concern predictions evaluated on the same population distribution. In practice, weights may be chosen using a training sample; the fixed-weight result applies to an independent test pair after conditioning on that training sample, provided the test pair follows the target distribution. If weights are instead chosen using the outcome being scored, the fixed-weight population-risk interpretation does not automatically apply.

The central pitfall is to replace “no worse than the weighted average risk” with “no worse than the best candidate risk.” The diversity identity gives

$$ R(\bar p)=\sum_{j=1}^M\alpha_jR(p_j)-D, \qquad D=E\!\left[\sum_{j=1}^M\alpha_j\|p_j(X)-\bar p(X)\|_2^2\right]\geq0. $$

It does not say that \(R(\bar p)\leq\min_jR(p_j)\). The correction is to identify the benchmark before interpreting the inequality: averaging improves on the weighted mean risk by exactly \(D\), while beating a particular candidate requires the additional condition \(\sum_j\alpha_jR(p_j)-D\leq R(p_k)\). Probability forecasts can also be diverse while the average remains farther from the truth than the best forecast, as the binary example demonstrated.

This geometry is useful when probability forecasts are combined: it separates candidate accuracy from candidate disagreement, and shows how disagreement contributes to the exact reduction relative to the weighted risk benchmark. The same calculation works for each observed case in a data set, so it applies to empirical Brier scores as well as population risks.

Key takeaway: Under the Brier score, risk equals irreducible conditional uncertainty plus expected squared distance from the true probability vector. A weighted average reduces weighted candidate risk by exactly the candidates’ weighted diversity, but this does not ensure it beats the best individual candidate.

Check Your Understanding

Use the identities and benchmark distinctions developed above.

  1. For a binary outcome with conditional event probability \(0.3\), what is the Brier risk of forecasting \(0.6\) at that covariate value?
  2. Why does the aggregate of simplex-valued forecasts with nonnegative weights summing to one remain a valid probability forecast?
  3. State the diversity condition under which averaging gives strictly lower risk than the weighted average candidate risk.
  4. Can the aggregate have greater risk than the best candidate while still improving on weighted average risk? Explain using the risk identity.
  5. For a multiclass outcome, what does the term \(1-\|\eta(X)\|_2^2\) represent in the conditional risk decomposition?
Clinical Biostats