arXiv AI

OperatorSHAP: Fast and Accurate Shapley Value Estimation for Neural Operators

arXiv:2606. 28065v1 Announce Type: cross Abstract: Understanding model predictions is essential for physical applications, where outputs often inform safety-critical decisions, such as structural load assessment, weather warnings, and clinical diagnosis.

arXiv AI
Sep 16

A unified framework for global and local interpretability using adaptive derivative-ordered random explanation

The paper introduces Adaptive Derivative-Ordered Random Explanation (ADORE), a unified framework that uses first- and second-order derivatives to capture nonlinear feature interactions and feature-sample dynamics. ADORE combines global feature importance with local sample contributions, quantifying both magnitude and direction of feature impact while identifying critical samples. It achieves computational efficiency via randomized SVD and dynamic sparsity detection, outperforming LIME and SHAP across tabular, text, and image data, and is released as an open-source Python package on GitHub.

By Lemen Chao, Ming Lei, Anran Fanga
arXiv AI
Jul 13

All you need is SAMPAT

arXiv:2607. 09235v1 Announce Type: cross Abstract: The current state of the art in AI/ML rests on deep neural architectures, which, in general, suffer from a lack of interpretability.

By Jayadeva, Madhur Aswani
arXiv Machine Learning
Sep 14

DynSHAP: Towards Explainable Dynamic Survival Analysis

DynSHAP is a SHAP-based framework designed for dynamic survival analysis, extending marginal SHAP estimators to handle time–feature pairs as players in the Shapley game. It introduces Temporal DynSHAP, which models linear dependencies across time and uses conditional sampling to improve explanations. Experiments on synthetic data and two real-world clinical datasets show that Temporal DynSHAP more accurately recovers temporally dependent features and provides faithful attributions for two DSA architectures, enabling medical experts to identify which patient information influenced predictions and when.

By Nastasya Anokhina, Jonas J\"ur{\ss}, Pietro Li\`o
arXiv Machine Learning
Aug 24

Shared Physics Responses Recover Hidden Rankings in Neural Operator Libraries

The paper introduces a method for selecting the best neural‑operator model during deployment without needing high‑fidelity reference solutions. By using a squared Hilbert‑space loss, the authors show that ranking a finite library of models depends only on the low‑dimensional span of candidate differences, enabling simultaneous scoring of all models with a single anchor‑based linearized response of the governing equation. This shared physical diagnostic accurately recovered over 99.6% of pairwise preferences and 99.0% of optimal checkpoints across diverse Fourier and convolutional operator libraries for fluid, reaction‑diffusion, and wave dynamics, and often outperformed the best individual candidates.

By Hanbing Liang, Fujun Liu