mlsanityData to 14 Oct 2026

Demystifying the Accuracy-Interpretability Trade-Off: A Case Study of Inferring Ratings from Reviews

arXiv 2503.07914 ↗First posted 10 Mar 2025cs.AI cs.CL cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Interpretable machine learning models offer understandable reasoning behind their decision-making process, though they may not always match the performance of their black-box counterparts. This trade-off between interpretability and model performance has sparked discussions around the deployment of AI, particularly in critical applications where knowing the rationale of decision-making is essential for trust and accountability. In this study, we conduct a comparative analysis of several black-box and interpretable models, focusing on a specific NLP use case that has received limited attention: inferring ratings from reviews. Through this use case, we explore the intricate relationship between the performance and interpretability of different models. We introduce a quantitative score called Composite Interpretability (CI) to help visualize the trade-off between interpretability and performance, particularly in the case of composite models. Our results indicate that, in general, the learning performance improves as interpretability decreases, but this relationship is not strictly monotonic, and there are instances where interpretable models are more advantageous.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 8 of its 28 references that are in the map. First posted on arXiv 10 Mar 2025.

Builds on

8 of 28 references.

References · 8

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,070
  3. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
  4. 2017Towards A Rigorous Science of Interpretable Machine Learningcited by 1,416
  5. 2015Interpretable classifiers using rules and Bayesian analysis: Building a better stroke prediction modelcited by 140
  6. 2022Robust Counterfactual Explanations for Tree-Based Ensemblescited by 49
  7. 2023Robust Counterfactual Explanations for Neural Networks With Probabilistic Guaranteescited by 45
  8. 2021A Survey on the Robustness of Feature Importance and Counterfactual Explanationscited by 39

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 3.

5 papers.