TACENR: Task-Agnostic Contrastive Explanations for Node Representations

• URL: http://arxiv.org/abs/2604.19372v1
• Date: Tue, 21 Apr 2026 11:54:29 GMT
• Title: TACENR: Task-Agnostic Contrastive Explanations for Node Representations
• Abstract summary: Graph representation learning has achieved notable success in encoding graph-structured data into latent vector spaces.<n>Existing explainability methods primarily focus on supervised settings or on explaining individual representation dimensions.<n>We propose TACENR (Task-Agnostic Contrastive Explanations for Node Representations), a local explanation method that identifies not only attribute features but also proximity and structural ones.
• Score: 2.311721393808569
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Graph representation learning has achieved notable success in encoding graph-structured data into latent vector spaces, enabling a wide range of downstream tasks. However, these node representations remain opaque and difficult to interpret. Existing explainability methods primarily focus on supervised settings or on explaining individual representation dimensions, leaving a critical gap in explaining the overall structure of node representations. In this paper, we propose TACENR (Task-Agnostic Contrastive Explanations for Node Representations), a local explanation method that identifies not only attribute features but also proximity and structural ones that contribute the most in the representation space. TACENR builds on contrastive learning, through which we learn a similarity function in the representation space, revealing which are the features that play an important role in the representation of a node. While our focus is on task-agnostic explanations, TACENR can be applied to supervised scenarios as well. Experimental results demonstrate that proximity and structural features play a significant role in shaping node representations and that our supervised variant performs comparably to existing task-specific approaches in identifying the most impactful features.

Related papers

• Beyond Task-Driven Features for Object Detection [2.5700571547896103]
  This paper introduces an annotation-guided feature augmentation framework that injects embeddings into an object detection backbone.<n> Experiments across wildlife and remote sensing datasets evaluate classification, localization, and data efficiency under multiple supervision regimes.
  arXiv  Detail & Related papers  (2026-04-04T19:34:13Z)
• Enhancing Structured Meaning Representations with Aspect Classification [3.923094828887562]
  We introduce a new dataset of English sentences annotated with Uniform Meaning Representation (UMR) aspect labels.<n>We describe the annotation scheme and guidelines used to label eventive predicates according to the UMR aspect lattice.<n>Our results establish initial benchmarks for automatic UMR aspect prediction and provide a foundation for integrating aspect into semantic meaning representations.
  arXiv  Detail & Related papers  (2026-03-25T20:10:43Z)
• "Principal Components" Enable A New Language of Images [79.45806370905775]
  We introduce a novel visual tokenization framework that embeds a provable PCA-like structure into the latent token space.<n>Our approach achieves state-of-the-art reconstruction performance and enables better interpretability to align with the human vision system.
  arXiv  Detail & Related papers  (2025-03-11T17:59:41Z)
• Situational Scene Graph for Structured Human-centric Situation Understanding [15.91717913059569]
  We propose a graph-based representation called Situational Scene Graph (SSG) to encode both humanobject-relationships and the corresponding semantic properties.<n>The semantic details are represented as predefined roles and values inspired by situation frame, which is originally designed to represent a single action.<n>We will release the code and the dataset soon.
  arXiv  Detail & Related papers  (2024-10-30T09:11:25Z)
• Structure-CLIP: Towards Scene Graph Knowledge to Enhance Multi-modal Structured Representations [70.41385310930846]
  We present an end-to-end framework Structure-CLIP to enhance multi-modal structured representations. We use scene graphs to guide the construction of semantic negative examples, which results in an increased emphasis on learning structured representations. A Knowledge-Enhance (KEE) is proposed to leverage SGK as input to further enhance structured representations.
  arXiv  Detail & Related papers  (2023-05-06T03:57:05Z)
• Self-Supervised Node Representation Learning via Node-to-Neighbourhood Alignment [10.879056662671802]
  Self-supervised node representation learning aims to learn node representations from unlabelled graphs that rival the supervised counterparts. In this work, we present simple-yet-effective self-supervised node representation learning via aligning the hidden representations of nodes and their neighbourhood. We learn node representations that achieve promising node classification performance on a set of graph-structured datasets from small- to large-scale.
  arXiv  Detail & Related papers  (2023-02-09T13:21:18Z)
• GLANCE: Global to Local Architecture-Neutral Concept-based Explanations [26.76139301708958]
  We propose a novel twin-surrogate explainability framework to explain the decisions made by any CNN-based image classifier. We first disentangle latent features from the classifier, followed by aligning these features to observed/human-defined context' features. These aligned features form semantically meaningful concepts that are used for extracting a causal graph depicting the perceived' data-generating process. We provide a generator to visualize the effect' of interactions among features in latent space and draw feature importance therefrom as local explanations.
  arXiv  Detail & Related papers  (2022-07-05T09:52:09Z)
• Learning Task-relevant Representations for Generalization via Characteristic Functions of Reward Sequence Distributions [63.773813221460614]
  Generalization across different environments with the same tasks is critical for successful applications of visual reinforcement learning. We propose a novel approach, namely Characteristic Reward Sequence Prediction (CRESP), to extract the task-relevant information. Experiments demonstrate that CRESP significantly improves the performance of generalization on unseen environments.
  arXiv  Detail & Related papers  (2022-05-20T14:52:03Z)
• Exploring Set Similarity for Dense Self-supervised Representation Learning [96.35286140203407]
  We propose to explore textbfset textbfsimilarity (SetSim) for dense self-supervised representation learning. We generalize pixel-wise similarity learning to set-wise one to improve the robustness because sets contain more semantic and structure information. Specifically, by resorting to attentional features of views, we establish corresponding sets, thus filtering out noisy backgrounds that may cause incorrect correspondences.
  arXiv  Detail & Related papers  (2021-07-19T09:38:27Z)
• Learning the Implicit Semantic Representation on Graph-Structured Data [57.670106959061634]
  Existing representation learning methods in graph convolutional networks are mainly designed by describing the neighborhood of each node as a perceptual whole. We propose a Semantic Graph Convolutional Networks (SGCN) that explores the implicit semantics by learning latent semantic-paths in graphs.
  arXiv  Detail & Related papers  (2021-01-16T16:18:43Z)
• Towards Efficient Scene Understanding via Squeeze Reasoning [71.1139549949694]
  We propose a novel framework called Squeeze Reasoning. Instead of propagating information on the spatial map, we first learn to squeeze the input feature into a channel-wise global vector. We show that our approach can be modularized as an end-to-end trained block and can be easily plugged into existing networks.
  arXiv  Detail & Related papers  (2020-11-06T12:17:01Z)

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.