{"list":"other","total":62,"rows":[{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52096},{"id":"1705.07874","title":"A Unified Approach to Interpreting Model Predictions","created":"2017-05-22","cited_by_count":6555},{"id":"1708.07747","title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","created":"2017-08-25","cited_by_count":4349},{"id":"1606.08415","title":"Gaussian Error Linear Units (GELUs)","created":"2016-06-27","cited_by_count":3502},{"id":"1702.01135","title":"Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks","created":"2017-02-03","cited_by_count":744},{"id":"1811.00866","title":"Efficient Neural Network Robustness Certification with General Activation Functions","created":"2018-11-02","cited_by_count":445},{"id":"1911.02508","title":"Fooling LIME and SHAP: Adversarial Attacks on Post hoc Explanation Methods","created":"2019-11-06","cited_by_count":443},{"id":"1908.08474","title":"The many Shapley values for model explanation","created":"2019-08-22","cited_by_count":344},{"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":"2002.11097","title":"Problems with Shapley-value-based explanations as feature importance measures","created":"2020-02-25","cited_by_count":200},{"id":"2011.13824","title":"Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers","created":"2020-11-27","cited_by_count":187},{"id":"1804.10829","title":"Formal Security Analysis of Neural Networks using Symbolic Intervals","created":"2018-04-28","cited_by_count":185},{"id":"1809.08098","title":"Efficient Formal Safety Analysis of Neural Networks","created":"2018-09-19","cited_by_count":165},{"id":"1811.10656","title":"Abduction-Based Explanations for Machine Learning Models","created":"2018-11-26","cited_by_count":160},{"id":"2012.01536","title":"Improving KernelSHAP: Practical Shapley Value Estimation via Linear Regression","created":"2020-12-02","cited_by_count":154},{"id":"1909.06588","title":"Branch and Bound for Piecewise Linear Neural Network Verification","created":"2019-09-14","cited_by_count":138},{"id":"1903.10992","title":"Explaining Deep Neural Networks with a Polynomial Time Algorithm for Shapley Values Approximation","created":"2019-03-26","cited_by_count":115},{"id":"2104.12199","title":"Sampling Permutations for Shapley Value Estimation","created":"2021-04-25","cited_by_count":102},{"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":"2205.00263","title":"Complete Verification via Multi-Neuron Relaxation Guided Branch-and-Bound","created":"2022-04-30","cited_by_count":92},{"id":"2209.04012","title":"From Shapley Values to Generalized Additive Models and back","created":"2022-09-08","cited_by_count":60},{"id":"2102.10936","title":"Shapley values for feature selection: The good, the bad, and the axioms","created":"2021-02-22","cited_by_count":54},{"id":"2105.03640","title":"On Guaranteed Optimal Robust Explanations for NLP Models","created":"2021-05-08","cited_by_count":54},{"id":"2303.01179","title":"SHAP-IQ: Unified Approximation of any-order Shapley Interactions","created":"2023-03-02","cited_by_count":51},{"id":"2007.10868","title":"Scaling Polyhedral Neural Network Verification on GPUs","created":"2020-07-20","cited_by_count":43},{"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":"2306.05724","title":"Explaining Predictive Uncertainty with Information Theoretic Shapley Values","created":"2023-06-09","cited_by_count":36},{"id":"2501.00200","title":"Scalable Neural Network Verification with Branch-and-bound Inferred Cutting Planes","created":"2024-12-31","cited_by_count":33},{"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":"2110.09167","title":"RKHS-SHAP: Shapley Values for Kernel Methods","created":"2021-10-18","cited_by_count":30},{"id":"1911.11888","title":"Explaining Models by Propagating Shapley Values of Local Components","created":"2019-11-27","cited_by_count":29},{"id":"2109.09847","title":"Fast TreeSHAP: Accelerating SHAP Value Computation for Trees","created":"2021-09-20","cited_by_count":29},{"id":"2302.01404","title":"Provably Bounding Neural Network Preimages","created":"2023-02-02","cited_by_count":29},{"id":"2106.14648","title":"On Locality of Local Explanation Models","created":"2021-06-24","cited_by_count":25},{"id":"2410.01917","title":"Provably Accurate Shapley Value Estimation via Leverage Score Sampling","created":"2024-10-02","cited_by_count":23},{"id":"2405.10852","title":"KernelSHAP-IQ: Weighted Least-Square Optimization for Shapley Interactions","created":"2024-05-17","cited_by_count":22},{"id":"2405.08297","title":"Distance-Restricted Explanations: Theoretical Underpinnings & Efficient Implementation","created":"2024-05-14","cited_by_count":21},{"id":"2305.15167","title":"Explaining the Uncertain: Stochastic Shapley Values for Gaussian Process Models","created":"2023-05-24","cited_by_count":19},{"id":"2506.11849","title":"Regression-adjusted Monte Carlo Estimators for Shapley Values and Probabilistic Values","created":"2025-06-13","cited_by_count":19},{"id":"2304.01811","title":"HarsanyiNet: Computing Accurate Shapley Values in a Single Forward Propagation","created":"2023-04-04","cited_by_count":17},{"id":"2401.13371","title":"SVARM-IQ: Efficient Approximation of Any-order Shapley Interactions through Stratification","created":"2024-01-24","cited_by_count":16},{"id":"2010.13972","title":"GPUTreeShap: Massively Parallel Exact Calculation of SHAP Scores for Tree Ensembles","created":"2020-10-27","cited_by_count":14},{"id":"2209.08192","title":"Linear TreeShap","created":"2022-09-16","cited_by_count":13},{"id":"2501.16944","title":"Exact Computation of Any-Order Shapley Interactions for Graph Neural Networks","created":"2025-01-28","cited_by_count":13},{"id":"2506.08505","title":"Explaining, Fast and Slow: Abstraction and Refinement of Provable Explanations","created":"2025-06-10","cited_by_count":13},{"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":"2602.16823","title":"Formal Mechanistic Interpretability: Automated Circuit Discovery with Provable Guarantees","created":"2026-02-18","cited_by_count":11},{"id":"2310.03131","title":"Axiomatic Aggregations of Abductive Explanations","created":"2023-09-29","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":"2512.11087","title":"Clip-and-Verify: Linear Constraint-Driven Domain Clipping for Accelerating Neural Network Verification","created":"2025-12-11","cited_by_count":9},{"id":"2510.21599","title":"SHAP Meets Tensor Networks: Provably Tractable Explanations with Parallelism","created":"2025-10-24","cited_by_count":8},{"id":"2508.05430","title":"Explaining Similarity in Vision-Language Encoders with Weighted Banzhaf Interactions","created":"2025-08-07","cited_by_count":6},{"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":"2405.17556","title":"Solving Probabilistic Verification Problems of Neural Networks using Branch and Bound","created":"2024-05-27","cited_by_count":4},{"id":"2501.02356","title":"When is the Computation of a Feature Attribution Method Tractable?","created":"2025-01-04","cited_by_count":2},{"id":"2510.22138","title":"Tractable Shapley Values and Interactions via Tensor Networks","created":"2025-10-25","cited_by_count":2}],"next_cursor":null}