{"list":"other","total":84,"rows":[{"id":"1705.07874","title":"A Unified Approach to Interpreting Model Predictions","created":"2017-05-22","cited_by_count":6555},{"id":"2304.14997","title":"Towards Automated Circuit Discovery for Mechanistic Interpretability","created":"2023-04-28","cited_by_count":724},{"id":"1907.00503","title":"Modeling Tabular data using Conditional GAN","created":"2019-07-01","cited_by_count":699},{"id":"1905.07697","title":"Explaining Machine Learning Classifiers through Diverse Counterfactual Explanations","created":"2019-05-19","cited_by_count":614},{"id":"1806.07538","title":"Towards Robust Interpretability with Self-Explaining Neural Networks","created":"2018-06-20","cited_by_count":505},{"id":"1802.07623","title":"Explanations based on the Missing: Towards Contrastive Explanations with Pertinent Negatives","created":"2018-02-21","cited_by_count":262},{"id":"2103.06624","title":"Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Robustness Verification","created":"2021-03-11","cited_by_count":228},{"id":"2002.11097","title":"Problems with Shapley-value-based explanations as feature importance measures","created":"2020-02-25","cited_by_count":200},{"id":"2010.10596","title":"Counterfactual Explanations and Algorithmic Recourses for Machine Learning: A Review","created":"2020-10-20","cited_by_count":174},{"id":"1811.10656","title":"Abduction-Based Explanations for Machine Learning Models","created":"2018-11-26","cited_by_count":160},{"id":"2204.09934","title":"FastDiff: A Fast Conditional Diffusion Model for High-Quality Speech Synthesis","created":"2022-04-21","cited_by_count":136},{"id":"1805.03364","title":"A Symbolic Approach to Explaining Bayesian Network Classifiers","created":"2018-05-09","cited_by_count":131},{"id":"2002.09284","title":"On The Reasons Behind Decisions","created":"2020-02-21","cited_by_count":100},{"id":"2009.08634","title":"On the Tractability of SHAP Explanations","created":"2020-09-18","cited_by_count":92},{"id":"2202.10419","title":"Interpreting Language Models with Contrastive Explanations","created":"2022-02-21","cited_by_count":92},{"id":"2401.14461","title":"Marabou 2.0: A Versatile Formal Analyzer of Neural Networks","created":"2024-01-25","cited_by_count":81},{"id":"2212.11870","title":"Impossibility Theorems for Feature Attribution","created":"2022-12-22","cited_by_count":78},{"id":"2010.12265","title":"Model Interpretability through the Lens of Computational Complexity","created":"2020-10-23","cited_by_count":75},{"id":"2103.01378","title":"Contrastive Explanations for Model Interpretability","created":"2021-03-02","cited_by_count":75},{"id":"2009.06399","title":"On Generating Plausible Counterfactual and Semi-Factual Explanations for Deep Learning","created":"2020-09-10","cited_by_count":60},{"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":"2202.00734","title":"Framework for Evaluating Faithfulness of Local Explanations","created":"2022-02-01","cited_by_count":55},{"id":"2105.03640","title":"On Guaranteed Optimal Robust Explanations for NLP Models","created":"2021-05-08","cited_by_count":54},{"id":"2210.13915","title":"Towards Formal XAI: Formally Approximate Minimal Explanations of Neural Networks","created":"2022-10-25","cited_by_count":42},{"id":"1311.2106","title":"Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints","created":"2013-11-08","cited_by_count":41},{"id":"2104.06172","title":"On the Computational Intelligibility of Boolean Classifiers","created":"2021-04-13","cited_by_count":40},{"id":"2110.03187","title":"On the Optimal Memorization Power of ReLU Neural Networks","created":"2021-10-07","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":"2104.08015","title":"On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results","created":"2021-04-16","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":"1810.03805","title":"What made you do this? Understanding black-box decisions with sufficient input subsets","created":"2018-10-09","cited_by_count":31},{"id":"2212.01051","title":"VeriX: Towards Verified Explainability of Deep Neural Networks","created":"2022-12-02","cited_by_count":30},{"id":"2003.08907","title":"Overinterpretation reveals image classification model pathologies","created":"2020-03-19","cited_by_count":28},{"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":"1812.00099","title":"Understanding Unequal Gender Classification Accuracy from Face Images","created":"2018-11-30","cited_by_count":25},{"id":"2105.10118","title":"Probabilistic Sufficient Explanations","created":"2021-05-21","cited_by_count":24},{"id":"2308.00143","title":"Formally Explaining Neural Networks within Reactive Systems","created":"2023-07-31","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":"2209.07740","title":"Computing Abductive Explanations for Boosted Trees","created":"2022-09-16","cited_by_count":23},{"id":"2305.05172","title":"Logic for Explainable AI","created":"2023-05-09","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":"2205.15834","title":"Attribution-based Explanations that Provide Recourse Cannot be Robust","created":"2022-05-31","cited_by_count":20},{"id":"2205.03302","title":"Necessity and Sufficiency for Explaining Text Classifiers: A Case Study in Hate Speech Detection","created":"2022-05-06","cited_by_count":18},{"id":"2212.05990","title":"On Computing Probabilistic Abductive Explanations","created":"2022-12-12","cited_by_count":18},{"id":"2410.08025","title":"The Computational Complexity of Circuit Discovery for Inner Interpretability","created":"2024-10-10","cited_by_count":15},{"id":"2307.05902","title":"Stability Guarantees for Feature Attributions with Multiplicative Smoothing","created":"2023-07-12","cited_by_count":14},{"id":"2506.08505","title":"Explaining, Fast and Slow: Abstraction and Refinement of Provable Explanations","created":"2025-06-10","cited_by_count":13},{"id":"2502.03391","title":"Explain Yourself, Briefly! Self-Explaining Neural Networks with Concise Sufficient Reasons","created":"2025-02-05","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":"2408.03915","title":"Hard to Explain: On the Computational Hardness of In-Distribution Model Interpretation","created":"2024-08-07","cited_by_count":11},{"id":"2502.02719","title":"Beyond Topological Self-Explainable GNNs: A Formal Explainability Perspective","created":"2025-02-04","cited_by_count":11},{"id":"2602.16823","title":"Formal Mechanistic Interpretability: Automated Circuit Discovery with Provable Guarantees","created":"2026-02-18","cited_by_count":11},{"id":"2405.02936","title":"On the Tractability of SHAP Explanations under Markovian Distributions","created":"2024-05-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":"2504.13787","title":"Probabilistic Stability Guarantees for Feature Attributions","created":"2025-04-18","cited_by_count":9},{"id":"2506.08216","title":"What makes an Ensemble (Un) Interpretable?","created":"2025-06-09","cited_by_count":9},{"id":"2205.09901","title":"Cardinality-Minimal Explanations for Monotonic Neural Networks","created":"2022-05-19","cited_by_count":8},{"id":"2306.00497","title":"The Risks of Recourse in Binary Classification","created":"2023-06-01","cited_by_count":8},{"id":"2407.13281","title":"Auditing Local Explanations is Hard","created":"2024-07-18","cited_by_count":8},{"id":"2510.21599","title":"SHAP Meets Tensor Networks: Provably Tractable Explanations with Parallelism","created":"2025-10-24","cited_by_count":8},{"id":"2207.07072","title":"A Query-Optimal Algorithm for Finding Counterfactuals","created":"2022-07-14","cited_by_count":7},{"id":"2205.13789","title":"A Sea of Words: An In-Depth Analysis of Anchors for Text Data","created":"2022-05-27","cited_by_count":6},{"id":"2309.14558","title":"Bicriteria Approximation Algorithms for the Submodular Cover Problem","created":"2023-09-25","cited_by_count":6},{"id":"2312.11831","title":"Locally-Minimal Probabilistic Explanations","created":"2023-12-19","cited_by_count":6},{"id":"2503.18067","title":"Self-Explaining Neural Networks for Business Process Monitoring","created":"2025-03-23","cited_by_count":5},{"id":"2208.09643","title":"The computational complexity of some explainable clustering problems","created":"2022-08-20","cited_by_count":4},{"id":"2209.01403","title":"Explainability via Short Formulas: the Case of Propositional Logic with Implementation","created":"2022-09-03","cited_by_count":4},{"id":"2401.10938","title":"Even-if Explanations: Formal Foundations, Priorities and Complexity","created":"2024-01-17","cited_by_count":4},{"id":"2506.15499","title":"Pixel-level Certified Explanations via Randomized Smoothing","created":"2025-06-18","cited_by_count":4},{"id":"2512.00164","title":"Faster Verified Explanations for Neural Networks","created":"2025-11-28","cited_by_count":4},{"id":"2304.02781","title":"Inapproximability of sufficient reasons for decision trees","created":"2023-04-05","cited_by_count":3},{"id":"2407.15780","title":"Explaining Decisions in ML Models: a Parameterized Complexity Analysis","created":"2024-07-22","cited_by_count":3},{"id":"2501.06766","title":"On the Complexity of Global Necessary Reasons to Explain Classification","created":"2025-01-12","cited_by_count":3},{"id":"2507.08454","title":"Why this and not that? A Logic-based Framework for Contrastive Explanations","created":"2025-07-11","cited_by_count":3},{"id":"2510.21292","title":"Additive Models Explained: A Computational Complexity Approach","created":"2025-10-24","cited_by_count":3},{"id":"2602.04028","title":"Axiomatic Foundations of Counterfactual Explanations","created":"2026-02-03","cited_by_count":1},{"id":"2602.17530","title":"Provably Explaining Neural Additive Models","created":"2026-02-19","cited_by_count":1}],"next_cursor":null}