{"list":"other","total":79,"rows":[{"id":"1705.07874","title":"A Unified Approach to Interpreting Model Predictions","created":"2017-05-22","cited_by_count":6555},{"id":"1602.04938","title":"\"Why Should I Trust You?\": Explaining the Predictions of Any Classifier","created":"2016-02-16","cited_by_count":5070},{"id":"1703.01365","title":"Axiomatic Attribution for Deep Networks","created":"2017-03-04","cited_by_count":3384},{"id":"1702.01135","title":"Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks","created":"2017-02-03","cited_by_count":744},{"id":"1806.07538","title":"Towards Robust Interpretability with Self-Explaining Neural Networks","created":"2018-06-20","cited_by_count":505},{"id":"1811.00866","title":"Efficient Neural Network Robustness Certification with General Activation Functions","created":"2018-11-02","cited_by_count":445},{"id":"1810.12715","title":"On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Models","created":"2018-10-30","cited_by_count":328},{"id":"2004.13912","title":"Neural Additive Models: Interpretable Machine Learning with Neural Nets","created":"2020-04-29","cited_by_count":319},{"id":"1705.01320","title":"Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks","created":"2017-05-03","cited_by_count":242},{"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":"1906.06316","title":"Towards Stable and Efficient Training of Verifiably Robust Neural Networks","created":"2019-06-14","cited_by_count":205},{"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":"2002.09284","title":"On The Reasons Behind Decisions","created":"2020-02-21","cited_by_count":100},{"id":"2205.00263","title":"Complete Verification via Multi-Neuron Relaxation Guided Branch-and-Bound","created":"2022-04-30","cited_by_count":92},{"id":"2106.01613","title":"NODE-GAM: Neural Generalized Additive Model for Interpretable Deep Learning","created":"2021-06-03","cited_by_count":88},{"id":"2401.14461","title":"Marabou 2.0: A Versatile Formal Analyzer of Neural Networks","created":"2024-01-25","cited_by_count":81},{"id":"2103.03638","title":"PRIMA: General and Precise Neural Network Certification via Scalable Convex Hull Approximations","created":"2021-03-05","cited_by_count":77},{"id":"2010.12265","title":"Model Interpretability through the Lens of Computational Complexity","created":"2020-10-23","cited_by_count":75},{"id":"2209.04012","title":"From Shapley Values to Generalized Additive Models and back","created":"2022-09-08","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":"2205.14120","title":"Neural Basis Models for Interpretability","created":"2022-05-27","cited_by_count":56},{"id":"2105.03640","title":"On Guaranteed Optimal Robust Explanations for NLP Models","created":"2021-05-08","cited_by_count":54},{"id":"2211.00541","title":"Logic-Based Explainability in Machine Learning","created":"2022-10-24","cited_by_count":48},{"id":"2405.21063","title":"Neural Network Verification with Branch-and-Bound for General Nonlinearities","created":"2024-05-31","cited_by_count":47},{"id":"2412.19985","title":"The Fifth International Verification of Neural Networks Competition (VNN-COMP 2024): Summary and Results","created":"2024-12-28","cited_by_count":43},{"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":"2106.00154","title":"Explanations for Monotonic Classifiers","created":"2021-06-01","cited_by_count":39},{"id":"2202.07728","title":"Don't Lie to Me! Robust and Efficient Explainability with Verified Perturbation Analysis","created":"2022-02-15","cited_by_count":38},{"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":"2501.00200","title":"Scalable Neural Network Verification with Branch-and-bound Inferred Cutting Planes","created":"2024-12-31","cited_by_count":33},{"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":"2302.01404","title":"Provably Bounding Neural Network Preimages","created":"2023-02-02","cited_by_count":29},{"id":"2108.13179","title":"Reachability Is NP-Complete Even for the Simplest Neural Networks","created":"2021-08-30","cited_by_count":27},{"id":"2512.19007","title":"The 6th International Verification of Neural Networks Competition (VNN-COMP 2025): Summary and Results","created":"2025-12-22","cited_by_count":27},{"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":"2202.12482","title":"Sparse Neural Additive Model: Interpretable Deep Learning with Feature Selection via Group Sparsity","created":"2022-02-25","cited_by_count":25},{"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":"2406.01317","title":"The Interpretable and Effective Graph Neural Additive Networks","created":"2024-06-03","cited_by_count":20},{"id":"2202.11389","title":"Fast Sparse Classification for Generalized Linear and Additive Models","created":"2022-02-23","cited_by_count":19},{"id":"2301.11862","title":"Neural Additive Models for Location Scale and Shape: A Framework for Interpretable Neural Regression Beyond the Mean","created":"2023-01-27","cited_by_count":18},{"id":"2305.16905","title":"Improving Neural Additive Models with Bayesian Principles","created":"2023-05-26","cited_by_count":15},{"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":"2506.06665","title":"SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming","created":"2025-06-07","cited_by_count":12},{"id":"2402.12518","title":"Gaussian Process Neural Additive Models","created":"2024-02-19","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":"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":"2502.14177","title":"InstaSHAP: Interpretable Additive Models Explain Shapley Values Instantly","created":"2025-02-20","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":"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":"2303.09234","title":"NAISR: A 3D Neural Additive Model for Interpretable Shape Representation","created":"2023-03-16","cited_by_count":7},{"id":"2310.16316","title":"Sum-of-Parts: Self-Attributing Neural Networks with End-to-End Learning of Feature Groups","created":"2023-10-25","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":"2511.16588","title":"Formal Abductive Latent Explanations for Prototype-Based Networks","created":"2025-11-20","cited_by_count":5},{"id":"2511.22498","title":"Space Explanations of Neural Network Classification","created":"2025-11-27","cited_by_count":5},{"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":"2009.04942","title":"Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers","created":"2020-09-10","cited_by_count":3},{"id":"2510.21292","title":"Additive Models Explained: A Computational Complexity Approach","created":"2025-10-24","cited_by_count":3}],"next_cursor":null}