Layer-wise Relevance Propagation (LRP) is a post-hoc explainability technique that decomposes a deep neural network's output prediction into relevance scores for each input feature. It operates by redistributing the model's output score backwards through the network's topology using a set of local conservation rules, ensuring that the total relevance is preserved from one layer to the next.
Glossary
Layer-wise Relevance Propagation (LRP)

What is Layer-wise Relevance Propagation (LRP)?
A technique for decomposing the prediction of a deep neural network by backpropagating relevance scores from the output layer to the input features, ensuring conservation across layers.
Unlike simple gradient-based methods, LRP utilizes specific propagation rules, such as the alpha-beta rule or epsilon rule, to handle non-linear activations and filter out noise. This produces a high-resolution heatmap or attribution map, making it particularly effective for explaining complex architectures like convolutional neural networks in domains requiring precise, auditable justifications for automated decisions.
Core Properties of LRP
Layer-wise Relevance Propagation (LRP) is governed by a strict set of axiomatic properties that ensure the decomposition of a deep network's prediction is faithful, conservative, and human-interpretable. These rules distinguish LRP from gradient-based saliency methods, making it suitable for auditing high-stakes financial fraud models.
Conservation of Relevance
The total amount of relevance is preserved as it is propagated backwards from the output layer to the input layer. The sum of the relevance scores assigned to all input features must equal the model's output score for the target class.
- Sum Rule: $\sum_i R_i^{(l)} = f(x)$ for every layer $l$
- Prevents relevance from being artificially created or destroyed during the backward pass
- Ensures the explanation is a true decomposition of the prediction, not just a sensitivity analysis
- Critical for fraud auditing: the exact score that triggered a block is fully accounted for
Positive Relevance Flow
LRP rules can be designed to propagate only positive relevance, suppressing negative contributions that would otherwise create contradictory, noisy explanations. This is achieved through the $z^+$-rule and LRP-$\alpha_1\beta_0$ propagation.
- Filters out inhibitory or contradictory signals that obscure the primary evidence
- Produces cleaner, sparser heatmaps that highlight only supporting features
- In fraud detection: isolates the transaction attributes that positively contributed to a 'fraudulent' classification
- Contrasts with simple gradient methods that mix positive and negative evidence
Deep Taylor Decomposition
LRP can be mathematically derived as a series of Taylor expansions applied at each layer, where the relevance of a neuron is redistributed to its inputs based on their contribution to the neuron's activation. This provides a first-order, local explanation.
- Each redistribution step approximates the function of a single layer
- Provides a theoretical foundation for why LRP works, beyond heuristic rules
- Connects LRP to the broader family of additive feature attribution methods
- Enables the derivation of optimal propagation rules for specific layer types (e.g., ReLU, Tanh)
Layer-Specific Propagation Rules
LRP is not a single algorithm but a framework of composable rules tailored to different layer types. The LRP-$\epsilon$ rule absorbs weak or contradictory relevance, while the LRP-$\gamma$ rule favors positive contributions.
- $z^+$-rule: For ReLU layers, redistributes relevance proportionally to positive weighted activations
- $\epsilon$-rule: Adds a small stabilizing term to the denominator to absorb noise; higher $\epsilon$ produces sparser explanations
- Flat rule: For input layers, distributes relevance uniformly to pixel space
- In fraud models: different rules are applied to dense, convolutional, and embedding layers for optimal clarity
Contrastive Explanations
LRP can decompose not just the raw prediction score, but a contrastive quantity: the difference between the score for the predicted class and the score for a competing class. This explains why the model chose class A over class B.
- Decomposes $f_{fraud}(x) - f_{legit}(x)$ instead of just $f_{fraud}(x)$
- Highlights features that are uniquely indicative of fraud versus legitimate transactions
- Eliminates common-mode features that are present in both classes
- Provides a sharper, more actionable signal for fraud investigators reviewing blocked transactions
Computational Tractability
A single LRP backward pass has a computational cost comparable to a standard forward pass, making it feasible for near-real-time explanation generation in production fraud pipelines.
- Complexity scales linearly with network depth and width
- No sampling, perturbation, or optimization steps required (unlike LIME or SHAP)
- Can be accelerated with batch processing for multiple transactions simultaneously
- Enables inline explanation generation within the real-time fraud scoring pipeline without introducing prohibitive latency
Frequently Asked Questions
Explore the mechanics, applications, and regulatory implications of Layer-wise Relevance Propagation, a foundational technique for auditing deep neural networks in high-stakes financial environments.
Layer-wise Relevance Propagation (LRP) is a post-hoc explainability technique specifically designed for deep neural networks. It works by taking the model's output score for a specific class—such as 'fraudulent transaction'—and decomposing it backwards through the network's layers using a local conservation principle. This principle ensures that the total relevance received by a neuron is fully redistributed to its inputs in the preceding layer. By applying specific propagation rules (like the LRP-ε or LRP-α1β0 rules), the algorithm avoids discontinuities and noisy gradients, ultimately assigning a relevance score to each input feature. The result is a heatmap or feature relevance vector that precisely identifies which input variables contributed most to the final anomaly score, providing a granular, mathematically grounded audit trail for compliance officers.
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
LRP vs. Other Explainability Techniques
A technical comparison of Layer-wise Relevance Propagation against other prominent feature attribution methods used for auditing deep neural network decisions in financial fraud detection.
| Feature | LRP | SHAP | Integrated Gradients |
|---|---|---|---|
Conservation Property | |||
Layer-wise Decomposition | |||
Computational Cost (relative) | Medium | High | Medium |
Model Architecture Agnostic | |||
Requires Baseline Input | |||
Average Inference Latency Overhead | 15-30ms | 2-5s | 20-40ms |
Native Support for Deep Networks | |||
Regulatory Audit Readiness | High | Medium | Medium |
Related Terms
Explore the foundational concepts and complementary techniques that contextualize Layer-wise Relevance Propagation within the broader landscape of algorithmic explainability and model governance for financial fraud detection.
DeepLIFT (Deep Learning Important FeaTures)
A direct predecessor to LRP that also decomposes a neural network's output prediction by backpropagating contribution scores. DeepLIFT compares the activation of each neuron to a reference activation rather than using a zero baseline, which helps avoid discontinuities in the gradient. This method is crucial for fraud models where a 'neutral' transaction baseline is needed to explain why a specific transaction was flagged as anomalous.
Saliency Maps
A foundational visualization technique that computes the gradient of the model's output with respect to the input features. While saliency maps highlight which features most influence a classification, they often produce noisy, visually diffuse explanations. LRP improves upon this by applying conservation rules during backpropagation, providing sharper, more robust feature attributions for fraud analysts reviewing high-dimensional transaction vectors.
Integrated Gradients
A model-specific attribution method that computes feature contributions by integrating gradients along a path from a baseline input to the actual input. Unlike LRP's layer-by-layer redistribution, Integrated Gradients satisfies the completeness axiom (output equals sum of attributions). For fraud models, this provides a rigorous mathematical guarantee that the explanation fully accounts for the anomaly score, which is critical for regulatory audit trails.
SHAP (SHapley Additive exPlanations)
A game-theoretic framework that unifies several explanation methods, including LRP, under a common mathematical foundation. SHAP values assign each feature an importance score based on its marginal contribution across all possible feature coalitions. While computationally heavier than LRP for deep networks, SHAP provides a model-agnostic standard that compliance teams often prefer for comparing explanations across different fraud detection architectures.
Adverse Action Reason Codes
Regulatory-mandated explanations required when a model's output leads to a negative decision, such as blocking a legitimate transaction. While LRP provides a continuous heatmap of feature relevance, reason codes distill this into the top 3-4 human-readable factors. For fraud operations, LRP attributions must be translated into these concise, auditable codes to satisfy regulations like the Fair Credit Reporting Act (FCRA).
Algorithmic Audit Trail
A comprehensive, chronological record of all data, model parameters, and logic used for a specific decision. LRP contributes to this trail by providing a deterministic, reproducible decomposition of the model's reasoning for each flagged transaction. This allows auditors to trace exactly which input features—such as transaction amount, location, or device fingerprint—drove the anomaly score, ensuring full traceability for regulatory review.

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.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us