Jingcong Tao

dblp:289/0919 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Trustworthy machine learning · 80% Information extraction and text analysis · 20%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial training
0.612022
Unifying Model Explainability and Robustness for Joint Text Classification and Rationale Extraction · AAAI 2022
Machine learning › Trustworthy machine learning
interpretability
0.612022
Unifying Model Explainability and Robustness for Joint Text Classification and Rationale Extraction · AAAI 2022
Machine learning › Trustworthy machine learning › interpretability › rationalization
rationale extraction
0.612022
Unifying Model Explainability and Robustness for Joint Text Classification and Rationale Extraction · AAAI 2022
Machine learning › Trustworthy machine learning
robustness
0.612022
Unifying Model Explainability and Robustness for Joint Text Classification and Rationale Extraction · AAAI 2022
Natural language and speech › Information extraction and text analysis
text classification
0.612022
Unifying Model Explainability and Robustness for Joint Text Classification and Rationale Extraction · AAAI 2022

Methods — techniques the papers use, named apart from their topics

boundary match constraint · 0.6adversarial training · 0.6
YearPublicationVenuePosition
2022 Unifying Model Explainability and Robustness for Joint Text Classification and Rationale Extraction
abstract
Recent works have shown explainability and robustness are two crucial ingredients of trustworthy and reliable text classification. However, previous works usually address one of two aspects: i) how to extract accurate rationales for explainability while being beneficial to prediction; ii) how to make the predictive model robust to different types of adversarial attacks. Intuitively, a model that produces helpful explanations should be more robust against adversarial attacks, because we cannot trust the model that outputs explanations but changes its prediction under small perturbations. To this end, we propose a joint classification and rationale extraction model named AT-BMC. It includes two key mechanisms: mixed Adversarial Training (AT) is designed to use various perturbations in discrete and embedding space to improve the model’s robustness, and Boundary Match Constraint (BMC) helps to locate rationales more precisely with the guidance of boundary information. Performances on benchmark datasets demonstrate that the proposed AT-BMC outperforms baselines on both classification and rationale extraction by a large margin. Robustness analysis shows that the proposed AT-BMC decreases the attack success rate effectively by up to 69%. The results indicate that there are connections between robust models and better explanations.
Dongfang Li 0002, Baotian Hu, Qingcai Chen, Tujie Xu, Jingcong Tao, Yunan Zhang 0003
AAAI5
2022 Multi-Role Event Argument Extraction as Machine Reading Comprehension with Argument Match Optimization
abstract
Extracting arguments for the pre-defined roles is a crucial step for event extraction. Recently, there are some insightful works that view it as a machine reading comprehension problem and achieve significant progress. However, most of them need multi-turns to extract the arguments of each role independently, which ignores the relationships among roles in the same event. To alleviate this problem, we propose a novel Multi-Role Argument Extraction method named MRAE which can exploit the relationship of event roles by extracting all arguments for an event simultaneously. To force MRAE to locate more arguments accurately, we propose an argument match optimization loss based on the minimum risk training to exploit sentence-level F1 score. We conduct experiments on the widely used ACE2005 dataset. The experimental results demonstrate that MRAE outperforms the competitor methods by at least +1.2% F1 score on argument extraction, and also shows superiority on data scarce scenarios.
Jingcong Tao, Youcheng Pan, Baotian Hu, Weihua Peng, Cuiyun Han, Xiaolong Wang 0001
ICASSP1