Challenge: Existing models for explainable recommendation have neglected faithfulness of KG reasoning .
Approach: They propose to draw on interpretable logical rules to guide path-reasoning process for explanation generation.
Outcome: The proposed method delivers high-quality recommendations and ascertains the faithfulness of the derived explanation.

Similar Papers

Graph-Guided Textual Explanation Generation Framework (2025.emnlp-main)

Copied to clipboard

Challenge: Existing work has questioned their faithfulness, as they may not accurately reflect the model’s internal reasoning process regarding its predicted answer.
Approach: They propose a Graph-Guided Textual Explanation Generation framework that generates a graph neural network layer that guides the NLE generation and generates explanations with greater semantic and lexical similarity to human-written ones.
Outcome: The proposed framework improves NLE faithfulness by up to 12.12% compared to baseline methods on encoder-decoder and decoder-only models.
On Sample Based Explanation Methods for NLP: Faithfulness, Efficiency and Semantic Evaluation (2021.acl-long)

Copied to clipboard

Challenge: Existing methods for explaining "black-box" models such as Influence Functions are becoming more popular.
Approach: They propose a semantic-based evaluation metric that can better align with humans’ judgment of explanations than the widely adopted diagnostic or re-training measures.
Outcome: The proposed method can better align with humans’ judgment of explanations than diagnostic or re-training measures.
Faithful Knowledge Graph Explanations in Commonsense Question Answering (2022.emnlp-main)

Copied to clipboard

Challenge: Knowledge graphs are used to express explanations for the model's answer choice.
Approach: They propose to use knowledge graphs to encode facts separately from the question and combine them to select an answer.
Outcome: The proposed architectures can be used to express the facts used to answer a question in a graph-based explanation, but they will not include reasoning done by the transformer encoding the question, and will be incomplete.
Towards Faithful Knowledge Graph Explanation Through Deep Alignment in Commonsense Question Answering (2024.emnlp-main)

Copied to clipboard

Challenge: Current methods for generating faithful explanations overlook path decoding faithfulness, leading to divergence between graph encoder outputs and model predictions.
Approach: They propose an algorithm to assess KG representation reliability and an LM-KG distribution-aware Alignment algorithm to improve explanation faithfulness without ground truth.
Outcome: The proposed algorithm improves explanation faithfulness without ground truth and significantly improves fidelity and model performance.
Towards Faithfully Interpretable NLP Systems: How Should We Define and Evaluate Faithfulness? (2020.acl-main)

Copied to clipboard

Challenge: Current approaches to interpretability evaluation focus on faithfulness criteria . current approaches focus on readability, plausibility and faithfulness .
Approach: They argue that current binary definition of faithfulness sets unrealistic standards . they argue that a more graded definition would be of greater practical utility .
Outcome: The proposed approach is based on three assumptions and lacks a graded definition of faithfulness.
Retrieval and Reasoning on KGs: Integrate Knowledge Graphs into Large Language Models for Complex Question Answering (2024.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models (LLMs) have performed impressively in various NLP tasks, but their inherent hallucination phenomena severely challenge their credibility in complex reasoning.
Approach: They propose to integrate explainable Knowledge Graphs (KGs) with LLMs to alleviate hallucinations . they construct subgraphs to enhance the retrieval capabilities of KGs via CoT reasoning.
Outcome: Extensive experiments on two KGQA datasets show that the proposed model achieves convincing performance compared to strong baselines.
How Interpretable are Reasoning Explanations from Prompting Large Language Models? (2024.findings-naacl)

Copied to clipboard

Challenge: Prompt Engineering has garnered significant attention for enhancing the performance of large language models across a multitude of tasks.
Approach: They propose a simple prompting technique that yields more than 70% improvement in interpretability.
Outcome: The proposed method improves interpretability by 70% across multiple dimensions.
From Nodes to Narratives: Explaining Graph Neural Networks with LLMs and Graph Context (2026.acl-long)

Copied to clipboard

Challenge: Existing explanation methods for graph neural networks struggle to generate interpretable, fine-grained rationales.
Approach: They propose a lightweight framework that uses large language models to generate interpretable explanations for GNNs.
Outcome: The proposed framework generates interpretable explanations for GNN predictions using large language models.
XRec: Large Language Models for Explainable Recommendation (2024.findings-emnlp)

Copied to clipboard

Challenge: Collaborative filtering (CF) is a widely adopted approach, but lacks the ability to provide explanations for the recommended items.
Approach: They propose a model-agnostic framework that enables large language models to provide comprehensive explanations for user behaviors in recommender systems.
Outcome: The proposed framework outperforms baseline approaches in explainable recommender systems.
Evaluating Readability and Faithfulness of Concept-based Explanations (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods for evaluating concepts from different perspectives lack a unified formalization.
Approach: They propose a formal definition of concepts generalizing to diverse concept-based explanations’ settings and apply it to other types of explanations or tasks.
Outcome: Extensive experimental analysis was carried out to determine the evaluation measures for explanation evaluation measures.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations