paper-with-me

Papers

Disentangled and Self-Explainable Node Representation Learning

2024-10-28 · Simone Piaggesi, André Panisson, Megha Khosla

Node representations, or embeddings, are low-dimensional vectors that capture node properties, typically learned through unsupervised structural similarity objectives or supervised tasks. While recent efforts have focused on explaining graph model decisions, the interpretability of unsupervised node embeddings remains underexplored. To bridge this gap, we introduce DiSeNE (Disentangled and Self-Explainable Node Embedding), a framework that generates self-explainable embeddings in an unsupervised manner. Our method employs disentangled representation learning to produce dimension-wise interpretable embeddings, where each dimension is aligned with distinct topological structure of the graph. We formalize novel desiderata for disentangled and interpretable embeddings, which drive our new objective functions, optimizing simultaneously for both interpretability and disentanglement. Additionally, we propose several new metrics to evaluate representation quality and human interpretability. Extensive experiments across multiple benchmark datasets demonstrate the effectiveness of our approach.

📄 PDF Abstract BibTeX arXiv:2410.21043

Code (1)

simonepiaggesi/disene 공식 구현 pytorch

Tasks

DisentanglementRepresentation Learning

Similar Papers 제목 키워드 기반

Contrastive Disentangled Learning on Graph for Node Classification

2023-06-20 · Xiaojuan Zhang, Jun Fu, Shuang Li

Contrastive learning methods have attracted considerable attention due to their remarkable success in analyzing graph-structured data. Inspired by the success of contrastive learning, we propose a novel framework for con…

ClassificationContrastive LearningDisentanglementNode Classification+1

Learning Disentangled Representations in Signed Directed Graphs without Social Assumptions

2023-07-06 · Geonwoo Ko, Jinhong Jung

Signed graphs are complex systems that represent trust relationships or preferences in various domains. Learning node representations in such graphs is crucial for many mining tasks. Although real-world signed relationsh…

DecoderDisentanglement

Disentangled-Transformer: An Explainable End-to-End Automatic Speech Recognition Model with Speech Content-Context Separation

2024-11-26 · Pu Wang, Hugo Van hamme

End-to-end transformer-based automatic speech recognition (ASR) systems often capture multiple speech traits in their learned representations that are highly entangled, leading to a lack of interpretability. In this stud…

Automatic Speech RecognitionAutomatic Speech Recognition (ASR)speaker-diarizationSpeaker Diarization+2

SES: Bridging the Gap Between Explainability and Prediction of Graph Neural Networks

2024-07-16 · Zhenhua Huang, Kunhao Li, Shaojie Wang, Zhaohong Jia 외

Despite the Graph Neural Networks' (GNNs) proficiency in analyzing graph data, achieving high-accuracy and interpretable predictions remains challenging. Existing GNN interpreters typically provide post-hoc explanations …

Contrastive LearningGraph Neural NetworkTriplet

Independence Promoted Graph Disentangled Networks

2019-11-26 · Yanbei Liu, Xiao Wang, Shu Wu, Zhitao Xiao

We address the problem of disentangled representation learning with independent latent factors in graph convolutional networks (GCNs). The current methods usually learn node representation by describing its neighborhood …

ClusteringGraph ClassificationGraph ClusteringRepresentation Learning