MENU

Uncertainty and Applicability Domain Explained

← Back to Materials Informatics guides

TECHNOLOGY EXPLAINER

Uncertainty and Applicability Domain
— Looking beyond the predicted value: how far can it be trusted, and is it even in range?

A machine-learning prediction returns a single value. But what a materials engineer wants to know is whether to trust that value in deciding the next experiment. For that, a prediction needs two companions. One is uncertainty (how much the prediction may vary). The other is the applicability domain (whether the material lies inside or outside the range the model learned from). Using figures and small calculations of our own, this article explains the kinds of uncertainty and how to estimate it (ensembles, Gaussian processes and others), the idea of an applicability domain, and the danger of extrapolation.

Built from: peer-reviewed papers (Nature Communications, npj Computational Materials, Machine Learning and others), arXiv papers, and the official pages of scikit-learn, NIST, ISO and BIPM / numerical examples are our own calculations / checked 22 October 2026

Measurement variability and uncertainty about unfamiliar materials are different. Ask what is uncertain, not only how wide a band is.
Fig. 1. Conceptual illustration generated with ImageGen. Measurement variability and uncertainty about unfamiliar materials are different. Ask what is uncertain, not only how wide a band is.Not an actual product, facility or measurement. Enlarged models, lines, arrows and colours are explanatory.
In this article
  1. Three-line summary, prerequisites, and where this fits in the series
  2. Two kinds of uncertainty: what can be reduced and what cannot
  3. How to estimate uncertainty: ensembles, Gaussian processes and conformal prediction
  4. Do uncertainty intervals hold inside and outside the range?
  5. Measuring the “quality” of uncertainty: calibration and sharpness
  6. Applicability domain: deciding where a prediction may be made
  7. Distance from the training data, and error
  8. How to use it: deciding the next experiment
  9. Limits, what we could not confirm, and a summary
  10. How to read the yardsticks and standards
  11. Glossary
  12. References (primary sources)
  13. Claim-to-source audit
How this article marks its statements

Sourced = stated in a published source (reference link given)
Our calculation = a value this article computed from stated assumptions
Not yet confirmed = drafts, revisions in progress and other matters not yet settled
Our reading of what this means for materials research is labeled commentary. An Inference is shown in bold.

How to read the numbers in this article

The numbers in Chapters 4, 6 and 7 are calculations on synthetic data that we generated (fixed random seed). They do not show real materials data or the superiority of any method; they are examples to show mechanisms and pitfalls in numbers. The conclusion is not “Gaussian processes are good and ensembles are bad” (even the same method gives different results with different settings and data). Numbers from papers are results under each paper's conditions. For the OECD principles we rely on the introduction in a paper by Sahigara et al.; the OECD original could not be opened because of an automated-access restriction. For ISO/IEC and ISO standards we only checked the number, title and publication date, and have not read the full text.

1. Three-line summary, prerequisites, and where this fits in the series

  • A prediction should carry a “level of confidence.” Uncertainty comes in a kind that cannot be reduced, such as measurement scatter, and a kind that is lack of knowledge in ranges without data, which shrinks when you measure. What matters for deciding experiments is mainly the latter
  • Uncertainty estimates can also be wrong. Even from the same 15 data points, some methods show an uncertainty band that widens where there are no data, and others stay narrow. In our example, the share of values that actually fell inside a “95% interval” outside the training range ranged from 24% (an ensemble of 3-nearest-neighbor models) to 92% (an ensemble of cubic polynomials)
  • Check the applicability domain first. A prediction for a material far from the training data is an extrapolation. In our example, the error in the region far from the training points was more than 100 times that near them (0.015 → 1.92), and worse than a “return the mean” prediction
What you should know before reading

Machine learning is “an approximator that learns trends from past data,” and it is weak outside the range of the data (extrapolation). The standard deviation is a number for the size of the scatter in values, and is often used for the width of a prediction “band.” An interval is a prediction with a width: “the value should fall in this range.” A “95% interval,” for example, means “with 95% probability, inside this” (whether it holds as promised is checked in Chapters 4 and 5). Overfitting and cross-validation are covered in our explainers on the basics of machine learning and neural networks and on machine learning with small data.

Where this fits in the series

This is the fifth article in our series and the last of the five foundation articles on MI. The earlier ones covered data quality, public databases and learning from little data. This one covers how far a prediction can be trusted. The idea is the base for the following explainers on Bayesian optimization and active learning (the model chooses the next candidate), self-driving laboratories, and how to read evaluation and reproducibility in MI.

2. Two kinds of uncertainty: what can be reduced and what cannot

An analogy: if the search for materials is “looking for treasure on a very large map,” a prediction is a guess that “the treasure is probably here.” Without a note of “how sure,” you cannot decide whether to dig. That “how sure” is uncertainty. We think of uncertainty as two kinds.

1 variability in repeat measurements, 2 limited knowledge of unfamiliar conditions. Both sources may coexist.
Fig. 2. Conceptual illustration generated with ImageGen. 1 variability in repeat measurements, 2 limited knowledge of unfamiliar conditions. Both sources may coexist.Not an actual product, facility or measurement. Enlarged models, lines, arrows and colours are explanatory.
View original SVG, values and sources
Two kinds of uncertainty (concept) 1. Random error (measurement scatter etc.) 2. Lack of knowledge (range without data) Even under the same conditions, results scatter Range with data Several curves fit outside the data It shrinks as data are added Cannot be removed. Experiments differ by 0.082 eV/atom (OQMD paper) Shrinks when measured (most prediction uncertainty)

Original SVG reference: Conceptual diagram (vector drawing). Two kinds of uncertainty. Left: random error that stays however much data you add. Right: lack of knowledge where there are no data, so the model could give many answers; it shrinks as you measure. They are called aleatoric and epistemic uncertainty.

  • Random error (aleatoric: noise inherent in the observation). The part that scatters every time even when you measure under the same conditions. It does not go away however much data you add. For example, the OQMD paper reports that the mean absolute error between experiments measuring the formation energy of the same compound is 0.082 eV/atom, “surprisingly large”Sourced [Ref. 3]. When comparing with experimental values, this gives a sense of why a model error far below this scatter should not be expected (commentary)
  • Lack of knowledge (epistemic: uncertainty in the model). The part where the model could give many answers in ranges without data. It shrinks when you add data. Kendall and Gal distinguish the former as “noise inherent in the observations” and the latter as “uncertainty in the model, which can be explained away given enough data”Sourced [Ref. 1]. An introduction to these concepts from a machine-learning viewpoint is the article by Hüllermeier and Waegeman [Ref. 2]

For a materials engineer, what matters for deciding experiments is mainly the latter (lack of knowledge). “Where the prediction is uncertain” is where measuring adds the most information (Chapter 8).

Where people get stuck: “measurement uncertainty” and “prediction uncertainty” are different concepts

In metrology, measurement uncertainty is organized internationally. JCGM 100:2008 (the GUM) defines uncertainty of measurement as a parameter, associated with the result of a measurement, that characterizes the dispersion of the values that could reasonably be attributed to the measurandSourced [Ref. 4]. That concept concerns measured values from experiments. The “prediction uncertainty” of this article, on the other hand, concerns the values predicted by a model. The two are related (measurement scatter sets a floor for prediction error) but are not the same thing (commentary). The handling of measurement scatter is also organized in ISO 5725-1:2023 (accuracy [trueness and precision] of measurement methods and results, Part 1: general principles and definitions) [Ref. 5]Sourced (full text not read).

The review by Ramprasad and colleagues says that MI predictions are typically interpolative but may also be extrapolative, and that then prediction uncertainties must be properly taken into accountSourced [Ref. 6].

3. How to estimate uncertainty: ensembles, Gaussian processes and conformal prediction

A typical machine-learning model returns one predicted value and no uncertainty. Here are three representative ways to obtain uncertainty. Each has a different idea and different strengths and weaknesses.

MethodThe idea (plain explanation)What we could confirm in primary sourcesCaution (commentary)
EnsembleBuild several models that differ slightly and treat the scatter of their predictions as uncertainty. Like asking several experts: if their opinions split, they are not confidentLakshminarayanan et al. propose deep ensembles as a method that is simple to implement, parallelizable and yields high-quality predictive uncertainty estimates [Ref. 7]. Wager et al. show how to estimate standard errors for bagged learners (averages of models built from bootstrap resamples) and random forests [Ref. 8]SourcedIf the members are similar models, they can all give the same answer even where there are no data, and the scatter looks small (the example of Chapter 4). The way the members are made changes the result
Gaussian processA method that returns a probabilistic prediction (a mean and a width) along with the value. The farther from the data, the wider the widthThe scikit-learn user guide explains that a Gaussian-process prediction is probabilistic, so empirical confidence intervals can be computed and used to decide whether to refit the prediction in some region; a disadvantage is that it loses efficiency in high dimensional spaces, when the number of features exceeds a few dozens [Ref. 9]Sourced. A standard textbook is Rasmussen and Williams [Ref. 10]Suits materials problems with little data. But how the band widens depends on the choice of kernel (the definition of similarity) and other settings
Conformal predictionA framework that uses how far past predictions missed to build intervals (or sets) with a guarantee: “the true value falls inside with this probability”The introduction by Angelopoulos and Bates explains that it can be used with any pretrained model and, without distributional assumptions, produces intervals or sets that contain the true value with a user-specified probability (for example, 90%). It also covers extensions such as distribution shift [Ref. 11]SourcedThe conditions under which the guarantee holds (for example, that new data come from a distribution like the training data) have to be checked in the original paper, and we did not confirm them here. The guarantee does not necessarily hold in extrapolation outside the learned range

The “idea” and “caution” columns are our own commentary. We do not cover other methods, such as Bayesian approaches or methods using dropout.

In materials, there are reports of using uncertainty in experimental planning. Ling and colleagues, in optimizing composition and processing, give a model learned from data an uncertainty estimate and combine exploring high-uncertainty candidates with exploiting high-performing regions to propose the next experiment. Over four materials-science test cases, they report that the optimal candidate was found with on average three times fewer measurements than random guessingSourced [Ref. 12]. Our explainer on Bayesian optimization and active learning covers this in more detail.

4. Do uncertainty intervals hold inside and outside the range?

We check with a small experiment whether an uncertainty estimate is really useful (Our calculation). Let the true relation be y = sin(2x) + 0.3x, and train on 15 points (noise 0.1) measured in the range x = 0 to 5. From the same data we build prediction bands (prediction ± 2 standard deviations) with a Gaussian process and with an ensemble of 3-nearest-neighbor models (50 models built by bootstrap).

Two uncertainty estimates from the same data (our calculation) -2 0 2 4 0 3 6 9 x (training data in 0-5) Gaussian process: band widens outside -2 0 2 4 0 3 6 9 x (training data in 0-5) Bagged 3-nearest: band stays narrow outside ● training data (15) gray dotted: truth line: prediction band: ± 2 SD blue: training range Trained on 15 points of y = sin(2x) + 0.3x plus noise 0.1. The ensemble has 50 members (bootstrap). Gaussian process: RBF kernel (length 1, variance 1), noise 0.1, fixed. Outside, it returns to the prior variance (1).
Fig. 3 Chart including our calculation (vector drawing). From the same 15 points, a Gaussian process and an ensemble of 3-nearest-neighbor models give predictions and uncertainty bands. The Gaussian-process band widens where there are no data; the ensemble goes flat at the edge value with a narrow band, so it cannot tell when it is wrong.

The left of Fig. 3 is the Gaussian process. In the range with data (blue background) the band is thin and the prediction overlaps the true relation (gray dotted line) well. Outside the range, the band widens greatly, honestly showing “we do not know here.” The right is the ensemble of 3-nearest-neighbor models. Even outside the range, the band stays narrow and the prediction stays flat at the edge value. The true relation (gray dotted line) moves a lot, yet the model says it is “sure.”

We look at the difference in numbers. As promised, we counted how many actual values fell inside the “95% interval,” inside and outside the range.

How often did a "95% interval" actually contain the value? (our calculation) 0.0 0.2 0.4 0.6 0.8 1.0 Share of values inside the interval 95% 81% Gaussian process 91% 92% Cubic-polynomial ensemble 86% 24% 3-nearest ensemble Target 95% Blue = inside the training range, red = outside Inside: x = 0-5; outside: x = −2 to 0 and 5 to 9. Interval = prediction ± 1.96 × (uncertainty + noise). Mean of 200 runs.
Fig. 4 Chart including our calculation (vector drawing). Even as a nominal 95% interval, the share that is right outside the range differs greatly by method: 24% for the 3-nearest ensemble, 81% for the Gaussian process and 92% for the cubic-polynomial ensemble (because its intervals are wide).
  • Gaussian process: 95% inside the range (as promised), 81% outside
  • Ensemble of 3-nearest-neighbor models: 86% inside, 24% outside. Outside, more than three times in four, the value was out of the interval
  • Ensemble of cubic polynomials: 91% inside, 92% outside (it holds outside because the intervals are very wide, though whether that width is practical is another matter)

Our calculation. Synthetic data. The interval is prediction ± 1.96 × (the standard deviation of uncertainty and noise combined). Inside the range is x = 0 to 5; outside is x = −2 to 0 and 5 to 9. Mean of 200 redrawings of the data. The Gaussian-process kernel was fixed (RBF, length 1, variance 1, noise 0.1). These are not results on real materials and do not rank the methods.

Common misconception: “if the ensemble's scatter is small, the prediction is accurate”

Not necessarily. If the members of an ensemble are built from the same training data in similar ways, they can all give the same (wrong) answer even where there are no data, and the scatter looks small. The ensemble of 3-nearest-neighbor models above does exactly this. Small scatter may be evidence that the members are alike, not that the prediction is certain. Whether an uncertainty estimate holds outside the range has to be checked outside the range. Kailkhura and colleagues also report, for materials, that the model's own confidence score cannot be trustedSourced [Ref. 16].

5. Measuring the “quality” of uncertainty: calibration and sharpness

An uncertainty estimate has a quality. Tran and colleagues present a suite of figures and performance metrics from the machine-learning community for judging the quality of uncertainty estimates for materials property predictions, probing accuracy, calibration and sharpness quantitativelySourced [Ref. 13]. In plain words:

  • Accuracy: how close the predicted values are to the true values
  • Calibration: when it says “95%,” does it really hold 95% of the time? The table in Chapter 4 examined this calibration inside and outside the range
  • Sharpness: how narrow the intervals are. An infinitely wide interval always holds but is useless. The best is narrow and still holds

Three related reports. Guo and colleagues report that modern neural networks, unlike those from a decade ago, are poorly calibrated, that depth, width, weight decay and batch normalization influence calibration, and that temperature scaling (a post-processing step that adjusts confidence with a single parameter) is surprisingly effective on most datasetsSourced [Ref. 14]. Hirschfeld and colleagues compared uncertainty-quantification methods on five regression datasets for molecular property prediction and report that none of the methods was unequivocally superior to all others, and none produced a particularly reliable ranking of errors across datasetsSourced [Ref. 15]. Kailkhura and colleagues point out that, with imbalanced data, standard methods for assessing the quality of models break down and lead to misleading conclusions, and that the model's own confidence score cannot be trustedSourced [Ref. 16].

A materials engineer's view 1: “test” the uncertainty estimate on your own data too

Uncertainty estimates miss differently by method and by data (the results of Hirschfeld et al.). So test them on your own data. For example, deliberately leave out part of your samples from training (preferably by group, such as by composition or lot) and count how many actually fall in the “95% interval.” If it misses by a lot, that estimate cannot be used for that purpose (commentary). If you have samples outside the range, using them is the most reliable check.

6. Applicability domain: deciding where a prediction may be made

Separate from uncertainty, the idea of deciding whether a material lies inside or outside the range the model learned from is the applicability domain (AD). In the field of chemical structure-activity relationships (QSAR), defining the applicability domain is one of the principles for validating models. The paper by Sahigara and colleagues introduces the five OECD principles for validating (Q)SAR models as: (1) a defined endpoint, (2) an unambiguous algorithm, (3) a defined domain of applicability, (4) appropriate measures of goodness-of-fit, robustness and predictivity, and (5) a mechanistic interpretation, if possible. It explains that reliable predictions are generally limited to query chemicals that are structurally similar to the compounds used to build the modelSourced [Ref. 17].

There are several types of methods for deciding the domain. Sahigara and colleagues classify them by how they characterize the interpolation space in the descriptor space of the training data: range-based methods (such as a “box” of the minimum to maximum of each descriptor), geometric methods (such as the “convex hull” enclosing the training points), distance-based methods (such as the Mahalanobis distance) and probability-density-based methods [Ref. 17].

Three ways to draw an applicability domain: box, hull, distance (our calculation) -2 0 2 -2 0 2 Descriptor 1 Descriptor 2 Query A Query B Orange dashed: box of min to max of each descriptor Green: convex hull of the training points Blue dotted: Mahalanobis distance (95th percentile) Of points scattered evenly in the box inside the hull: 29% inside the distance ellipse: 35% A is inside the box but far from the training points. B is inside the domain under every drawing. Training: 60 points (correlation 0.9). Counted over 20,000 points in the box.
Fig. 5 Chart including our calculation (vector drawing). An example trained on two correlated descriptors. A "box" around each descriptor's min to max also includes corners with no training points: only about 29% of the box lies inside the convex hull. Query A is inside the box but is an extrapolation, far from the training points.

Fig. 5 overlays three ways of drawing it, from 60 training points of two correlated descriptors (correlation 0.9) (Our calculation).

  • Box (orange dashed). It only encloses the minimum to maximum of each descriptor, so it also includes corners without training points. Query A is inside the box but far from the training points, so it is in fact an extrapolation. Of points scattered evenly in the box, only about 29% fell inside the convex hull
  • Convex hull (green). The smallest convex region enclosing the training points. It is narrower than the box and closer to the real distribution. But as the number of descriptors grows, it becomes hard to compute, and it cannot represent holes between training points. Sahigara et al. also report that the convex hull and probability-density methods flagged the largest number of test compounds as outside the domain, allowing only limited use of the models [Ref. 17]
  • Distance (blue dotted). An ellipse of points whose Mahalanobis distance (a distance that takes the correlation of descriptors into account) from the center of the training points is within the 95th percentile of the training points. In this example, about 35% of the box falls inside. Sahigara et al. report that distance-based approaches flagged a reasonable number of compounds as outside the domain, but that model statistics fell for some distance measures [Ref. 17]

Our calculation. Synthetic data. We counted, over 20,000 uniform random points in the box, the share that falls inside each method's domain. Not results on real materials. The conclusions of Sahigara et al. come from a comparison on models of the bioconcentration factor of chemicals and do not necessarily carry over to materials properties.

Where people get stuck: there is no single “correct” applicability domain

Which materials are judged “inside” changes with how you draw it. Sahigara et al. also report that the characterization of the domain differs by method and that the results change with the data [Ref. 17]. So do not take “inside” by one method as a guarantee that the prediction is right. Overlay several methods according to your purpose, and measure the prediction error actually inside and outside to check the criterion (Chapter 7).

Here is another viewpoint. Sutton and colleagues point out that evaluating a model only by its average error over everything can make models whose average errors look the same actually differ greatly in performance across materials, and can hide that a model that looks insufficient overall works well in specific sub-domains. They propose a method based on subgroup discovery to find the domain of applicability from the data, and show for the prediction of formation energies of transparent conducting oxides that three state-of-the-art models with mutually indistinguishable average error have domains of applicability with distinctive featuresSourced [Ref. 18].

7. Distance from the training data, and error

We check with a small experiment whether the idea of an applicability domain is really useful (Our calculation). With two descriptors (range 0 to 2) we measure 60 points and train a Gaussian process. We evaluate on 2,000 points in the range 0 to 5, and for each point look at the distance to the nearest training point and the prediction error.

Distance from the training data versus prediction error (our calculation) 0.0 0.5 1.0 1.5 2.0 Mean absolute error Distance to the nearest training point (descriptor space) 0.02 0–0.1 n = 122 0.02 0.1–0.2 n = 136 0.04 0.2–0.4 n = 120 0.19 0.4–0.8 n = 129 0.55 0.8–1.6 n = 376 1.92 1.6–5 n = 1117 Mean absolute error of the "return the mean" prediction: 1.27 60 training points (2-D, range 0-2), 2,000 test points (range 0-5). Predicted by a Gaussian process. Distance is in descriptor units.
Fig. 6 Chart including our calculation (vector drawing). The farther from the training points, the larger the error: 0.015 within a distance of 0.1 and 1.92 beyond 1.6. In the far region it is worse than the "return the mean" prediction (1.27). Distance is a clue to the size of the error in advance.

The results are in Fig. 6. When the distance to the nearest training point is under 0.1, the mean absolute error is 0.015. It rises with distance: 0.19 for 0.4 to 0.8, 0.55 for 0.8 to 1.6, and 1.92 for 1.6 or more. In the region of 1.6 or more, it is worse than the mean absolute error (1.27) of a prediction that just returns the mean of all data.

Our calculation. Synthetic data (true relation y = sin(1.5x₁) + 0.5cos(2x₂) + 0.3x₁x₂, noise 0.05). 60 training points (range 0 to 2), 2,000 test points (range 0 to 5). Gaussian process (RBF, fixed settings). Not results on real materials.

A materials engineer's view 2: put “how far from the usual conditions” into a number

Whenever you predict a new candidate, also compute the distance to the nearest sample in the training data; it is a rough guide to how far the prediction can be trusted. The distance is measured in the space of descriptors (business cards). But it changes with how you measure it (which descriptors, and whether you put the scales on one footing; see our explainer on materials data and descriptors). Decide the threshold (beyond this, treat it as extrapolation) by measuring the error inside and outside on your own data. As ways to evaluate extrapolation, Meredig et al. state that traditional machine-learning metrics overestimate model performance for materials discoverySourced [Ref. 19], and Xiong et al. show with k-fold-m-step forward cross-validation that the explorative prediction power is actually very lowSourced [Ref. 20].

8. How to use it: deciding the next experiment

Uncertainty and applicability domain are computed together at every prediction and used in decisions. Fig. 7 gathers the flow (our own organization).

Using uncertainty and applicability domain in decisions (our summary) 1. Predict Value for a new candidate 2. Compute two things Uncertainty; distance to training 3. Inside the domain? (distance, box, hull ...) Yes 4. Use with confidence Prefer low uncertainty No 5. Extrapolation Skip or measure 6. Check by experiment (a prediction is a candidate) High-uncertainty candidates carry more information 7. Add results as new data; update the model and the domain * Even a "yes" in step 3 leaves some uncertainty; step 4 is for ranking confirmation experiments. * Letting the model choose the next candidate (Bayesian optimization, active learning) is covered in another article in this series.
Fig. 7 Conceptual diagram (vector drawing). Each time you predict, compute uncertainty and distance to the training points, and handle the case by whether it is inside or outside the domain. Outside candidates are either not used or checked by measurement.
  1. Predict. Predict the value of a new candidate with the model
  2. Compute two things. The uncertainty of the prediction, and the distance to the training data (a guide to the applicability domain)
  3. Inside the domain? Decide by distance, box, convex hull and so on. Overlaying several methods reduces what you miss
  4. If inside, use with a level of confidence. Prefer candidates with small uncertainty and promising performance. But uncertainty is not zero
  5. If outside, treat it as extrapolation. Either do not use it or measure it. Candidates outside lie in thinly covered regions, so measuring them adds much information
  6. Check by experiment. A prediction is a candidate, and confirmation is by experiment
  7. Add the results to the data. Update the model and the domain
Additional measurements check a candidate unlike the training set. Applicability must be assessed from data, not appearance alone.
Fig. 8. Conceptual illustration generated with ImageGen. Additional measurements check a candidate unlike the training set. Applicability must be assessed from data, not appearance alone.Not an actual product, facility or measurement. Enlarged models, lines, arrows and colours are explanatory.

Li and colleagues showed for several large materials datasets that up to 95% of the data can be removed from training with little effect on in-distribution performance, but that the degradation out of distribution is not prevented, and report that uncertainty-based active learning can construct much smaller but equally informative datasetsSourced [Ref. 21]. It suggests that where you measure matters more than how much data you have (commentary).

Common misconception: “inside the domain with small uncertainty means the prediction is right”

It is only more likely to be right, not guaranteed. There are three reasons. (1) An uncertainty estimate can miss (Chapters 4 and 5). (2) The domain test is closeness in descriptor space, and differences not written on the card (for example impurities, grain size or thermal history) are invisible. (3) The training data themselves have measurement scatter and bias (see our explainer on materials data and descriptors). Even inside the range, a prediction is a candidate; do not skip confirmation by experiment.

A materials engineer's view 3: use uncertainty in designing the “confirming experiment”

When choosing the next sample to measure, include not only candidates that look high-performing but also candidates with large uncertainty. The former connects directly to results; the latter reduces the model's lack of knowledge and improves the next prediction (the combination of exploration and exploitation in Ling et al. [Ref. 12]). Also, when a prediction misses, that sample is valuable data that shows “the model's weak point.” Record failed conditions as well and add them to the data (commentary; see the value of failed results in our explainer on materials data and descriptors).

9. Limits, what we could not confirm, and a summary

(1) What we could not confirm

  • Numerical experiments. The calculations in Chapters 4, 6 and 7 use synthetic data. They do not show how well uncertainty estimates hold, or how effective domain tests are, in real materials. Nor do they rank particular methods
  • The original OECD principles. The OECD site could not be opened because of an automated-access restriction, so we used the introduction in the open-access paper by Sahigara et al. We did not confirm the adoption date or details
  • Preconditions of the conformal-prediction guarantee. We introduced the abstract of the original paper (a guarantee without distributional assumptions) but did not confirm the details of the conditions under which it holds, nor the guarantee in extrapolation
  • Other uncertainty methods. We do not cover Bayesian neural networks, methods using dropout, or methods that output a predictive distribution
  • Which domain method is best. The comparison of Sahigara et al. is on models of chemicals. We did not confirm which method is best for predicting materials properties
  • International standards on uncertainty. We could confirm those on measurement uncertainty (JCGM 100, ISO 5725-1), but could not confirm an international standard specific to the uncertainty of machine-learning predictions or to the applicability domain (Chapter 10)
Summary of this article
  • Uncertainty is of two kinds. Random error that cannot be reduced (for example 0.082 eV/atom between experiments for formation energy) and lack of knowledge that shrinks when you measureSourced
  • Uncertainty estimates can also miss. From the same 15 points, the Gaussian-process band widened outside the range while the 3-nearest ensemble stayed narrow, and the share of values actually inside a “95% interval” outside the range was 81% and 24%Our calculation
  • Quality is measured by calibration and sharpness. No method can be declared the best (the results of Hirschfeld et al.). Test them on your own dataSourced
  • The applicability domain changes with the method. The box includes corners without training points; in our example only about 29% of the box lay inside the convex hullOur calculation
  • The farther from the training points, the larger the error. From 0.015 to 1.92, worse than a “return the mean” prediction (1.27)Our calculation. A prediction is a candidate, to be checked by experiment

10. How to read the yardsticks and standards

How good uncertainty and applicability domain are depends on which yardstick you use. The main yardsticks are the calibration of uncertainty (does “95%” really hold 95% of the time), sharpness (narrowness of intervals), differences in error inside and outside the range, extrapolation performance (forward cross-validation and the like) and measurement uncertainty (scatter on the experimental side). Each measures something different and leaves something out. For example, good calibration is useless if the intervals are too wide. The table lists what we could confirm (checked 22 October 2026). We could not confirm an international standard specific to the uncertainty and applicability domain of machine-learning predictions.

What is evaluatedRepresentative benchmark or evaluation method (name, source)Standard or guideline (ISO/IEC, NIST, international principles, etc.)Cautions in reading
Quality of prediction uncertainty (accuracy, calibration, sharpness)Tran et al. (2020): figures and metrics for accuracy, calibration and sharpness [Ref. 13]. Guo et al. (2017): calibration and temperature scaling [Ref. 14]. Hirschfeld et al. (2020): a comparison of uncertainty-quantification methods [Ref. 15]SourcedCould not be confirmed (no international standard specific to the uncertainty of machine-learning predictions found)Which method is better changes with data and metric (Hirschfeld et al. report that none is superior on all). Calibration outside the range must be checked separately
Applicability domainSutton et al. (2020): finding the domain of applicability from the data by subgroup discovery [Ref. 18]. Sahigara et al. (2012): a comparison of applicability-domain methods [Ref. 17]SourcedPrinciple 3 of the OECD principles for validating (Q)SAR models, “a defined domain of applicability” (as introduced in the paper by Sahigara et al.; the OECD original was not read) [Ref. 17]SourcedThe OECD principles belong to the field of (Q)SAR for chemicals and are not an MI standard for materials. We did not confirm their legal status. The domain changes with the method
Extrapolation performanceXiong et al. (2020): k-fold-m-step forward cross-validation [Ref. 20]. Meredig et al. (2018): traditional metrics overestimate performance for materials discovery [Ref. 19]SourcedCould not be confirmedNumbers from random splits overstate how well predictions fit new materials. Evaluation outside the range is needed separately
Measurement uncertainty (experimental side)The OQMD example: mean absolute error between experiments 0.082 eV/atom [Ref. 3]SourcedJCGM 100:2008 (GUM: guide to the expression of uncertainty in measurement, September 2008) [Ref. 4]; ISO 5725-1:2023 (accuracy of measurement methods and results, July 2023) [Ref. 5]SourcedMeasurement uncertainty is a concept about experimental values and differs from the uncertainty of a prediction model. Full text of ISO 5725-1 not read
Reliability of AI systems—NIST AI RMF 1.0 (NIST AI 100-1, January 2023): one characteristic of trustworthy AI is “valid and reliable.” It states that deploying AI systems that are inaccurate, unreliable or poorly generalized to data and settings beyond their training creates and increases negative AI risks and reduces trustworthiness [Ref. 22]SourcedA framework meant for voluntary use. It sets no concrete method for the uncertainty of materials predictions
Framework for machine-learning systems—ISO/IEC 23053:2022 (framework for AI systems using machine learning, June 2022) [Ref. 23]SourcedA framework standard; it does not set how to estimate uncertainty. Full text not read

The arrangement of the table is Our calculation (organization). ISO/IEC and ISO numbers, titles and dates were checked on the official ISO pages (22 October 2026). The NIST AI RMF wording was checked in the document's text. Standard texts are paywalled, so we checked only titles and dates and wrote no requirements.

Cautions in reading (for materials engineers)

  • Check calibration in a report that gives uncertainty. Even if it says “95% interval,” whether it really holds 95% of the time is another matter. See whether there is a check outside the range
  • Trust applicability domains whose method is stated. Check that it says which descriptors, which distance (or box, or hull) and what threshold
  • Do not mix measurement uncertainty with prediction uncertainty. Read with suspicion a claim that a model's error is smaller than the measurement scatter
  • Most principles and guidelines are recommendations. The NIST AI RMF is meant for voluntary use. The OECD principles belong to the field of chemicals. ISO/IEC standards generally bind only when cited in law or contracts (commentary). When something says “compliant,” check which requirement of which document is meant

11. Glossary

Uncertainty
How much a prediction may vary. Considered as random error and lack of knowledge.
Random error (aleatoric)
Noise inherent in the observation. Does not shrink with more data.
Lack of knowledge (epistemic)
The model's uncertainty in ranges without data. Shrinks when you measure.
Standard deviation
A number for the size of scatter in values. Often used for band width.
Interval (confidence / prediction interval)
A prediction with a width: “the value should fall in this range.”
Calibration
When it says “95%,” it really holds 95% of the time.
Sharpness
How narrow the intervals are. With good calibration, narrower is more useful.
Ensemble
Building several slightly different models and using the scatter of their predictions as uncertainty.
Bagging / bootstrap
Resampling the data with replacement to build several models.
Gaussian process
A method that returns a probabilistic mean and width. The farther from the data, the wider the width.
Kernel
A function for how similar two materials are. Governs the behavior of a Gaussian process.
Conformal prediction
A framework that builds intervals containing the value with a specified probability from how far past predictions missed.
Applicability domain (AD)
The range of materials (descriptors) for which the model is regarded as giving reliable predictions.
Convex hull
The smallest convex region enclosing all the training points.
Mahalanobis distance
A distance from the center of the points that takes the correlation of descriptors into account.
Extrapolation
Predicting outside the range of the training data. Less likely to be right.
Forward cross-validation
Cross-validation that sorts the data by value and uses the range ahead for evaluation. Used to evaluate extrapolation.
Temperature scaling
A post-processing step that adjusts a model's confidence with a single parameter.
Active learning
Learning in which the model chooses which sample to measure next. Uses uncertainty.
Measurement uncertainty
A quantity expressing the dispersion of values reasonably attributable to the measurement result (the GUM definition).

12. References (primary sources)

  1. Kendall A., Gal Y. "What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?", arXiv:1703.04977 (NeurIPS 2017) — arxiv.org/abs/1703.04977
  2. Hüllermeier E., Waegeman W. "Aleatoric and epistemic uncertainty in machine learning: an introduction to concepts and methods", Mach. Learn. 110, 457–506 (2021), DOI 10.1007/s10994-021-05946-3 — doi.org/10.1007/s10994-021-05946-3
  3. Kirklin S. et al. "The Open Quantum Materials Database (OQMD): assessing the accuracy of DFT formation energies", npj Comput. Mater. 1, 15010 (2015), DOI 10.1038/npjcompumats.2015.10 (open access) — doi.org/10.1038/npjcompumats.2015.10
  4. JCGM "JCGM 100:2008 Evaluation of measurement data — Guide to the expression of uncertainty in measurement (GUM)" (PDF published by BIPM) — bipm.org/documents/…/JCGM_100_2008_E.pdf
  5. ISO "ISO 5725-1:2023 Accuracy (trueness and precision) of measurement methods and results — Part 1: General principles and definitions" (ISO page) — iso.org/standard/69418.html
  6. Ramprasad R. et al. "Machine learning in materials informatics: recent applications and prospects", npj Comput. Mater. 3, 54 (2017), DOI 10.1038/s41524-017-0056-5 — doi.org/10.1038/s41524-017-0056-5
  7. Lakshminarayanan B., Pritzel A., Blundell C. "Simple and Scalable Predictive Uncertainty Estimation using Deep Ensembles", arXiv:1612.01474 (NeurIPS 2017) — arxiv.org/abs/1612.01474
  8. Wager S., Hastie T., Efron B. "Confidence Intervals for Random Forests: The Jackknife and the Infinitesimal Jackknife", J. Mach. Learn. Res. 15, 1625–1651 (2014) — jmlr.org/papers/v15/wager14a.html
  9. scikit-learn User Guide "Gaussian Processes" — scikit-learn.org/stable/modules/gaussian_process.html
  10. Rasmussen C. E., Williams C. K. I. "Gaussian Processes for Machine Learning", MIT Press (2006) (book web page) — gaussianprocess.org/gpml/
  11. Angelopoulos A. N., Bates S. "A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantification", arXiv:2107.07511 — arxiv.org/abs/2107.07511
  12. Ling J. et al. "High-Dimensional Materials and Process Optimization Using Data-Driven Experimental Design with Well-Calibrated Uncertainty Estimates", Integr. Mater. Manuf. Innov. 6, 207–217 (2017), DOI 10.1007/s40192-017-0098-z — doi.org/10.1007/s40192-017-0098-z
  13. Tran K. et al. "Methods for comparing uncertainty quantifications for material property predictions", Mach. Learn.: Sci. Technol. 1, 025006 (2020), DOI 10.1088/2632-2153/ab7e1a — doi.org/10.1088/2632-2153/ab7e1a
  14. Guo C. et al. "On Calibration of Modern Neural Networks", arXiv:1706.04599 (ICML 2017) — arxiv.org/abs/1706.04599
  15. Hirschfeld L. et al. "Uncertainty Quantification Using Neural Networks for Molecular Property Prediction", J. Chem. Inf. Model. 60, 3770–3780 (2020), DOI 10.1021/acs.jcim.0c00502 — doi.org/10.1021/acs.jcim.0c00502
  16. Kailkhura B. et al. "Reliable and explainable machine-learning methods for accelerated material discovery", npj Comput. Mater. 5, 108 (2019), DOI 10.1038/s41524-019-0248-2 (open access) — doi.org/10.1038/s41524-019-0248-2
  17. Sahigara F. et al. "Comparison of Different Approaches to Define the Applicability Domain of QSAR Models", Molecules 17, 4791–4810 (2012), DOI 10.3390/molecules17054791 (open access) — pmc.ncbi.nlm.nih.gov/articles/PMC6268288/
  18. Sutton C. et al. "Identifying domains of applicability of machine learning models for materials science", Nat. Commun. 11, 4428 (2020), DOI 10.1038/s41467-020-17112-9 (open access) — doi.org/10.1038/s41467-020-17112-9
  19. Meredig B. et al. "Can machine learning identify the next high-temperature superconductor? Examining extrapolation performance for materials discovery", Mol. Syst. Des. Eng. 3, 819–825 (2018), DOI 10.1039/C8ME00012C — doi.org/10.1039/C8ME00012C
  20. Xiong Z. et al. "Evaluating explorative prediction power of machine learning algorithms for materials discovery using k-fold forward cross-validation", Comput. Mater. Sci. 171, 109203 (2020), DOI 10.1016/j.commatsci.2019.109203 — doi.org/10.1016/j.commatsci.2019.109203
  21. Li K. et al. "Exploiting redundancy in large materials datasets for efficient machine learning with less data", Nat. Commun. 14, 7283 (2023), DOI 10.1038/s41467-023-42992-y (open access) — doi.org/10.1038/s41467-023-42992-y
  22. NIST "Artificial Intelligence Risk Management Framework (AI RMF 1.0)", NIST AI 100-1, January 2023, DOI 10.6028/NIST.AI.100-1 — doi.org/10.6028/NIST.AI.100-1
  23. ISO/IEC "ISO/IEC 23053:2022 Framework for Artificial Intelligence (AI) Systems Using Machine Learning (ML)" (ISO page) — iso.org/standard/74438.html

13. Claim-to-source audit

Claim in the textBasisCategory
The distinction between aleatoric uncertainty (noise inherent in the observations) and epistemic uncertainty (uncertainty in the model, which can be explained away given enough data)Abstract of Kendall and Gal
Reference 1 https://arxiv.org/abs/1703.04977
Sourced
That a paper introduces aleatoric and epistemic uncertainty in machine learning, from concepts to methods (from its title)Title and bibliographic details of Hüllermeier and Waegeman (2021)
Reference 2 https://doi.org/10.1007/s10994-021-05946-3
Sourced
Mean absolute error between experiments for formation energies of 0.082 eV/atom (surprisingly large)Abstract of Kirklin et al. (2015)
Reference 3 https://doi.org/10.1038/npjcompumats.2015.10
Sourced
Title of JCGM 100:2008 (GUM, September 2008) and its definition of uncertainty of measurementPDF published by BIPM (checked 22 October 2026)
Reference 4 https://www.bipm.org/documents/20126/2071204/JCGM_100_2008_E.pdf/cb0ef43f-baa5-11cf-3f85-4dcd86f77bd6?version=1.24&t=1775224054694&download=true
Sourced
Number, title and publication date of ISO 5725-1:2023 (July 2023)ISO page (checked 22 October 2026)
Reference 5 https://www.iso.org/standard/69418.html
Sourced
MI predictions are typically interpolative; extrapolation requires prediction uncertainties to be taken into accountAbstract of Ramprasad et al. (2017)
Reference 6 https://doi.org/10.1038/s41524-017-0056-5
Sourced
Deep ensembles were proposed as simple to implement, parallelizable and yielding high-quality predictive uncertainty estimatesAbstract of Lakshminarayanan et al.
Reference 7 https://arxiv.org/abs/1612.01474
Sourced
How to estimate standard errors for bagged learners and random forestsAbstract of Wager et al. (2014)
Reference 8 https://jmlr.org/papers/v15/wager14a.html
Sourced
A Gaussian-process prediction is probabilistic and empirical confidence intervals can be computed; efficiency drops in high dimensions (more than a few dozen features); a standard textbook existsThe scikit-learn user guide and the book web page
Reference 9 https://scikit-learn.org/stable/modules/gaussian_process.html
Reference 10 https://gaussianprocess.org/gpml/
Sourced
Conformal prediction can be used with any model and, without distributional assumptions, produces intervals or sets containing the true value with a specified probability; extensions such as distribution shiftAbstract of Angelopoulos and Bates
Reference 11 https://arxiv.org/abs/2107.07511
Sourced
A model with uncertainty estimates combines exploration and exploitation to propose the next experiment; over four materials-science test cases the optimal candidate was found with on average three times fewer measurements than random guessingAbstract of Ling et al. (2017)
Reference 12 https://doi.org/10.1007/s40192-017-0098-z
Sourced
A suite of figures and metrics for judging the quality of uncertainty estimates by accuracy, calibration and sharpnessAbstract of Tran et al. (2020)
Reference 13 https://doi.org/10.1088/2632-2153/ab7e1a
Sourced
Modern neural networks are poorly calibrated; temperature scaling is surprisingly effective on most datasetsAbstract of Guo et al.
Reference 14 https://arxiv.org/abs/1706.04599
Sourced
On five regression datasets, none of the tested uncertainty-quantification methods was unequivocally superior to all others, and none produced a particularly reliable ranking of errorsAbstract of Hirschfeld et al. (2020)
Reference 15 https://doi.org/10.1021/acs.jcim.0c00502
Sourced
Standard quality assessment breaks down with imbalanced data; the model's own confidence score cannot be trustedAbstract of Kailkhura et al. (2019)
Reference 16 https://doi.org/10.1038/s41524-019-0248-2
Sourced
The five OECD principles for validating (Q)SAR models (the third is a defined domain of applicability) as introduced; reliable predictions are limited to query compounds structurally similar to the training compounds; four categories of applicability-domain methods (range-based, geometric, distance-based, probability-density-based); the convex hull and probability-density methods flagged the most compounds as outside, and distance-based methods a reasonable number; the characterization differs by methodText of Sahigara et al. (2012)
Reference 17 https://pmc.ncbi.nlm.nih.gov/articles/PMC6268288/
Sourced
Models with the same average error can differ in applicability domain; a subgroup-discovery method for finding the domain of applicability; comparison of three models for formation energies of transparent conducting oxidesAbstract of Sutton et al. (2020)
Reference 18 https://doi.org/10.1038/s41467-020-17112-9
Sourced
Traditional machine-learning metrics overestimate model performance for materials discoveryOpening sentence of the abstract of Meredig et al. (2018) (checked via OpenAlex)
Reference 19 https://doi.org/10.1039/C8ME00012C
Sourced
A proposal of k-fold-m-step forward cross-validation; even when conventional cross-validation looks good, explorative prediction power is very lowAbstract of Xiong et al. (2020)
Reference 20 https://doi.org/10.1016/j.commatsci.2019.109203
Sourced
Up to 95% of data can be removed with little effect on in-distribution performance and the out-of-distribution degradation is not prevented; uncertainty-based active learning can construct much smaller but equally informative datasetsAbstract of Li et al. (2023)
Reference 21 https://doi.org/10.1038/s41467-023-42992-y
Sourced
Number and title of NIST AI RMF 1.0 (NIST AI 100-1, January 2023); the "valid and reliable" passage (deploying inaccurate, unreliable or poorly generalized AI systems creates negative risks); its intended voluntary useText of NIST AI 100-1
Reference 22 https://doi.org/10.6028/NIST.AI.100-1
Sourced
Number, title and publication date of ISO/IEC 23053:2022 (June 2022)ISO page (checked 22 October 2026)
Reference 23 https://www.iso.org/standard/74438.html
Sourced
The share of 95% intervals that held inside and outside the range (Gaussian process 95% / 81%, 3-nearest ensemble 86% / 24%, cubic-polynomial ensemble 91% / 92%), the box / hull / distance comparison (29%, 35%), and the errors by distance band (0.015 to 1.92; the return-the-mean prediction 1.27)Our calculation (Python and NumPy; synthetic data, fixed seeds, means over 200 runs and so on). Not results on real materials. Does not rank methodsOur calculation
The original OECD principles, details of the conformal-prediction guarantee, other uncertainty methods, which domain method is best for materials, an international standard specific to the uncertainty of machine-learning predictions, and the text of the ISO standardsNot confirmed in the primary sources we could access, so not stated (the OECD site could not be opened because of an automated-access restriction)Commentary
The "guess on the map" analogy, each "materials engineer's view", the flow of use, and the cautions in readingOur own organization and commentary based on the published content. Not views expressed by the institutionsCommentary
That the figures are explanatory drawings, not observations of real data; that the hero image and Fig. 8 are ImageGen-generated conceptual illustrationsOur note in this articleCommentary

Last updated: 22 October 2026 / Sources are limited to primary materials (peer-reviewed papers, arXiv papers, and official pages of scikit-learn, NIST, ISO and BIPM). The full text of ISO/IEC standards is paywalled and was not checked. The OECD principles are taken from an introduction in an open-access paper. The numerical experiments in Chapters 4, 6 and 7 are calculations on synthetic data we generated; they are not results on real materials and do not rank methods. We could not confirm the original OECD principles, details of the conformal-prediction guarantee, which domain method is best for materials, or an international standard specific to the uncertainty of machine-learning predictions, so these are not stated. All figures are explanatory concept diagrams or drawings that include our own calculation; the hero image and Fig. 8 are ImageGen-generated conceptual illustrations.

🌐 Japanese