arXivDaily arXiv每日学术速递 周一至周五更新
​通知:联邦节假日调休:哥伦布日 / 原住民日(Columbus Day / Indigenous Peoples' Day),今日(13日)无更新。
arXiv 2004.13876cs.CL

The Explanation Game: Towards Prediction Explainability through Sparse Communication

Instituto de Telecomunicações(电信研究所);Instituto Superior Técnico(里斯本高等理工学院);University of Lisbon(里斯本大学);LUMLIS (Lisbon ELLIS Unit)(里斯本ELLIS单元(LUMLIS));Unbabel(Unbabel(公司名));Instituto Superior Técnico & Unbabel(里斯本高等理工学院和Unbabel)

Marcos V. Treviso, André F. T. Martins

英文摘要:

Explainability is a topic of growing importance in NLP. In this work, we provide a unified perspective of explainability as a communication problem between an explainer and a layperson about a classifier's decision. We use this framework to compare several prior approaches for extracting explanations, including gradient methods, representation erasure, and attention mechanisms, in terms of their communication success. In addition, we reinterpret these methods at the light of classical feature selection, and we use this as inspiration to propose new embedded methods for explainability, through the use of selective, sparse attention. Experiments in text classification, natural language entailment, and machine translation, using different configurations of explainers and laypeople (including both machines and humans), reveal an advantage of attention-based explainers over gradient and erasure methods. Furthermore, human evaluation experiments show promising results with post-hoc explainers trained to optimize communication success and faithfulness.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑