arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.00652cs.CLcs.LG

An Information Bottleneck Approach for Controlling Conciseness in Rationale Extraction

Allen School of Computer Science & Engineering, University of Washington(华盛顿大学艾伦计算机科学与工程学院);Allen Institute of Artificial Intelligence(艾伦人工智能研究所)

Bhargavi Paranjape, Mandar Joshi, John Thickstun, Hannaneh Hajishirzi, Luke Zettlemoyer

英文摘要:

Decisions of complex language understanding models can be rationalized by limiting their inputs to a relevant subsequence of the original text. A rationale should be as concise as possible without significantly degrading task performance, but this balance can be difficult to achieve in practice. In this paper, we show that it is possible to better manage this trade-off by optimizing a bound on the Information Bottleneck (IB) objective. Our fully unsupervised approach jointly learns an explainer that predicts sparse binary masks over sentences, and an end-task predictor that considers only the extracted rationale. Using IB, we derive a learning objective that allows direct control of mask sparsity levels through a tunable sparse prior. Experiments on ERASER benchmark tasks demonstrate significant gains over norm-minimization techniques for both task performance and agreement with human rationales. Furthermore, we find that in the semi-supervised setting, a modest amount of gold rationales (25% of training examples) closes the gap with a model that uses the full input.

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

↑