mlsanityData to 14 Oct 2026

Framing Algorithmic Recourse for Anomaly Detection

arXiv 2206.14384 ↗First posted 29 Jun 2022cs.LG cs.AI stat.MEcited by 5

Not on the map. Why?

Abstract (arXiv)

The problem of algorithmic recourse has been explored for supervised machine learning models, to provide more interpretable, transparent and robust outcomes from decision support systems. An unexplored area is that of algorithmic recourse for anomaly detection, specifically for tabular data with only discrete feature values. Here the problem is to present a set of counterfactuals that are deemed normal by the underlying anomaly detection model so that applications can utilize this information for explanation purposes or to recommend countermeasures. We present an approach -- Context preserving Algorithmic Recourse for Anomalies in Tabular data (CARAT), that is effective, scalable, and agnostic to the underlying anomaly detection model. CARAT uses a transformer based encoder-decoder model to explain an anomaly by finding features with low likelihood. Subsequently semantically coherent counterfactuals are generated by modifying the highlighted features, using the overall context of features in the anomalous instance(s). Extensive experiments help demonstrate the efficacy of CARAT.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 30 of its 50 references that are in the map. First posted on arXiv 29 Jun 2022.

Builds on

30 of 50 references.

References · 30

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
  4. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,070
  5. 2017Billion-scale similarity search with GPUscited by 2,497
  6. 2017Learning Important Features Through Propagating Activation Differencescited by 1,458
  7. 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,089
  8. 2014Embedding Entities and Relations for Learning and Inference in Knowledge Basescited by 932
  9. 2019Explaining Machine Learning Classifiers through Diverse Counterfactual Explanationscited by 614
  10. 2020TabTransformer: Tabular Data Modeling Using Contextual Embeddingscited by 409
  11. 2018Actionable Recourse in Linear Classificationcited by 328
  12. 2018Explanations based on the Missing: Towards Contrastive Explanations with Pertinent Negativescited by 262
18 more
  1. 2020Algorithmic Recourse: from Counterfactual Explanations to Interventionscited by 250
  2. 2019InterpretML: A Unified Framework for Machine Learning Interpretabilitycited by 246
  3. 2019Model-Agnostic Counterfactual Explanations for Consequential Decisionscited by 204
  4. 2020Multi-Objective Counterfactual Explanationscited by 157
  5. 2019Learning Model-Agnostic Counterfactual Explanations for Tabular Datacited by 146
  6. 2019Preserving Causal Constraints in Counterfactual Explanations for Machine Learning Classifierscited by 144
  7. 2019Towards Realistic Individual Recourse and Actionable Explanations in Black-Box Decision Making Systemscited by 131
  8. 2020A survey of algorithmic recourse: definitions, formulations, solutions, and prospectscited by 118
  9. 2020Good Counterfactuals and Where to Find Them: A Case-Based Technique for Generating Counterfactuals for Explainable AI (XAI)cited by 79
  10. 2019GEE: A Gradient-based Explainable Variational Autoencoder for Network Anomaly Detectioncited by 36
  11. 2019CERTIFAI: Counterfactual Explanations for Robustness, Transparency, Interpretability, and Fairness of Artificial Intelligence modelscited by 34
  12. 2018Towards Explaining Anomalies: A Deep Taylor Decomposition of One-Class Modelscited by 24
  13. 2021Counterfactual Explanations as Interventions in Latent Spacecited by 18
  14. 2017Explaining Anomalies in Groups with Characterizing Subspace Rulescited by 13
  15. 2016Entity Embedding-based Anomaly Detection for Heterogeneous Categorical Eventscited by 12
  16. 2021Low-Cost Algorithmic Recourse for Users With Uncertain Cost Functionscited by 10
  17. 2020Plausible Counterfactuals: Auditing Deep Learning Classifiers with Realistic Adversarial Examplescited by 9
  18. 2019ACE -- An Anomaly Contribution Explainer for Cyber-Security Applicationscited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 1; 2024: 1; 2025: 1; 2026: 1.

5 papers.