{"list":"other","total":61,"rows":[{"id":"1705.07874","title":"A Unified Approach to Interpreting Model Predictions","created":"2017-05-22","cited_by_count":6555},{"id":"1706.07269","title":"Explanation in Artificial Intelligence: Insights from the Social Sciences","created":"2017-06-22","cited_by_count":1206},{"id":"1606.03490","title":"The Mythos of Model Interpretability","created":"2016-06-10","cited_by_count":721},{"id":"1801.01489","title":"All Models are Wrong, but Many are Useful: Learning a Variable's Importance by Studying an Entire Class of Prediction Models Simultaneously","created":"2018-01-04","cited_by_count":373},{"id":"2103.11251","title":"Interpretable Machine Learning: Fundamental Principles and 10 Grand Challenges","created":"2021-03-20","cited_by_count":367},{"id":"1811.10656","title":"Abduction-Based Explanations for Machine Learning Models","created":"2018-11-26","cited_by_count":160},{"id":"1805.03364","title":"A Symbolic Approach to Explaining Bayesian Network Classifiers","created":"2018-05-09","cited_by_count":131},{"id":"1904.12847","title":"Optimal Sparse Decision Trees","created":"2019-04-29","cited_by_count":105},{"id":"2002.09284","title":"On The Reasons Behind Decisions","created":"2020-02-21","cited_by_count":100},{"id":"2006.08690","title":"Generalized and Scalable Optimal Sparse Decision Trees","created":"2020-06-15","cited_by_count":100},{"id":"1908.01755","title":"On the Existence of Simpler Machine Learning Models","created":"2019-08-05","cited_by_count":89},{"id":"2209.08040","title":"Exploring the Whole Rashomon Set of Sparse Decision Trees","created":"2022-09-16","cited_by_count":81},{"id":"2010.12265","title":"Model Interpretability through the Lens of Computational Complexity","created":"2020-10-23","cited_by_count":75},{"id":"2007.12652","title":"MurTree: Optimal Classification Trees via Dynamic Programming and Search","created":"2020-07-24","cited_by_count":63},{"id":"2008.05803","title":"Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay","created":"2020-08-13","cited_by_count":57},{"id":"2105.10278","title":"On Explaining Random Forests with SAT","created":"2021-05-21","cited_by_count":57},{"id":"2105.03640","title":"On Guaranteed Optimal Robust Explanations for NLP Models","created":"2021-05-08","cited_by_count":54},{"id":"2010.11034","title":"On Explaining Decision Trees","created":"2020-10-21","cited_by_count":49},{"id":"2211.00541","title":"Logic-Based Explainability in Machine Learning","created":"2022-10-24","cited_by_count":48},{"id":"2205.09971","title":"On Tackling Explanation Redundancy in Decision Trees","created":"2022-05-20","cited_by_count":44},{"id":"2210.13915","title":"Towards Formal XAI: Formally Approximate Minimal Explanations of Neural Networks","created":"2022-10-25","cited_by_count":42},{"id":"2104.06172","title":"On the Computational Intelligibility of Boolean Classifiers","created":"2021-04-13","cited_by_count":40},{"id":"2105.06782","title":"SAT-Based Rigorous Explanations for Decision Lists","created":"2021-05-14","cited_by_count":40},{"id":"2106.00154","title":"Explanations for Monotonic Classifiers","created":"2021-06-01","cited_by_count":39},{"id":"2106.01350","title":"On Efficiently Explaining Graph-Based Classifiers","created":"2021-06-02","cited_by_count":37},{"id":"2207.12213","title":"On Computing Probabilistic Explanations for Decision Trees","created":"2022-06-30","cited_by_count":35},{"id":"2108.05276","title":"Trading Complexity for Sparsity in Random Forest Explanations","created":"2021-08-11","cited_by_count":32},{"id":"2212.01051","title":"VeriX: Towards Verified Explainability of Deep Neural Networks","created":"2022-12-02","cited_by_count":30},{"id":"2309.13775","title":"The Rashomon Importance Distribution: Getting RID of Unstable, Single Model-based Variable Importance","created":"2023-09-24","cited_by_count":29},{"id":"2206.11900","title":"ASTERYX : A model-Agnostic SaT-basEd appRoach for sYmbolic and score-based eXplanations","created":"2022-06-23","cited_by_count":26},{"id":"2203.10451","title":"On the Computation of Necessary and Sufficient Explanations","created":"2022-03-20","cited_by_count":23},{"id":"2206.09551","title":"Eliminating The Impossible, Whatever Remains Must Be True","created":"2022-06-20","cited_by_count":23},{"id":"2209.07740","title":"Computing Abductive Explanations for Boosted Trees","created":"2022-09-16","cited_by_count":23},{"id":"2210.15675","title":"Feature Necessity & Relevancy in ML Classifier Explanations","created":"2022-10-27","cited_by_count":23},{"id":"2305.05172","title":"Logic for Explainable AI","created":"2023-05-09","cited_by_count":23},{"id":"2307.07514","title":"Explainability is NOT a Game","created":"2023-06-27","cited_by_count":23},{"id":"2406.02981","title":"Local vs. Global Interpretability: A Computational Complexity Perspective","created":"2024-06-05","cited_by_count":23},{"id":"2405.08297","title":"Distance-Restricted Explanations: Theoretical Underpinnings & Efficient Implementation","created":"2024-05-14","cited_by_count":21},{"id":"2212.05990","title":"On Computing Probabilistic Abductive Explanations","created":"2022-12-12","cited_by_count":18},{"id":"2402.00728","title":"Dropout-Based Rashomon Set Exploration for Efficient Predictive Multiplicity Estimation","created":"2024-02-01","cited_by_count":18},{"id":"2306.15272","title":"Delivering Inflated Explanations","created":"2023-06-27","cited_by_count":16},{"id":"2105.14452","title":"A unified logical framework for explanations in classifier systems","created":"2021-05-30","cited_by_count":15},{"id":"2009.06921","title":"Optimal Decision Trees for Nonlinear Metrics","created":"2020-09-15","cited_by_count":13},{"id":"2503.01087","title":"Rashomon Sets for Prototypical-Part Networks: Editing Interpretable Models in Real-Time","created":"2025-03-03","cited_by_count":13},{"id":"2306.01744","title":"Disproving XAI Myths with Formal Methods -- Initial Results","created":"2023-05-13","cited_by_count":12},{"id":"2502.12295","title":"On the Computational Tractability of the (Many) Shapley Values","created":"2025-02-17","cited_by_count":12},{"id":"2308.11446","title":"Exploration of the Rashomon Set Assists Trustworthy Explanations for Medical Data","created":"2023-08-22","cited_by_count":11},{"id":"2408.03915","title":"Hard to Explain: On the Computational Hardness of In-Distribution Model Interpretation","created":"2024-08-07","cited_by_count":11},{"id":"2310.03131","title":"Axiomatic Aggregations of Abductive Explanations","created":"2023-09-29","cited_by_count":10},{"id":"2406.03059","title":"Efficient Exploration of the Rashomon Set of Rule Set Models","created":"2024-06-05","cited_by_count":10},{"id":"2501.06078","title":"Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations","created":"2025-01-10","cited_by_count":10},{"id":"2312.06973","title":"Anytime Approximate Formal Feature Attribution","created":"2023-12-12","cited_by_count":9},{"id":"2304.14760","title":"A New Class of Explanations for Classifiers with Non-Binary Features","created":"2023-04-28","cited_by_count":8},{"id":"2405.11766","title":"From SHAP Scores to Feature Importance Scores","created":"2024-05-20","cited_by_count":8},{"id":"2505.10991","title":"Most General Explanations of Tree Ensembles (Extended Version)","created":"2025-05-16","cited_by_count":7},{"id":"2312.11831","title":"Locally-Minimal Probabilistic Explanations","created":"2023-12-19","cited_by_count":6},{"id":"2210.07161","title":"A Logic of \"Black Box\" Classifier Systems","created":"2022-10-13","cited_by_count":5},{"id":"2305.10181","title":"Exploring the cloud of feature interaction scores in a Rashomon set","created":"2023-05-17","cited_by_count":5},{"id":"2506.14143","title":"Leveraging Predictive Equivalence in Decision Trees","created":"2025-06-17","cited_by_count":4},{"id":"2407.18482","title":"Practical Attribution Guidance for Rashomon Sets","created":"2024-07-26","cited_by_count":3},{"id":"2503.06770","title":"Unique Rashomon Sets for Robust Active Learning","created":"2025-03-09","cited_by_count":2}],"next_cursor":null}