Inferensys

Glossary

Anchors

A model-agnostic, local explanation method that provides high-precision rules, called 'anchors,' which sufficiently 'anchor' a prediction locally, meaning changes to other feature values not in the rule do not change the prediction.
Data engineer managing feature store on laptop, feature definitions visible, casual data engineering session.
HIGH-PRECISION LOCAL EXPLANATIONS

What is Anchors?

Anchors provide high-precision, model-agnostic rules that explain individual predictions by identifying the minimal set of feature conditions that 'anchor' the decision, ensuring it remains unchanged regardless of other feature values.

An Anchor is a model-agnostic, local explanation method that generates a decision rule—a set of feature predicates—such that the model's prediction is sufficiently 'anchored' locally. This means that changes to any feature values not explicitly included in the anchor rule do not alter the prediction, providing a high-precision, if-then explanation that is intuitive for compliance officers and fraud investigators to audit.

Unlike feature attribution methods like SHAP or LIME, which output importance scores, Anchors produce explicit, human-readable rules (e.g., 'If transaction_amount > $10,000 AND account_age < 30 days, then predict fraud'). The algorithm uses a multi-armed bandit formulation to efficiently search for the rule with the highest estimated precision, making it particularly valuable in financial fraud anomaly detection where clear, auditable reason codes are required for regulatory justification.

HIGH-PRECISION LOCAL EXPLANATIONS

Key Features of Anchors

Anchors provide if-then rules that guarantee a prediction remains stable regardless of changes to other features. This section breaks down the core mechanisms that make anchors uniquely suited for auditable, high-stakes fraud detection.

01

High-Precision Rule Extraction

Anchors generate rules with a user-specified precision threshold (e.g., 95%). This means the rule is statistically guaranteed to hold for the defined fraction of instances it covers. For a fraud analyst, an anchor like 'IF transaction_amount > $10,000 AND account_age_days < 30' provides a concrete, verifiable condition that anchors the model's decision, ensuring that other feature changes do not flip the prediction from fraud to legitimate.

02

Model-Agnostic Architecture

The anchor algorithm treats the underlying model as a complete black box. It operates solely by perturbing inputs and observing outputs, requiring no access to gradients, internal weights, or model structure. This makes it applicable to any classifier:

  • Gradient-boosted trees (XGBoost, LightGBM)
  • Deep neural networks
  • Ensemble methods
  • Proprietary third-party models This agnosticism is critical in financial environments where model architectures are heterogeneous and often vendor-supplied.
03

Coverage-Driven Perturbation

Anchors are constructed using a multi-armed bandit exploration strategy that efficiently searches the space of possible rules. The algorithm balances exploitation of candidate rules with high estimated precision against exploration of new feature combinations. The final output includes a coverage metric, quantifying the proportion of instances in the dataset to which the anchor applies. A high-coverage, high-precision anchor provides a broadly applicable explanation for a class of fraudulent behaviors.

04

Local Sufficiency Guarantee

Unlike global feature importance methods, an anchor provides a local sufficiency condition. The rule defines a region in the feature space where the prediction is invariant. Formally, an anchor A satisfies: P(pred(x)=pred(z) | A(z)) ≥ τ, where z is a perturbed instance and τ is the precision threshold. This probabilistic guarantee is essential for generating adverse action reason codes that regulators can audit, as the explanation is tied directly to a stable decision boundary.

05

Disentangled Feature Conditions

Anchors produce rules composed of independent feature predicates (e.g., amount > X, country = Y). This decomposition allows a fraud investigator to understand the exact combination of factors that triggered an alert. For example, an anchor might reveal that a model flags transactions not just for high velocity, but specifically for 'high velocity AND a beneficiary account in a high-risk jurisdiction AND a device fingerprint mismatch'. This granularity enables precise, targeted investigation rather than vague suspicion.

06

Integration with Counterfactual Analysis

Anchors naturally complement counterfactual explanations. While an anchor defines the conditions sufficient to maintain a prediction, a counterfactual identifies the minimal changes required to flip it. Together, they provide a complete picture: the anchor explains 'why this is fraud', and the counterfactual explains 'what would make it legitimate'. This dual approach is powerful for model debugging, revealing if a model relies on spurious correlations that can be exploited by adversaries.

LOCAL EXPLANATION METHOD COMPARISON

Anchors vs. LIME vs. SHAP

A technical comparison of three model-agnostic local explanation techniques for justifying individual fraud predictions to compliance officers and model governance leads.

FeatureAnchorsLIMESHAP

Core Mechanism

High-precision IF-THEN rules that anchor predictions locally

Local surrogate model approximating decision boundary

Game-theoretic Shapley value feature attribution

Output Format

Human-readable decision rules

Linear model coefficients or decision tree

Additive feature importance scores

Coverage Metric

Precision Guarantee

User-defined (e.g., 0.95)

No formal guarantee

No formal guarantee

Model Agnostic

Handles Categorical Features

Handles Correlated Features

Robust (perturbation-based)

Struggles (unrealistic samples)

Handles via conditional expectation

Computational Cost

Moderate (multi-armed bandit)

Low to moderate

High (exponential coalitions)

Global Interpretability

Aggregated via mean |SHAP|

Regulatory Audit Suitability

High (deterministic rules)

Moderate (surrogate fidelity varies)

High (axiomatic foundation)

ANCHOR EXPLANATIONS

Frequently Asked Questions

Clarifying the mechanics and application of anchor explanations for high-precision, rule-based interpretability in fraud detection models.

Anchor explanations are a model-agnostic, local explanation method that produces high-precision rules, called 'anchors,' which sufficiently 'anchor' a prediction locally. An anchor is an if-then rule where the condition is a set of feature predicates such that changes to any other feature values not in the rule do not change the model's prediction with high probability. The algorithm uses a multi-armed bandit formulation to efficiently search for the rule with the highest coverage—meaning it applies to the widest set of similar instances—while maintaining a user-specified precision threshold, typically 95% or higher. This makes anchors uniquely suited for auditing fraud models where a clear, deterministic rule is required to justify a blocking decision to a regulator or customer.

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.