@article{tang-surdeanu-2023-takes,
title = "It Takes Two Flints to Make a Fire: Multitask Learning of Neural Relation and Explanation Classifiers",
author = "Tang, Zheng and
Surdeanu, Mihai",
journal = "Computational Linguistics",
volume = "49",
number = "1",
month = mar,
year = "2023",
address = "Cambridge, MA",
publisher = "MIT Press",
url = "https://aclanthology.org/2023.cl-1.3",
doi = "10.1162/coli_a_00463",
pages = "117--156",
abstract = "We propose an explainable approach for relation extraction that mitigates the tension between generalization and explainability by jointly training for the two goals. Our approach uses a multi-task learning architecture, which jointly trains a classifier for relation extraction, and a sequence model that labels words in the context of the relations that explain the decisions of the relation classifier. We also convert the model outputs to rules to bring global explanations to this approach. This sequence model is trained using a hybrid strategy: supervised, when supervision from pre-existing patterns is available, and semi-supervised otherwise. In the latter situation, we treat the sequence model{'}s labels as latent variables, and learn the best assignment that maximizes the performance of the relation classifier. We evaluate the proposed approach on the two datasets and show that the sequence model provides labels that serve as accurate explanations for the relation classifier{'}s decisions, and, importantly, that the joint training generally improves the performance of the relation classifier. We also evaluate the performance of the generated rules and show that the new rules are a great add-on to the manual rules and bring the rule-based system much closer to the neural models.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="tang-surdeanu-2023-takes">
<titleInfo>
<title>It Takes Two Flints to Make a Fire: Multitask Learning of Neural Relation and Explanation Classifiers</title>
</titleInfo>
<name type="personal">
<namePart type="given">Zheng</namePart>
<namePart type="family">Tang</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Mihai</namePart>
<namePart type="family">Surdeanu</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2023-03</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<genre authority="bibutilsgt">journal article</genre>
<relatedItem type="host">
<titleInfo>
<title>Computational Linguistics</title>
</titleInfo>
<originInfo>
<issuance>continuing</issuance>
<publisher>MIT Press</publisher>
<place>
<placeTerm type="text">Cambridge, MA</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">periodical</genre>
<genre authority="bibutilsgt">academic journal</genre>
</relatedItem>
<abstract>We propose an explainable approach for relation extraction that mitigates the tension between generalization and explainability by jointly training for the two goals. Our approach uses a multi-task learning architecture, which jointly trains a classifier for relation extraction, and a sequence model that labels words in the context of the relations that explain the decisions of the relation classifier. We also convert the model outputs to rules to bring global explanations to this approach. This sequence model is trained using a hybrid strategy: supervised, when supervision from pre-existing patterns is available, and semi-supervised otherwise. In the latter situation, we treat the sequence model’s labels as latent variables, and learn the best assignment that maximizes the performance of the relation classifier. We evaluate the proposed approach on the two datasets and show that the sequence model provides labels that serve as accurate explanations for the relation classifier’s decisions, and, importantly, that the joint training generally improves the performance of the relation classifier. We also evaluate the performance of the generated rules and show that the new rules are a great add-on to the manual rules and bring the rule-based system much closer to the neural models.</abstract>
<identifier type="citekey">tang-surdeanu-2023-takes</identifier>
<identifier type="doi">10.1162/coli_a_00463</identifier>
<location>
<url>https://aclanthology.org/2023.cl-1.3</url>
</location>
<part>
<date>2023-03</date>
<detail type="volume"><number>49</number></detail>
<detail type="issue"><number>1</number></detail>
<extent unit="page">
<start>117</start>
<end>156</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Journal Article
%T It Takes Two Flints to Make a Fire: Multitask Learning of Neural Relation and Explanation Classifiers
%A Tang, Zheng
%A Surdeanu, Mihai
%J Computational Linguistics
%D 2023
%8 March
%V 49
%N 1
%I MIT Press
%C Cambridge, MA
%F tang-surdeanu-2023-takes
%X We propose an explainable approach for relation extraction that mitigates the tension between generalization and explainability by jointly training for the two goals. Our approach uses a multi-task learning architecture, which jointly trains a classifier for relation extraction, and a sequence model that labels words in the context of the relations that explain the decisions of the relation classifier. We also convert the model outputs to rules to bring global explanations to this approach. This sequence model is trained using a hybrid strategy: supervised, when supervision from pre-existing patterns is available, and semi-supervised otherwise. In the latter situation, we treat the sequence model’s labels as latent variables, and learn the best assignment that maximizes the performance of the relation classifier. We evaluate the proposed approach on the two datasets and show that the sequence model provides labels that serve as accurate explanations for the relation classifier’s decisions, and, importantly, that the joint training generally improves the performance of the relation classifier. We also evaluate the performance of the generated rules and show that the new rules are a great add-on to the manual rules and bring the rule-based system much closer to the neural models.
%R 10.1162/coli_a_00463
%U https://aclanthology.org/2023.cl-1.3
%U https://doi.org/10.1162/coli_a_00463
%P 117-156
Markdown (Informal)
[It Takes Two Flints to Make a Fire: Multitask Learning of Neural Relation and Explanation Classifiers](https://aclanthology.org/2023.cl-1.3) (Tang & Surdeanu, CL 2023)
ACL