Generative Perturbation Analysis for Probabilistic Black-Box Anomaly Attribution

被引:0
|
作者
Ide, Tsuyoshi [1 ]
Abe, Naoki [1 ]
机构
[1] IBM Res, Thomas J Watson Res Ctr, Yorktown Hts, NY 10598 USA
关键词
explainable AI (XAI); anomaly attribution; generative model; variational inference; Shapley value; integrated gradient;
D O I
10.1145/3580305.3599365
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We address the task of probabilistic anomaly attribution in the black-box regression setting, where the goal is to compute the probability distribution of the attribution score of each input variable, given an observed anomaly. The training dataset is assumed to be unavailable. This task differs from the standard XAI (explainable AI) scenario, since we wish to explain the anomalous deviation from a black-box prediction rather than the black-box model itself. We begin by showing that mainstream model-agnostic explanation methods, such as the Shapley values, are not suitable for this task because of their "deviation-agnostic property." We then propose a novel framework for probabilistic anomaly attribution that allows us to not only compute attribution scores as the predictive mean but also quantify the uncertainty of those scores. This is done by considering a generative process for perturbations that counter-factually bring the observed anomalous observation back to normalcy. We introduce a variational Bayes algorithm for deriving the distributions of per variable attribution scores. To the best of our knowledge, this is the first probabilistic anomaly attribution framework that is free from being deviation-agnostic.
引用
收藏
页码:845 / 856
页数:12
相关论文
共 50 条
  • [1] Probabilistic Analysis of Onion Routing in a Black-box Model
    Feigenbaum, Joan
    Johnson, Aaron
    Syverson, Paul
    WPES'07: PROCEEDINGS OF THE 2007 ACM WORKSHOP ON PRIVACY IN ELECTRONIC SOCIETY, 2007, : 1 - 10
  • [2] Probabilistic Analysis of Onion Routing in a Black-Box Model
    Feigenbaum, Joan
    Johnson, Aaron
    Syverson, Paul
    ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2012, 15 (03)
  • [3] A note on an anomaly in black-box testing
    Huima, Antti
    FORMAL APPROACHES TO SOFTWARE TESTING, 2006, 3997 : 47 - 61
  • [4] Probabilistic verification for "black-box" systems
    Younes, HLS
    COMPUTER AIDED VERIFICATION< PROCEEDINGS, 2005, 3576 : 253 - 265
  • [5] Probabilistic Black-Box Reachability Checking
    Aichernig, Bernhard K.
    Tappler, Martin
    RUNTIME VERIFICATION (RV 2017), 2017, 10548 : 50 - 67
  • [6] Iterative Training Attack: A Black-Box Adversarial Attack via Perturbation Generative Network
    Lei, Hong
    Jiang, Wei
    Zhan, Jinyu
    You, Shen
    Jin, Lingxin
    Xie, Xiaona
    Chang, Zhengwei
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2023, 32 (18)
  • [7] Generative causal explanations of black-box classifiers
    O'Shaughnessy, Matthew
    Canal, Gregory
    Connor, Marissa
    Davenport, Mark
    Rozell, Christopher
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [8] Modeling Black-Box Components with Probabilistic Synthesis
    Collie, Bruce
    Woodruff, Jackson
    O'Boyle, Michael F. P.
    GPCE '2020: PROCEEDINGS OF THE 19TH ACM SIGPLAN INTERNATIONAL CONFERENCE ON GENERATIVE PROGRAMMING: CONCEPTS AND EXPERIENCES, 2020, : 1 - 14
  • [9] Black-Box Policy Search with Probabilistic Programs
    van de Meent, Jan-Willem
    Paige, Brooks
    Tolpin, David
    Wood, Frank
    ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 51, 2016, 51 : 1195 - 1204
  • [10] Probabilistic black-box reachability checking (extended version)
    Aichernig, Bernhard K.
    Tappler, Martin
    FORMAL METHODS IN SYSTEM DESIGN, 2019, 54 (03) : 416 - 448