Relevance-based Infilling for Natural Language Counterfactuals

被引:0
|
作者
Betti, Lorenzo [1 ,2 ]
Abrate, Carlo [3 ,4 ]
Bonchi, Francesco [3 ,5 ]
Kaltenbrunner, Andreas [1 ,6 ]
机构
[1] ISI Fdn, Turin, Italy
[2] Cent European Univ, Dept Network & Data Sci, Vienna, Austria
[3] CENTAI, Turin, Italy
[4] Sapienza Univ, Rome, Italy
[5] Eurecat, Barcelona, Spain
[6] Univ Oberta Catalunya, Barcelona, Spain
来源
PROCEEDINGS OF THE 32ND ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2023 | 2023年
关键词
NLP; masked language model; explainability; counterfactuals;
D O I
10.1145/3583780.3615029
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Counterfactual explanations are a natural way for humans to gain understanding and trust in the outcomes of complex machine learning algorithms. In the context of natural language processing, generating counterfactuals is particularly challenging as it requires the generated text to be fluent, grammatically correct, and meaningful. In this study, we improve the current state of the art for the generation of such counterfactual explanations for text classifiers. Our approach, named RELITC (Relevance-based Infilling for Textual Counterfactuals), builds on the idea of masking a fraction of text tokens based on their importance in a given prediction task and employs a novel strategy, based on the entropy of their associated probability distributions, to determine the infilling order of these tokens. Our method uses less time than competing methods to generate counterfactuals that require less changes, are closer to the original text and preserve its content better, while being competitive in terms of fluency. We demonstrate the effectiveness of the method on four different datasets and show the quality of its outcomes in a comparison with human generated counterfactuals.(1)
引用
收藏
页码:88 / 98
页数:11
相关论文
共 50 条
  • [41] Relevance-based label distribution feature selection via convex optimization
    Qian, Wenbin
    Ye, Qianzhi
    Li, Yihui
    Huang, Jintao
    Dai, Shiming
    INFORMATION SCIENCES, 2022, 607 : 322 - 345
  • [42] Relevance-based processing: Little role for task-relevant expectations
    Adam Tapal
    Yaffa Yeshurun
    Baruch Eitam
    Psychonomic Bulletin & Review, 2019, 26 : 1426 - 1432
  • [43] Relevance-based quantization of scattering features for unsupervised mining of environmental audio
    Vincent Lostanlen
    Grégoire Lafay
    Joakim Andén
    Mathieu Lagrange
    EURASIP Journal on Audio, Speech, and Music Processing, 2018
  • [44] Relevance-based processing: Little role for task-relevant expectations
    Tapal, Adam
    Yeshurun, Yaffa
    Eitam, Baruch
    PSYCHONOMIC BULLETIN & REVIEW, 2019, 26 (04) : 1426 - 1432
  • [45] Relevance-based teaching techniques: An overview of options and assessment of one technique
    Fitzpatrick, Jacki
    Kostina-Ritchey, Erin
    4TH WORLD CONFERENCE ON EDUCATIONAL SCIENCES (WCES-2012), 2012, 46 : 2424 - 2433
  • [46] Relevance-based quantization of scattering features for unsupervised mining of environmental audio
    Lostanlen, Vincent
    Lafay, Gregoire
    Anden, Joakim
    Lagrange, Mathieu
    EURASIP JOURNAL ON AUDIO SPEECH AND MUSIC PROCESSING, 2018,
  • [47] Relevance-based Balanced Sink Mobility in Wireless Visual Sensor Networks
    Costa, Daniel G.
    Guedes, Luiz Affonso
    Vasques, Francisco
    Portugal, Paulo
    2014 12TH IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL INFORMATICS (INDIN), 2014, : 124 - +
  • [48] Relevance-Based Evaluation Metrics for Multi-class Imbalanced Domains
    Branco, Paula
    Torgo, Luis
    Ribeiro, Rita P.
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2017, PT I, 2017, 10234 : 698 - 710
  • [49] LPGRI: A Global Relevance-Based Link Prediction Approach for Multiplex Networks
    Wang, Chunning
    Tang, Fengqin
    Zhao, Xuejing
    MATHEMATICS, 2023, 11 (14)
  • [50] Estimation of Gene Induction Enables a Relevance-Based Ranking of Gene Sets
    Bartholome, Kilian
    Kreutz, Clemens
    Timmer, Jens
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2009, 16 (07) : 959 - 967