paper-with-me

Papers

Learning from Explanations with Neural Execution Tree

2019-11-04 · ICLR 2020 1 · Ziqi Wang, Yujia Qin, Wenxuan Zhou, Jun Yan, Qinyuan Ye, Leonardo Neves, Zhiyuan Liu, Xiang Ren

While deep neural networks have achieved impressive performance on a range of NLP tasks, these data-hungry models heavily rely on labeled data, which restricts their applications in scenarios where data annotation is expensive. Natural language (NL) explanations have been demonstrated very useful additional supervision, which can provide sufficient domain knowledge for generating more labeled data over new instances, while the annotation time only doubles. However, directly applying them for augmenting model learning encounters two challenges: (1) NL explanations are unstructured and inherently compositional, which asks for a modularized model to represent their semantics, (2) NL explanations often have large numbers of linguistic variants, resulting in low recall and limited generalization ability. In this paper, we propose a novel Neural Execution Tree (NExT) framework to augment training data for text classification using NL explanations. After transforming NL explanations into executable logical forms by semantic parsing, NExT generalizes different types of actions specified by the logical forms for labeling data instances, which substantially increases the coverage of each NL explanation. Experiments on two NLP tasks (relation extraction and sentiment analysis) demonstrate its superiority over baseline methods. Its extension to multi-hop question answering achieves performance gain with light annotation effort.

📄 PDF Abstract BibTeX arXiv:1911.01352

Code (1)

INK-USC/NExT 공식 구현 tf

Tasks

Data AugmentationMulti-hop Question AnsweringQuestion AnsweringRelation ExtractionSemantic ParsingSentiment Analysistext-classificationText Classification

Similar Papers 제목 키워드 기반

DTOR: Decision Tree Outlier Regressor to explain anomalies

2024-03-16 · Riccardo Crupi, Daniele Regoli, Alessandro Damiano Sabatino, Immacolata Marano 외

Explaining outliers occurrence and mechanism of their occurrence can be extremely important in a variety of domains. Malfunctions, frauds, threats, in addition to being correctly identified, oftentimes need a valid expla…

Anomaly Detectionvalid

Computing Abductive Explanations for Boosted Trees

2022-09-16 · Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski

Boosted trees is a dominant ML model, exhibiting high accuracy. However, boosted trees are hardly intelligible, and this is a problem whenever they are used in safety-critical applications. Indeed, in such a context, rig…

Query Performance Explanation through Large Language Model for HTAP Systems

2024-12-02 · Haibo Xiu, Li Zhang, Tieying Zhang, Jun Yang 외

In hybrid transactional and analytical processing (HTAP) systems, users often struggle to understand why query plans from one engine (OLAP or OLTP) perform significantly slower than those from another. Although optimizer…

Language ModelingLanguage ModellingLarge Language ModelRAG+2

M2-PALE: A Framework for Explaining Multi-Agent MCTS--Minimax Hybrids via Process Mining and LLMs

2026-04-16 · Yiyu Qian, Liyuan Zhao, Tim Miller arxiv

Monte-Carlo Tree Search (MCTS) is a fundamental sampling-based search algorithm widely used for online planning in sequential decision-making domains. Despite its success in driving recent advances in artificial intellig…

RACCER: Towards Reachable and Certain Counterfactual Explanations for Reinforcement Learning

2023-03-08 · Jasmina Gajcin, Ivana Dusparic

While reinforcement learning (RL) algorithms have been successfully applied to numerous tasks, their reliance on neural networks makes their behavior difficult to understand and trust. Counterfactual explanations are hum…

counterfactualreinforcement-learningReinforcement LearningReinforcement Learning (RL)