Ningyu Zhang

Ningyu Zhang

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2023
Verified
Conference Paper
Open access
PDF file
YYYunzhi Yao
Yunzhi Yao
PWPeng Wang
Peng Wang
BTBozhong Tian
Bozhong Tian
SCSiyuan Cheng
Siyuan Cheng
ZLZhoubo Li
Zhoubo Li
NZNingyu Zhang
Ningyu Zhang
Yunzhi Yao, Peng Wang, Bozhong Tian, Siyuan Cheng, Zhoubo Li, Shumin Deng, Huajun Chen, Ningyu Zhang. Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing. 2023.

21 August 2024 in World Wide Web
Verified
Journal Article
Closed access
PDF file
YZYuqi Zhu
Yuqi Zhu
XWXiaohan Wang
Xiaohan Wang
JCJing Chen
Jing Chen
SQShuofei Qiao
Shuofei Qiao
YOYixin Ou
Yixin Ou
NZNingyu Zhang
Ningyu Zhang

25 April 2022
Verified
Conference Paper
Open access
XCXiang Chen
Xiang Chen
NZNingyu Zhang
Ningyu Zhang
XXXin Xie
Xin Xie
SDShumin Deng
Shumin Deng
YYYunzhi Yao
Yunzhi Yao
HCHuajun Chen
Huajun Chen
Recently, prompt-tuning has achieved promising results for specific few-shot classification tasks. The core idea of prompt-tuning is to insert text pieces (i.e., templates) into the input and transform a classification task into a masked language modeling problem. However, for relation extraction, determining an appropriate prompt template requires domain expertise, and it is cumbersome and time-consuming to obtain a suitable label word. Furthermore, there exists abundant semantic and prior knowledge among the relation labels that cannot be ignored. To this end, we focus on incorporating knowledge among relation labels into prompt-tuning for relation extraction and propose a Knowledge-aware Prompt-tuning approach with synergistic optimization (KnowPrompt). Specifically, we inject latent knowledge contained in relation labels into prompt construction with learnable virtual type words and answer words. Then, we synergistically optimize their representation with structured constraints. Extensive experimental results on five datasets with standard and low-resource settings demonstrate the effectiveness of our approach. Our code and datasets are available in GitHub1 for reproducibility.

4 May 2023 in Nature Machine Intelligence
Verified
Journal Article
Open access
PDF file
YFYin Fang
Yin Fang
QZQiang Zhang
Qiang Zhang
NZNingyu Zhang
Ningyu Zhang
ZCZhuo Chen
Zhuo Chen
XZXiang Zhuang
Xiang Zhuang
HCHuajun Chen
Huajun Chen
Deep learning models can accurately predict molecular properties and help making the search for potential drug candidates faster and more efficient. Many existing methods are purely data driven, focusing on exploiting the intrinsic topology and construction rules of molecules without any chemical prior information. The high data dependency makes them difficult to generalize to a wider chemical space and leads to a lack of interpretability of predictions. Here, to address this issue, we introduce a chemical element-oriented knowledge graph to summarize the basic knowledge of elements and their closely related functional groups. We further propose a method for knowledge graph-enhanced molecular contrastive learning with functional prompt (KANO), exploiting external fundamental domain knowledge in both pre-training and fine-tuning. Specifically, with element-oriented knowledge graph as a prior, we first design an element-guided graph augmentation in contrastive-based pre-training to explore microscopic atomic associations without violating molecular semantics. Then, we learn functional prompts in fine-tuning to evoke the downstream task-related knowledge acquired by the pre-trained model. Extensive experiments show that KANO outperforms state-of-the-art baselines on 14 molecular property prediction datasets and provides chemically sound explanations for its predictions. This work contributes to more efficient drug design by offering a high-quality knowledge prior, interpretable molecular representation and superior prediction performance.

1 January 2024
Verified
Conference Paper
Open access
PDF file
JZJintian Zhang
Jintian Zhang
XXXin Xu
Xin Xu
NZNingyu Zhang
Ningyu Zhang
RLRuibo Liu
Ruibo Liu
BHBryan Hooi
Bryan Hooi
SDShumin Deng
Shumin Deng
Jintian Zhang, Xin Xu, Ningyu Zhang, Ruibo Liu, Bryan Hooi, Shumin Deng. Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2024.

1 August 2021
Verified
Conference Paper
Closed access
PDF file
NZNingyu Zhang
Ningyu Zhang
XCXiang Chen
Xiang Chen
XXXin Xie
Xin Xie
SDShumin Deng
Shumin Deng
CTChuanqi Tan
Chuanqi Tan
HCHuajun Chen
Huajun Chen
Document-level relation extraction aims to extract relations among multiple entity pairs from a document. Previously proposed graph-based or transformer-based models utilize the entities independently, regardless of global information among relational triples. This paper approaches the problem by predicting an entity-level relation matrix to capture local and global information, parallel to the semantic segmentation task in computer vision. Herein, we propose a Document U-shaped Network for document-level relation extraction. Specifically, we leverage an encoder module to capture the context information of entities and a U-shaped segmentation module over the image-style feature map to capture global interdependency among triples. Experimental results show that our approach can obtain state-of-the-art performance on three benchmark datasets DocRED, CDR, and GDA.