Complex classifiers may exhibit “embarassing” failures in cases where humans can easily provide a justified classification. Avoiding such failures is obviously of key importance. In this work, we focus on one such setting, where a label is perfectly predictable if the input contains certain features, or rules, and otherwise it is predictable by a linear classifier. We define a hypothesis class that captures this notion and determine its sample complexity. We also give evidence that efficient algorithms cannot achieve this sample complexity. We then derive a simple and efficient algorithm and show that its sample complexity is close to optimal, among efficient algorithms. Experiments on synthetic and sentiment analysis data demonstrate the efficacy of the method, both in terms of accuracy and interpretability.
|Original language||American English|
|State||Published - 2020|
|Event||22nd International Conference on Artificial Intelligence and Statistics, AISTATS 2019 - Naha, Japan|
Duration: 16 Apr 2019 → 18 Apr 2019
|Conference||22nd International Conference on Artificial Intelligence and Statistics, AISTATS 2019|
|Period||16/04/19 → 18/04/19|
Bibliographical notePublisher Copyright:
© 2019 by the author(s).