arXiv:2603. 14014v2 Announce Type: replace Abstract: We introduce Aumann-SHAP, an interaction-aware framework that decomposes counterfactual transitions by restricting the model to a local hypercube connecting baseline and counterfactual features.
arXiv:2510. 22138v3 Announce Type: replace Abstract: We show how to replace the O(2^n) coalition enumeration over n features behind Shapley values and Shapley-style interaction indices with a few-evaluation scheme on a tensor-network (TN) surrogate: TN-SHAP.
QuadraSHAP is a method for computing ε-exact Shapley values in product games, where coalition values factor across players. It replaces the exponential coalition sum with a one-dimensional polynomial integral, using Gauss–Legendre quadrature to achieve exact values when ε = 0 and provides a computable error bound for ε > 0. The approach supports weighted sums of product games, enabling baseline and empirical interventional attribution for models such as log-link regression, Cox models, odds-scale classifiers, product-kernel machines, and tree-based models, and achieves logarithmic parallel time with efficient GPU evaluation even for hundreds of thousands of features.
arXiv:2608. 06422v1 Announce Type: new Abstract: Giving an LLM judge more compute does not necessarily make it check more requirements.
arXiv:2606. 07560v1 Announce Type: cross Abstract: Function-vector (FV) heads (Todd et al.
arXiv:2605. 11404v2 Announce Type: replace Abstract: Large language models (LLMs) can simulate human-like reasoning and decision-making in individual agents.
arXiv:2608. 11508v1 Announce Type: new Abstract: Machine learning pipelines commonly flatten relational data into single-table representations, discarding structural constraints.
arXiv:2306. 02704v2 Announce Type: replace-cross Abstract: We introduce \emph{Calibrated Stackelberg Games (CSGs)}, a generalization of the standard Stackelberg Games (SGs) framework.
arXiv:2408. 01382v3 Announce Type: replace Abstract: Originating in game theory, Shapley values are widely used for explaining a machine learning model's prediction by quantifying the contribution of each feature's value to the prediction.
arXiv:2607. 16999v1 Announce Type: cross Abstract: The Credit Assignment Problem (CAP) is fundamental to developing efficient and explainable Reinforcement Learning (RL) agents.
arXiv:2607. 20201v1 Announce Type: cross Abstract: Additive models buy interpretability by forbidding feature interactions, a constraint that neural instantiations enforce architecturally.
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:2604. 04535v2 Announce Type: replace Abstract: Modern machine learning systems, such as generative models and recommendation systems, often evolve through a cycle of deployment, user interaction, and periodic model updates.