Expected Error Reduction in Active Learning

• Expected Error Reduction (EER) is a query-selection objective that chooses unlabeled samples expected to minimize future loss on a designated evaluation set.
• Modern approaches employ Bayesian reformulations, using techniques like Monte Carlo dropout to bypass expensive model retraining for each candidate label.
• EER distinguishes itself from typical uncertainty sampling by directly reducing expected downstream error, addressing both evaluation distribution shifts and cross-field ambiguities.

Searching arXiv for the cited papers and related usage of “Expected Error Reduction (EER)” to ground the article. Expected Error Reduction (EER) is an active learning criterion in which the next query is selected to maximally reduce the model’s expected future error on an unlabeled or validation set. In the formulation revisited for deep learning, the central principle is to choose the candidate whose label, once acquired, is expected to make the model best on the future evaluation distribution (Mussmann et al., 2022). The acronym is, however, overloaded across adjacent literatures: in biometrics it commonly denotes equal error rate, and in factorial experiments it denotes experimentwise error rate (Friedman et al., 2019, Brümmer et al., 2021, Kinnunen et al., 2023, Li et al., 18 Jul 2025). That ambiguity matters because the active-learning notion of EER is a query-selection objective, whereas the biometric and statistical notions are evaluation or error-control metrics.

1. Core active-learning definition

In active learning, the classic Expected Error Reduction idea from Roy and McCallum is: pick the unlabeled candidate whose label, if acquired, would maximally reduce the expected future error on a validation or unlabeled set (Mussmann et al., 2022). In the paper’s notation, the candidate sample is $x_i$ with random label $Y_i$, and for a validation point $x_j$ with label $Y_j$, the general EER score is

$$\text{Score}_i = \sum_{j=1}^{n_\text{val}} \min_{a \in \mathcal{A}} \mathbb{E}_{y_j \sim Y_j \mid \mathcal{D}} \big[\ell(y_j,a)\big] - \mathbb{E}_{y_i \sim Y_i \mid \mathcal{D}} \left[ \sum_{j=1}^{n_\text{val}} \min_{a \in \mathcal{A}} \mathbb{E}_{y_j \sim Y_j \mid \mathcal{D}, Y_i=y_i} \big[\ell(y_j,a)\big] \right].$$

The first term is the current expected loss on the validation set, and the second term is the expected loss after revealing the candidate’s label, updating the model, and then predicting optimally (Mussmann et al., 2022). Since the first term is the same for all candidates, ranking candidates reduces to minimizing the expected post-query loss. In that sense, EER is a directly task-oriented acquisition rule rather than a generic uncertainty heuristic.

This formulation differs from criteria that score a point only by how uncertain the model is about that point itself. EER asks a counterfactual question about downstream performance: what reduction in future error is expected if this label is obtained now? This suggests that EER is intrinsically tied to a specified evaluation distribution, represented in the paper by the validation set (Mussmann et al., 2022).

2. Classical formulation and computational bottleneck

The original attraction of EER is that it targets the quantity of practical interest: expected future error. Its classical drawback is computational cost. In the original algorithm, one must, for each candidate $x_i$, pretend that it has each possible label $y_i$, retrain the model for each hypothetical label, and recompute the expected loss (Mussmann et al., 2022). The paper states that this is feasible for very cheap models like Naive Bayes, but not for deep networks.

After dropping candidate-independent constants, the reduced selection score used in the Bayesian treatment is

$$\text{Score}_i = - \mathbb{E}_{y_i \sim Y_i \mid \mathcal{D}} \left[ \sum_{j=1}^{n_\text{val}} \min_{a \in \mathcal{A}} \mathbb{E}_{y_j \sim Y_j \mid \mathcal{D}, Y_i=y_i} [\ell(y_j,a)] \right].$$

The computational bottleneck is therefore not conceptual but procedural: classical EER embeds repeated model updates inside the acquisition function itself (Mussmann et al., 2022). This is the main reason it was “not been widely used for modern deep neural networks due to this large computational cost,” even though it had long been regarded as effective (Mussmann et al., 2022).

3. Bayesian reformulation for modern deep models

A recent reformulation places EER under the lens of Bayesian active learning and derives a computationally efficient version that can use any Bayesian parameter sampling method (Mussmann et al., 2022). The key move is to replace explicit retraining with posterior predictive calculations. The derivation assumes a Bayesian posterior over parameters $\theta$, conditional independence of labels given $\theta$, and fixed unlabeled candidate and validation sets whose labels are treated as random variables (Mussmann et al., 2022).

With posterior samples $Y_i$0, the required predictive quantities are approximated as

$Y_i$1

and

$Y_i$2

The paper emphasizes that these marginals are sufficient for the Bayesian score, so no separate retraining is needed for each hypothetical label (Mussmann et al., 2022). In practice, Monte Carlo dropout is used as the default approximate posterior sampler: dropout remains active at selection time, the model is run $Y_i$3 times, and the resulting stochastic forward passes are treated as samples from $Y_i$4 (Mussmann et al., 2022). Cyclical SG-MCMC is also mentioned, but no clear empirical advantage over dropout is reported (Mussmann et al., 2022).

The resulting complexity is given as roughly

$Y_i$5

for MELL/MEZL, where $Y_i$6 is the number of active learning rounds, $Y_i$7 the number of posterior samples, and $Y_i$8 the number of classes (Mussmann et al., 2022). The paper notes that $Y_i$9 and $x_j$0 can be subsampled further.

4. Relation to uncertainty sampling and mutual information

The Bayesian reinterpretation also clarifies how EER differs from standard uncertainty-based acquisition. BALD chooses points that maximize mutual information between the candidate label and the model parameters,

$x_j$1

which the paper describes as an epistemic-uncertainty criterion (Mussmann et al., 2022). By contrast, the log-likelihood version of EER, MELL, is related to the mutual information between candidate labels and validation labels,

$x_j$2

up to a constant (Mussmann et al., 2022).

The information-theoretic decomposition reported in the paper is

$x_j$3

followed by

$x_j$4

The interpretation given is that $x_j$5 measures task-relevant information shared with the validation point, whereas $x_j$6 captures information about parameters that is not relevant for predicting $x_j$7 (Mussmann et al., 2022). This is the basis for the claim that MELL can outperform BALD by focusing on information useful for the validation distribution rather than on parameter uncertainty in general.

A second distinction concerns loss choice. The paper reports that MEZL, the zero-one-loss variant, often underperforms MELL because a validation point contributes only if the candidate changes its MAP class prediction. If a query reduces uncertainty without flipping that prediction, MEZL gives it no credit (Mussmann et al., 2022). MELL is therefore presented as empirically more reliable.

5. Empirical behavior, especially under dataset shift

The Bayesian EER framework is evaluated on seven image-classification datasets: CIFAR10, CIFAR100, SVHN, MNIST, Camelyon17, iWildCam, and FMoW, each in both no-shift and data-shift regimes, giving 14 experimental settings total (Mussmann et al., 2022). For standard image datasets, shift is induced by splitting based on pixel brightness; for WILDS datasets, the shift is naturally present via predefined metadata splits (Mussmann et al., 2022).

The headline empirical result is that MELL is best or tied for best in 12 of 14 experiments, never does worse than BALD or Coreset in the reported AUC comparisons, and shows its biggest gains over BALD under data shift (Mussmann et al., 2022). BADGE beats MELL on two shifted datasets, Camelyon17 and MNIST, but the paper notes that BADGE is an order of magnitude more expensive and that some runs did not complete after 14 days (Mussmann et al., 2022). BADGE also requires access to last-layer embeddings, whereas MELL/MEZL are described as model-agnostic because they require only posterior predictive samples (Mussmann et al., 2022).

These findings support the paper’s practical claim that EER becomes especially attractive when the evaluation distribution differs from the seed distribution. Because the objective explicitly minimizes expected loss on a validation set, it is more aligned with target performance under shift than methods that measure epistemic uncertainty alone (Mussmann et al., 2022). This suggests that the usefulness of EER is tied not only to query informativeness but also to how well the validation set represents the intended deployment distribution.

6. Terminological ambiguity across fields

The acronym “EER” does not have a uniform meaning across arXiv literatures.

Usage of EER	Meaning	Example papers
Active learning	Expected Error Reduction	(Mussmann et al., 2022)
Biometrics, speaker verification, deepfake detection	Equal Error Rate	(Friedman et al., 2019, Brümmer et al., 2021, Zhou et al., 19 Jun 2026, Kinnunen et al., 2023, Gonzalez et al., 23 Jun 2026)
Factorial experiments	Experimentwise Error Rate	(Li et al., 18 Jul 2025)

In biometrics, EER is the equal error rate: the operating point at which false acceptance rate equals false rejection rate (Friedman et al., 2019). In speaker verification, the paper “Out of a hundred trials, how many errors does your speaker verifier make?” states explicitly that it is about Equal-Error Rate, not “Expected Error Reduction,” and treats EER as the point where $x_j$8 (Brümmer et al., 2021). In speech deepfake detection, EER is described as an oracle threshold metric computed on labeled test data, and the paper argues that it can hide deployment failure under domain shift (Zhou et al., 19 Jun 2026). In tandem biometric evaluation, t-EER extends equal error rate to a joint PAD-plus-comparator setting (Kinnunen et al., 2023). In deep biometric training, EERLoss is an approximation to equal error rate used as a loss function (Gonzalez et al., 23 Jun 2026).

In replicated regular two-level factorial experiments, by contrast, EER means experimentwise error rate: the probability of making at least one false rejection among a family of hypotheses (Li et al., 18 Jul 2025).

Because these meanings are all current in arXiv-indexed research, the abbreviation alone is potentially misleading. For active learning, the fuller term “Expected Error Reduction” avoids confusion.

7. Scope and practical interpretation

Within active learning, EER is best understood as a decision-theoretic acquisition principle: choose the label whose acquisition is expected to minimize future loss on a designated evaluation distribution (Mussmann et al., 2022). Its historical weakness was retraining cost; its recent revival comes from a Bayesian posterior-sampling reformulation that avoids retraining for each candidate-label hypothesis (Mussmann et al., 2022).

The modern formulation also sharpens the conceptual distinction between EER and generic uncertainty sampling. BALD seeks information about parameters, whereas MELL seeks information relevant to validation labels (Mussmann et al., 2022). This suggests that EER is most appropriate when the active-learning objective is not merely to reduce model uncertainty, but to reduce expected downstream error on a specific target distribution.

At the same time, the acronym’s cross-disciplinary ambiguity is substantial. In nearby fields, “EER” more often refers to equal error rate or experimentwise error rate than to Expected Error Reduction (Friedman et al., 2019, Brümmer et al., 2021, Li et al., 18 Jul 2025). For that reason, technical writing typically benefits from spelling out the term on first use.