Inferensys

Glossary

Completeness Axiom

A fundamental principle in explainable AI requiring that the sum of all feature attribution scores for a prediction equals the difference between the model's output for the input and a baseline output.
Data engineer managing feature store on laptop, feature definitions visible, casual data engineering session.
AXIOMATIC ATTRIBUTION PRINCIPLE

What is Completeness Axiom?

The completeness axiom is a fundamental mathematical constraint ensuring that the sum of all feature attributions for a specific input exactly equals the difference between the model's output for that input and a predefined baseline reference output.

The Completeness Axiom mandates that an attribution method must fully decompose the model's output prediction. Specifically, the sum of the importance scores assigned to every input feature must precisely equal the difference between the model's output for the target input and its output for a neutral baseline input (often a black image or zero embedding vector). This property guarantees that no relevance is created or destroyed during the explanation process, providing a complete accounting of the output value.

This axiom is a cornerstone of axiomatic attribution frameworks, distinguishing methods like Integrated Gradients and DeepLIFT from simpler gradient-based approaches that violate completeness. By enforcing this conservation law, it ensures that the magnitude of the explanation is faithful to the model's actual output delta, making it critical for high-stakes auditing where understanding the total contribution of all factors is mandatory for regulatory compliance.

FOUNDATIONAL PRINCIPLE

Key Characteristics of the Completeness Axiom

The Completeness Axiom is a critical mathematical property for feature attribution methods. It mandates that the sum of all feature importance scores for a specific input must exactly equal the difference between the model's output for that input and its output for a neutral baseline. This ensures a full, accountable decomposition of the prediction.

01

The Summation Requirement

The axiom dictates that the total attribution is conserved. If you sum the importance scores assigned to every pixel in an image or every word in a sentence, the result must precisely match the model's output difference: f(x) - f(x'). This prevents attribution methods from creating or destroying evidence, ensuring no part of the model's decision logic is hidden or unaccounted for in the explanation.

02

Baseline Definition

The choice of baseline x' is fundamental to the axiom's application. The baseline represents a neutral, information-absent input. Common examples include:

  • A completely black image for vision models.
  • A zero-embedding vector for text models.
  • A blank or average input sample. The attribution explains the deviation from this defined state of absence, making the baseline's selection a critical modeling choice.
03

Distinction from Sensitivity-n

While related, the Completeness Axiom is distinct from the Sensitivity-n axiom. Sensitivity-n requires that if a single feature is changed and the output changes, that feature gets a non-zero attribution. Completeness is a stronger, global constraint on the sum. A method can satisfy Sensitivity-n but fail Completeness if it misses interactions, whereas a method satisfying Completeness guarantees a full decomposition of the total output change.

04

Methods That Satisfy It

Only a specific class of attribution methods inherently satisfy the Completeness Axiom. Key examples include:

  • Integrated Gradients: Constructs attributions by accumulating gradients along a path, guaranteeing the sum equals the output difference.
  • DeepLIFT: Decomposes the output difference by comparing activations to a reference state.
  • Layer-wise Relevance Propagation (LRP): Uses a conservation property to redistribute the output score backwards.
  • FullGrad: Aggregates input and bias gradients for a complete decomposition.
05

Failure Case: Gradient × Input

The simple Gradient × Input method is a classic example of a technique that fails the Completeness Axiom. Because it relies on a first-order Taylor approximation at the input point, it misses the contribution of non-linear interactions and saturated regions. The sum of its attributions will generally not equal f(x) - f(x'), making it an incomplete and potentially misleading explanation of the model's total behavior.

06

Unified by Path Methods

The Completeness Axiom is formally guaranteed by Path Methods, a broader class of attribution techniques. These methods define feature importance by integrating the model's gradient along a continuous path from the baseline x' to the target input x. The fundamental theorem of calculus for line integrals ensures that the sum of the integrated gradients along any path exactly equals the final output difference, satisfying the axiom by construction.

AXIOMATIC FOUNDATIONS

Frequently Asked Questions

Explore the core mathematical principles that define rigorous feature attribution, focusing on the completeness axiom and its critical role in ensuring that explanations fully account for a model's predictive output.

The completeness axiom is a fundamental principle stating that the sum of all feature attribution scores for a specific input must exactly equal the difference between the model's output for that input and its output for a predefined baseline reference. In mathematical terms, if F(x) is the model's output for input x and F(b) is the output for a baseline b, then the sum of attributions Σ A_i(x) must equal F(x) - F(b). This property ensures that the explanation method provides a full decomposition of the prediction, leaving no portion of the output unexplained. It is a critical requirement for Integrated Gradients and DeepLIFT, and is a central axiom in the SHAP framework, where it guarantees that the Shapley values efficiently distribute the total credit among all input features.

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.