Inferensys

Glossary

Concept Relevance Propagation (CRP)

Concept Relevance Propagation (CRP) is an explainability method that extends Layer-wise Relevance Propagation to decompose a model's decision through higher-level latent concepts, tracing their relevance flow.
ML engineer running AI model benchmarks, performance charts on multiple screens, late night home office setup.
LATENT CONCEPT ATTRIBUTION

What is Concept Relevance Propagation (CRP)?

An extension of Layer-wise Relevance Propagation that decomposes a model's decision not just by input features but also through higher-level latent concepts, tracing their relevance flow.

Concept Relevance Propagation (CRP) is an explainability method that extends Layer-wise Relevance Propagation to attribute a neural network's decision to human-understandable latent concepts rather than raw input features. It backpropagates relevance scores through the network's layers while conditioning the flow on specific directions in the activation space that correspond to semantic abstractions, revealing how high-level ideas influence predictions.

CRP works by filtering relevance messages during the backward pass so that only activations aligned with a target concept vector receive attribution. This produces a concept sensitivity map that localizes where and how strongly a concept was encoded across the network's layers, enabling fine-grained auditing of a model's internal reasoning beyond simple input-feature heatmaps.

Concept Relevance Propagation

Key Features of CRP

Concept Relevance Propagation (CRP) extends traditional Layer-wise Relevance Propagation (LRP) to explain neural network decisions not just by input features, but by tracing relevance through latent concepts encoded in hidden layers.

01

Latent Concept Relevance Tracing

CRP decomposes a model's prediction by propagating relevance scores backward through the network while conditioning on specific latent concepts. Unlike standard LRP, which stops at input features, CRP reveals how high-level abstractions—such as 'stripes' or 'wheels'—contribute to the final decision. This is achieved by masking or filtering relevance flows to isolate the contribution of a target concept's subspace within a layer's activation space.

02

Conditional Heatmaps

A core output of CRP is the conditional heatmap, which visualizes the relevance attributed to input features only through a specified concept. For example, a heatmap conditioned on the concept 'dog snout' shows which pixels contributed to the 'dog' classification specifically because they encode snout-related information. This provides a finer-grained explanation than unconditional saliency maps by disentangling overlapping concepts.

03

Layer-wise Concept Filtering

CRP introduces a filtering mechanism during the backward pass. At a chosen layer, the relevance signal is projected onto the subspace of a concept vector (e.g., a CAV) before continuing propagation. This ensures that only relevance that flowed through that concept's encoding is attributed to the input. The technique supports both single-concept and multi-concept conditioning for composite explanations.

04

Concept Attribution Quantification

Beyond visualizations, CRP provides a scalar attribution score for each concept relative to a prediction. By summing the conditioned relevance at the input level, practitioners can rank which latent concepts were most influential. This bridges the gap between qualitative heatmaps and quantitative concept importance metrics, enabling rigorous auditing of a model's internal reasoning pathways.

05

Disentangling Composite Decisions

CRP excels at disentangling composite decisions where multiple concepts jointly influence a prediction. For instance, in classifying a 'zebra,' CRP can separately attribute relevance through the 'stripes' concept and the 'horse-like shape' concept. This decomposition reveals whether the model relies on spurious correlations or robust, domain-aligned features for its output.

06

Integration with Concept Activation Vectors

CRP is designed to work synergistically with Concept Activation Vectors (CAVs) and TCAV. While TCAV measures global sensitivity to a concept, CRP localizes that sensitivity to individual inputs and pixels. The concept vectors learned via CAV methods define the subspaces used for CRP's conditional relevance filtering, creating a unified pipeline for concept-based explainability from global auditing to local instance-level interpretation.

CONCEPT RELEVANCE PROPAGATION

Frequently Asked Questions

Explore the core mechanisms and applications of Concept Relevance Propagation, the technique for tracing how high-level semantic concepts influence a neural network's final decision.

Concept Relevance Propagation (CRP) is a local explainability method that extends Layer-wise Relevance Propagation (LRP) to decompose a neural network's decision not just by input features, but through the lens of high-level, human-understandable concepts encoded in its latent space. CRP works by first identifying a concept's direction in a specific layer's activation space, often using a Concept Activation Vector (CAV). It then backpropagates the model's output relevance score through the network using LRP rules, but critically, it filters the relevance flow at the target layer. It isolates only the relevance that passes through the subspace aligned with the concept vector, thereby quantifying exactly how much that specific concept contributed to the final prediction. This provides a complete, end-to-end attribution path from a semantic concept down to the input features that formed it.

METHODOLOGICAL COMPARISON

CRP vs. Other Concept-Based Explainability Methods

A feature-level comparison of Concept Relevance Propagation against TCAV, ConceptSHAP, and Concept Bottleneck Models for latent concept attribution.

FeatureCRPTCAVConceptSHAPCBM

Attribution Granularity

Neuron-level heatmaps with concept filtering

Global sensitivity score per concept

Shapley value per concept

Concept score prediction

Relevance Flow Tracing

Requires Predefined Concepts

Spatial Localization in Input

Causal Intervention Support

Layer-wise Decomposition

Computational Overhead

Moderate (backward pass per sample)

Low (directional derivatives)

High (Shapley sampling)

Low (single forward pass)

Post-hoc Applicability

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.