Owen-based Semantics and Hierarchy-Aware Explanation (O-Shap)

• URL: http://arxiv.org/abs/2602.17107v1
• Date: Thu, 19 Feb 2026 06:06:12 GMT
• Title: Owen-based Semantics and Hierarchy-Aware Explanation (O-Shap)
• Authors: Xiangyu Zhou, Chenhan Xiao, Yang Weng,
• Abstract summary: In vision tasks, features often exhibit strong spatial and semantic dependencies.<n>Modern SHAP implementations now include the Owen value, a hierarchical generalization of the Shapley value that supports group attributions.<n>We show that the Owen value preserves the foundations of Shapley values, but its effectiveness critically depends on how feature groups are defined.<n>We propose a new segmentation approach that satisfies the $T$-property to ensure semantic alignment across hierarchy levels.
• Score: 6.096130289291087
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Shapley value-based methods have become foundational in explainable artificial intelligence (XAI), offering theoretically grounded feature attributions through cooperative game theory. However, in practice, particularly in vision tasks, the assumption of feature independence breaks down, as features (i.e., pixels) often exhibit strong spatial and semantic dependencies. To address this, modern SHAP implementations now include the Owen value, a hierarchical generalization of the Shapley value that supports group attributions. While the Owen value preserves the foundations of Shapley values, its effectiveness critically depends on how feature groups are defined. We show that commonly used segmentations (e.g., axis-aligned or SLIC) violate key consistency properties, and propose a new segmentation approach that satisfies the $T$-property to ensure semantic alignment across hierarchy levels. This hierarchy enables computational pruning while improving attribution accuracy and interpretability. Experiments on image and tabular datasets demonstrate that O-Shap outperforms baseline SHAP variants in attribution precision, semantic coherence, and runtime efficiency, especially when structure matters.

Related papers

• Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression [55.51959317490934]
  Large language models (LLMs) have demonstrated promising capabilities in Text-Attributed Graph (TAG) understanding.<n>We argue that graphs inherently contain rich structural and semantic information, and that their effective exploitation can unlock potential gains in LLMs reasoning performance.<n>We propose Homophily-aware Structural and Semantic Compression for LLMs (HS2C), a framework centered on exploiting graph homophily.
  arXiv  Detail & Related papers  (2026-01-13T03:35:18Z)
• MAESTRO: Meta-learning Adaptive Estimation of Scalarization Trade-offs for Reward Optimization [56.074760766965085]
  Group-Relative Policy Optimization has emerged as an efficient paradigm for aligning Large Language Models (LLMs)<n>We propose MAESTRO, which treats reward scalarization as a dynamic latent policy, leveraging the model's terminal hidden states as a semantic bottleneck.<n>We formulate this as a contextual bandit problem within a bi-level optimization framework, where a lightweight Conductor network co-evolves with the policy by utilizing group-relative advantages as a meta-reward signal.
  arXiv  Detail & Related papers  (2026-01-12T05:02:48Z)
• Bridging the Semantic Gap for Categorical Data Clustering via Large Language Models [64.58262227709842]
  ARISE (Attention-weighted Representation with Integrated Semantic Embeddings) is presented.<n>It builds semantic-aware representations that complement the metric space of categorical data for accurate clustering.<n>Experiments on eight benchmark datasets demonstrate consistent improvements over seven representative counterparts.
  arXiv  Detail & Related papers  (2026-01-03T11:37:46Z)
• No-rank Tensor Decomposition Using Metric Learning [0.0]
  This paper introduces a no-rank tensor decomposition framework grounded in metric learning.<n>We provide theoretical guarantees for the framework's convergence and establish bounds on its metric properties.<n>Our approach achieves superior performance with smaller training datasets compared to transformer-based methods.
  arXiv  Detail & Related papers  (2025-11-03T18:21:53Z)
• Beyond Shapley Values: Cooperative Games for the Interpretation of Machine Learning Models [0.3749861135832073]
  We revisit cooperative game theory from an interpretability perspective and argue for a broader and more principled use of its tools.<n>We highlight two general families of efficient allocations, the Weber and Harsanyi sets, that extend beyond Shapley values.<n>We present an accessible overview of these allocation schemes, clarify the distinction between value functions and aggregation rules, and introduce a three-step blueprint for constructing reliable and theoretically-grounded feature attributions.
  arXiv  Detail & Related papers  (2025-06-16T18:22:23Z)
• Learning and Evaluating Hierarchical Feature Representations [3.770103075126785]
  We propose a novel framework, Hierarchical Composition of Orthogonal Subspaces (Hier-COS)<n>Hier-COS learns to map deep feature embeddings into a vector space that is, by design, consistent with the structure of a given taxonomy tree.<n>We demonstrate that Hier-COS achieves state-of-the-art hierarchical performance across all the datasets while simultaneously beating top-1 accuracy in all but one case.
  arXiv  Detail & Related papers  (2025-03-10T20:59:41Z)
• From Abstract to Actionable: Pairwise Shapley Values for Explainable AI [0.8192907805418583]
  We propose Pairwise Shapley Values, a novel framework that grounds feature attributions in explicit, human-relatable comparisons.<n>Our method introduces pairwise reference selection combined with single-value imputation to deliver intuitive, model-agnostic explanations.<n>We demonstrate that Pairwise Shapley Values enhance interpretability across diverse regression and classification scenarios.
  arXiv  Detail & Related papers  (2025-02-18T04:20:18Z)
• Structural Entropy Guided Probabilistic Coding [52.01765333755793]
  We propose a novel structural entropy-guided probabilistic coding model, named SEPC.<n>We incorporate the relationship between latent variables into the optimization by proposing a structural entropy regularization loss.<n> Experimental results across 12 natural language understanding tasks, including both classification and regression tasks, demonstrate the superior performance of SEPC.
  arXiv  Detail & Related papers  (2024-12-12T00:37:53Z)
• A Refreshed Similarity-based Upsampler for Direct High-Ratio Feature Upsampling [54.05517338122698]
  A popular similarity-based feature upsampling pipeline has been proposed, which utilizes a high-resolution feature as guidance.<n>We propose an explicitly controllable query-key feature alignment from both semantic-aware and detail-aware perspectives.<n>We develop a fine-grained neighbor selection strategy on HR features, which is simple yet effective for alleviating mosaic artifacts.
  arXiv  Detail & Related papers  (2024-07-02T14:12:21Z)
• Counterfactual Shapley Additive Explanations [6.916452769334367]
  We propose a variant of SHAP, CoSHAP, that uses counterfactual generation techniques to produce a background dataset. We motivate the need within the actionable recourse setting for careful consideration of background datasets when using Shapley values for feature attributions.
  arXiv  Detail & Related papers  (2021-10-27T08:44:53Z)
• Spatial and Semantic Consistency Regularizations for Pedestrian Attribute Recognition [50.932864767867365]
  We propose a framework that consists of two complementary regularizations to achieve spatial and semantic consistency for each attribute. Based on the precise attribute locations, we propose a semantic consistency regularization to extract intrinsic and discriminative semantic features. Results show that the proposed method performs favorably against state-of-the-art methods without increasing parameters.
  arXiv  Detail & Related papers  (2021-09-13T03:36:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.