Inferensys

Glossary

Applicability Domain

The theoretical region of chemical space within which a predictive model's estimations are reliable, defined by the structural and property-based similarity to its training data.
Data scientist building training data pipeline on laptop, data preprocessing visible, technical workspace.
MODEL RELIABILITY BOUNDARY

What is Applicability Domain?

The applicability domain defines the theoretical region of chemical space within which a predictive model's estimations are reliable, bounded by the structural and property-based similarity to its training data.

The applicability domain is the defined physicochemical and structural space where a Quantitative Structure-Activity Relationship (QSAR) or machine learning model can generate predictions with confidence. It establishes a boundary of reliability by characterizing the training set's molecular diversity, ensuring the model is not extrapolating into unknown regions of chemical space where its error rate is unacceptably high.

Defining this domain relies on metrics like leverage, Euclidean distance, or similarity thresholds to detect outliers. A prediction for a molecule outside the domain is an extrapolation and inherently unreliable. For regulatory acceptance under OECD principles, defining the applicability domain is a mandatory requirement to justify the validity of in silico predictions.

DEFINITIONAL BOUNDARIES

Core Characteristics of an Applicability Domain

An applicability domain (AD) is not a binary flag but a high-dimensional, probabilistic construct defined by several interdependent characteristics. These factors collectively determine whether a query molecule falls within the region of chemical space where a model's predictions can be considered reliable.

01

Structural Similarity

The foundational metric for defining an AD, measuring the Tanimoto distance or Euclidean distance between a query molecule's fingerprint and the training set's centroid or nearest neighbors.

  • Key methods: Morgan fingerprints (ECFP4), MACCS keys, or graph kernels.
  • Thresholds: A common heuristic is a Tanimoto similarity > 0.7 to the nearest training compound.
  • Limitation: Structural similarity alone fails to capture activity cliffs, where nearly identical molecules exhibit drastically different biological potency.
02

Descriptor Range Interpolation

The AD is defined by the convex hull or bounding box of the training data's physicochemical descriptor space. A prediction is reliable only if the query molecule's descriptors fall within the observed ranges.

  • Critical descriptors: Molecular weight, LogP, topological polar surface area (TPSA), and number of rotatable bonds.
  • Leverage approach: The Williams plot visualizes standardized residuals versus hat values (leverage) to identify high-leverage extrapolations and potential outliers.
  • Extrapolation risk: Querying beyond the descriptor bounds constitutes an extrapolation, where model behavior is undefined and often dangerously overconfident.
03

Distance to Model

A probabilistic measure of how far a query instance is from the model's training distribution in the latent or feature space, often using Mahalanobis distance or standard deviation of ensemble predictions.

  • Ensemble variance: High variance among predictions from an ensemble of models indicates the query is in a region of high epistemic uncertainty, signaling it is outside the AD.
  • One-class classification: Models like One-Class SVMs or Isolation Forests can be trained solely on the training data to learn a decision boundary that envelops the AD, rejecting foreign samples.
  • Gaussian Process confidence: The predictive variance of a Gaussian Process naturally increases in regions far from training data, providing a mathematically rigorous AD boundary.
04

Density Estimation

The AD can be modeled by estimating the probability density function (PDF) of the training data in chemical space. A query molecule is considered out-of-domain if its likelihood falls below a calibrated threshold.

  • Kernel Density Estimation (KDE): A non-parametric method that places a Gaussian kernel on each training point to create a smooth, continuous density landscape.
  • Gaussian Mixture Models (GMM): Captures multi-modal distributions, representing distinct chemical series or clusters within the training set.
  • Deep generative models: Variational autoencoders (VAEs) learn a continuous latent representation of the training molecules; the reconstruction error or latent space likelihood serves as a powerful AD metric.
05

Conformal Prediction Guarantees

A rigorous, distribution-free framework that provides a finite-sample, model-agnostic validity guarantee for the AD. Instead of a binary in/out decision, it produces prediction sets with a user-specified error rate (α).

  • Inductive conformal prediction: Uses a held-out calibration set to compute nonconformity scores, defining a threshold that guarantees marginal coverage (e.g., 95%).
  • Mondrian conformal prediction: Extends the framework to provide conditional validity across different classes or molecular scaffolds, preventing biased coverage.
  • Credibility and confidence: The framework outputs a p-value for each possible label, where a low p-value for the predicted class indicates the molecule is likely outside the model's reliable domain.
06

Mechanistic Plausibility Check

A domain-specific filter that validates whether a query molecule's predicted property is physically or biologically plausible, acting as a sanity check beyond statistical metrics.

  • Lipinski's Rule of Five: A heuristic filter for oral bioavailability; a model predicting high oral absorption for a molecule violating multiple rules should be flagged.
  • PAINS and ALARM NMR filters: Identifies pan-assay interference compounds or reactive entities; a potent bioactivity prediction for a known PAINS compound is likely a false positive.
  • Metabolic logic: A predicted site of metabolism (SOM) that contradicts established cytochrome P450 reactivity rules indicates the query is outside the model's reliable mechanistic domain.
APPLICABILITY DOMAIN

Frequently Asked Questions

Clarifying the boundaries of reliable model predictions in chemical space.

An applicability domain is the theoretical region of chemical space within which a quantitative structure-activity relationship (QSAR) or machine learning model's predictions are reliable, defined by the structural and property-based similarity of a query compound to the model's training data. It establishes a boundary condition: if a new molecule falls outside this domain, the model is extrapolating, and its prediction should be treated with low confidence or rejected entirely. The concept is mandated by OECD Principle 3 for regulatory QSAR validation, which requires a defined domain to ensure scientifically valid predictions. The domain is typically characterized by the range of molecular descriptors, such as LogP, molecular weight, and topological fingerprints, that were present during training. A robust applicability domain assessment prevents the misuse of models on novel chemical scaffolds for which they have no foundational knowledge, directly addressing the risk of silent, high-confidence failures in drug discovery pipelines.

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.