{"list":"other","total":105,"rows":[{"id":"1705.07874","title":"A Unified Approach to Interpreting Model Predictions","created":"2017-05-22","cited_by_count":6555},{"id":"2203.00667","title":"Generative Adversarial Networks","created":"2022-03-01","cited_by_count":5627},{"id":"1602.04938","title":"\"Why Should I Trust You?\": Explaining the Predictions of Any Classifier","created":"2016-02-16","cited_by_count":5070},{"id":"1312.6034","title":"Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Maps","created":"2013-12-20","cited_by_count":2371},{"id":"1706.07269","title":"Explanation in Artificial Intelligence: Insights from the Social Sciences","created":"2017-06-22","cited_by_count":1206},{"id":"1810.03292","title":"Sanity Checks for Saliency Maps","created":"2018-10-08","cited_by_count":1156},{"id":"1802.01933","title":"A Survey Of Methods For Explaining Black Box Models","created":"2018-02-06","cited_by_count":973},{"id":"1702.01135","title":"Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks","created":"2017-02-03","cited_by_count":744},{"id":"1911.02508","title":"Fooling LIME and SHAP: Adversarial Attacks on Post hoc Explanation Methods","created":"2019-11-06","cited_by_count":443},{"id":"1907.07374","title":"A Survey on Explainable Artificial Intelligence (XAI): Towards Medical XAI","created":"2019-07-17","cited_by_count":404},{"id":"2103.11251","title":"Interpretable Machine Learning: Fundamental Principles and 10 Grand Challenges","created":"2021-03-20","cited_by_count":367},{"id":"1706.07979","title":"Methods for Interpreting and Understanding Deep Neural Networks","created":"2017-06-24","cited_by_count":345},{"id":"1606.08813","title":"European Union regulations on algorithmic decision-making and a \"right to explanation\"","created":"2016-06-28","cited_by_count":344},{"id":"1711.00867","title":"The (Un)reliability of saliency methods","created":"2017-11-02","cited_by_count":333},{"id":"1809.06514","title":"Actionable Recourse in Linear Classification","created":"2018-09-18","cited_by_count":328},{"id":"2002.06278","title":"Algorithmic Recourse: from Counterfactual Explanations to Interventions","created":"2020-02-14","cited_by_count":250},{"id":"1711.09784","title":"Distilling a Neural Network Into a Soft Decision Tree","created":"2017-11-27","cited_by_count":236},{"id":"1903.06758","title":"Algorithms for Verifying Deep Neural Networks","created":"2019-03-15","cited_by_count":221},{"id":"1811.10656","title":"Abduction-Based Explanations for Machine Learning Models","created":"2018-11-26","cited_by_count":160},{"id":"2202.01602","title":"The Disagreement Problem in Explainable Machine Learning: A Practitioner's Perspective","created":"2022-02-03","cited_by_count":159},{"id":"1805.03364","title":"A Symbolic Approach to Explaining Bayesian Network Classifiers","created":"2018-05-09","cited_by_count":131},{"id":"2004.14545","title":"Explainable Deep Learning: A Field Guide for the Uninitiated","created":"2020-04-30","cited_by_count":127},{"id":"2010.04050","title":"A survey of algorithmic recourse: definitions, formulations, solutions, and prospects","created":"2020-10-08","cited_by_count":118},{"id":"1911.06473","title":"\"How do I fool you?\": Manipulating User Trust via Misleading Black Box Explanations","created":"2019-11-15","cited_by_count":111},{"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":"2011.08512","title":"Preventing Repeated Real World AI Failures by Cataloging Incidents: The AI Incident Database","created":"2020-11-17","cited_by_count":96},{"id":"1912.09818","title":"When Explanations Lie: Why Many Modified BP Attributions Fail","created":"2019-12-20","cited_by_count":92},{"id":"2009.08634","title":"On the Tractability of SHAP Explanations","created":"2020-09-18","cited_by_count":92},{"id":"1908.01755","title":"On the Existence of Simpler Machine Learning Models","created":"2019-08-05","cited_by_count":89},{"id":"2010.12265","title":"Model Interpretability through the Lens of Computational Complexity","created":"2020-10-23","cited_by_count":75},{"id":"2007.08024","title":"A Survey on Computational Propaganda Detection","created":"2020-07-15","cited_by_count":70},{"id":"1709.06680","title":"Deep Lattice Networks and Partial Monotonic Functions","created":"2017-09-19","cited_by_count":63},{"id":"2007.12652","title":"MurTree: Optimal Classification Trees via Dynamic Programming and Search","created":"2020-07-24","cited_by_count":63},{"id":"1411.5899","title":"Falling Rule Lists","created":"2014-11-21","cited_by_count":59},{"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":"2011.10219","title":"Certified Monotonic Neural Networks","created":"2020-11-20","cited_by_count":51},{"id":"1704.01701","title":"Learning Certifiably Optimal Rule Lists for Categorical Data","created":"2017-04-06","cited_by_count":50},{"id":"2010.11034","title":"On Explaining Decision Trees","created":"2020-10-21","cited_by_count":49},{"id":"1705.08504","title":"Interpreting Blackbox Models via Model Extraction","created":"2017-05-23","cited_by_count":44},{"id":"2002.11697","title":"The Emerging Landscape of Explainable AI Planning and Decision Making","created":"2020-02-26","cited_by_count":44},{"id":"2205.09971","title":"On Tackling Explanation Redundancy in Decision Trees","created":"2022-05-20","cited_by_count":44},{"id":"1706.09773","title":"Interpretability via Model Extraction","created":"2017-06-29","cited_by_count":40},{"id":"1709.10256","title":"Explainable Planning","created":"2017-09-29","cited_by_count":40},{"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":"1910.02065","title":"Can I Trust the Explainer? Verifying Post-hoc Explanatory Methods","created":"2019-10-04","cited_by_count":38},{"id":"2106.01350","title":"On Efficiently Explaining Graph-Based Classifiers","created":"2021-06-02","cited_by_count":37},{"id":"1606.08514","title":"Towards Verified Artificial Intelligence","created":"2016-06-27","cited_by_count":36},{"id":"2207.12213","title":"On Computing Probabilistic Explanations for Decision Trees","created":"2022-06-30","cited_by_count":35},{"id":"2004.02082","title":"On Tractable Representations of Binary Neural Networks","created":"2020-04-05","cited_by_count":34},{"id":"2006.08852","title":"Counterexample-Guided Learning of Monotonic Neural Networks","created":"2020-06-16","cited_by_count":34},{"id":"1907.02509","title":"On Validating, Repairing and Refining Heuristic ML Explanations","created":"2019-07-04","cited_by_count":32},{"id":"2002.01080","title":"Bridging the Gap: Providing Post-Hoc Symbolic Explanations for Sequential Decision-Making Problems with Inscrutable Representations","created":"2020-02-04","cited_by_count":32},{"id":"2108.05276","title":"Trading Complexity for Sparsity in Random Forest Explanations","created":"2021-08-11","cited_by_count":32},{"id":"2111.01576","title":"Provably efficient, succinct, and precise explanations","created":"2021-11-01","cited_by_count":32},{"id":"2110.02376","title":"Foundations of Symbolic Languages for Model Interpretability","created":"2021-10-05","cited_by_count":26},{"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":"2012.10438","title":"Efficient Training of Robust Decision Trees Against Adversarial Examples","created":"2020-12-18","cited_by_count":24},{"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":"2210.05846","title":"FasterRisk: Fast and Accurate Interpretable Risk Scores","created":"2022-10-12","cited_by_count":21},{"id":"2007.15140","title":"Computing Optimal Decision Sets with SAT","created":"2020-07-29","cited_by_count":16},{"id":"2103.15575","title":"Contrastive Explanations of Plans Through Model Restrictions","created":"2021-03-29","cited_by_count":16},{"id":"2106.02605","title":"A Holistic Approach to Interpretability in Financial Lending: Models, Visualizations, and Summary-Explanations","created":"2021-06-04","cited_by_count":16},{"id":"2108.09876","title":"On Quantifying Literals in Boolean Logic and Its Applications to Explainable AI","created":"2021-08-23","cited_by_count":16},{"id":"2004.08599","title":"Three Modern Roles for Logic in AI","created":"2020-04-18","cited_by_count":15},{"id":"1812.01843","title":"MLIC: A MaxSAT-Based framework for learning interpretable classification rules","created":"2018-12-05","cited_by_count":14},{"id":"2206.07635","title":"AI Ethics Issues in Real World: Evidence from AI Incident Database","created":"2022-06-15","cited_by_count":14},{"id":"2209.12185","title":"Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs","created":"2022-09-25","cited_by_count":14},{"id":"2009.06921","title":"Optimal Decision Trees for Nonlinear Metrics","created":"2020-09-15","cited_by_count":13},{"id":"1907.10901","title":"How to Manipulate CNNs to Make Them Lie: the GradCAM Case","created":"2019-07-25","cited_by_count":12},{"id":"2106.00546","title":"Efficient Explanations With Relevant Sets","created":"2021-06-01","cited_by_count":12},{"id":"2102.09005","title":"An Efficient Diagnosis Algorithm for Inconsistent Constraint Sets","created":"2021-02-17","cited_by_count":11},{"id":"2109.03857","title":"Robust Optimal Classification Trees Against Adversarial Examples","created":"2021-09-08","cited_by_count":11},{"id":"1710.02572","title":"An Optimization Approach to Learning Falling Rule Lists","created":"2017-10-06","cited_by_count":10},{"id":"2107.01654","title":"Efficient Explanations for Knowledge Compilation Languages","created":"2021-07-04","cited_by_count":10},{"id":"2206.09787","title":"Progress in Mathematical Programming Solvers from 2001 to 2020","created":"2022-06-20","cited_by_count":10},{"id":"2001.05207","title":"A Formal Approach to Explainability","created":"2020-01-15","cited_by_count":9},{"id":"1708.00400","title":"Recursive Online Enumeration of All Minimal Unsatisfiable Subsets","created":"2017-08-01","cited_by_count":8},{"id":"2001.01891","title":"IMLI: An Incremental Framework for MaxSAT-Based Learning of Interpretable Classification Rules","created":"2020-01-07","cited_by_count":8},{"id":"2006.06343","title":"A framework for step-wise explaining how to solve constraint satisfaction problems","created":"2020-06-11","cited_by_count":8},{"id":"2205.09569","title":"Provably Precise, Succinct and Efficient Explanations for Decision Trees","created":"2022-05-19","cited_by_count":8},{"id":"2102.01904","title":"A Scalable Two Stage Approach to Computing Optimal Decision Sets","created":"2021-02-03","cited_by_count":7},{"id":"2202.06913","title":"FOLD-RM: A Scalable, Efficient, and Explainable Inductive Learning Algorithm for Multi-Category Classification of Mixed Data","created":"2022-02-14","cited_by_count":7},{"id":"2207.07072","title":"A Query-Optimal Algorithm for Finding Counterfactuals","created":"2022-07-14","cited_by_count":7},{"id":"1604.08229","title":"Propositional Abduction with Implicit Hitting Sets","created":"2016-04-27","cited_by_count":6},{"id":"2104.12582","title":"Understanding and Avoiding AI Failures: A Practical Guide","created":"2021-04-22","cited_by_count":6},{"id":"1610.06984","title":"Efficient Certified Resolution Proof Checking","created":"2016-10-22","cited_by_count":5},{"id":"2205.06936","title":"Efficient Learning of Interpretable Classification Rules","created":"2022-05-14","cited_by_count":5},{"id":"2206.09638","title":"A Symbolic Approach for Counterfactual Explanations","created":"2022-06-20","cited_by_count":5},{"id":"2207.04748","title":"On Computing Relevant Features for Explaining NBCs","created":"2022-07-11","cited_by_count":5},{"id":"2210.07161","title":"A Logic of \"Black Box\" Classifier Systems","created":"2022-10-13","cited_by_count":5},{"id":"1401.3475","title":"Prime Implicates and Prime Implicants: From Propositional to Modal Logic","created":"2014-01-15","cited_by_count":4},{"id":"1802.03292","title":"Mathematical Logic in Computer Science","created":"2018-02-07","cited_by_count":4},{"id":"2201.07736","title":"The Query Complexity of Certification","created":"2022-01-19","cited_by_count":3}],"next_cursor":"100"}