Xiaoyan Zhao

Xiaoyan Zhao

Auto-generated profile, based on publicly available information

Xiaoyan Zhao

The Chinese University of Hong Kong, Hong Kong, Hong Kong

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
22 July 2024 in ACM Computing Surveys
Verified
Journal Article
Open access
XZXiaoyan Zhao
Xiaoyan Zhao
YDYang Deng
Yang Deng
Min YangMin Yang
Min Yang
LWLingzhi Wang
Lingzhi Wang
RZRui Zhang
Rui Zhang
Ruifeng XuRuifeng Xu
Ruifeng Xu
Relation extraction (RE) involves identifying the relations between entities from underlying content. RE serves as the foundation for many natural language processing (NLP) and information retrieval applications, such as knowledge graph completion and question answering. In recent years, deep neural networks have dominated the field of RE and made noticeable progress. Subsequently, the large pre-trained language models (PLMs) have taken the state-of-the-art RE to a new level. This survey provides a comprehensive review of existing deep learning techniques for RE. First, we introduce RE resources, including datasets and evaluation metrics. Second, we propose a new taxonomy to categorize existing works from three perspectives, i.e., text representation, context encoding, and triplet prediction. Third, we discuss several important challenges faced by RE and summarize potential techniques to tackle these challenges. Finally, we outline some promising future directions and prospects in this field. This survey is expected to facilitate researchers’ collaborative efforts to address the challenges of real-world RE systems.

19 October 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
RZRui Zhang
Rui Zhang
YSYixin Su
Yixin Su
BTBayu Distiawan Trisedya
Bayu Distiawan Trisedya
XZXiaoyan Zhao
Xiaoyan Zhao
Min YangMin Yang
Min Yang
JQJianzhong Qi
Jianzhong Qi
The task of entity alignment between knowledge graphs (KGs) aims to identify every pair of entities from two different KGs that represent the same entity. Many machine learning-based methods have been proposed for this task. However, to our best knowledge, existing methods all require manually crafted seed alignments, which are expensive to obtain. In this paper, we propose the first fully automatic alignment method named AutoAlign, which does not require any manually crafted seed alignments. Specifically, for predicate embeddings, AutoAlign constructs a predicate-proximity-graph with the help of large language models to automatically capture the similarity between predicates across two KGs. For entity embeddings, AutoAlign first computes the entity embeddings of each KG independently using TransE, and then shifts the two KGs’ entity embeddings into the same vector space by computing the similarity between entities based on their attributes. Thus, both predicate alignment and entity alignment can be done without manually crafted seed alignments. AutoAlign is not only fully automatic, but also highly effective. Experiments using real-world KGs show that AutoAlign improves the performance of entity alignment significantly compared to state-of-the-art methods.

13 May 2024
Verified
Conference Paper
Open access
XSXiaoteng Shen
Xiaoteng Shen
RZRui Zhang
Rui Zhang
XZXiaoyan Zhao
Xiaoyan Zhao
JZJieming Zhu
Jieming Zhu
XXXi Xiao
Xi Xiao

20 March 2024 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
XZXiaoyan Zhao
Xiaoyan Zhao
Min YangMin Yang
Min Yang
Qiang QuQiang Qu
Qiang Qu
Ruifeng XuRuifeng Xu
Ruifeng Xu
Relation extraction (RE) tends to struggle when the supervised training data is few and difficult to be collected. In this article, we elicit relational and factual knowledge from large pretrained language models (PLMs) for few-shot RE (FSRE) with prompting techniques. Concretely, we automatically generate a diverse set of natural language templates and modulate PLM’s behavior through these prompts for FSRE. To mitigate the template bias which leads to unstableness of few-shot learning, we propose a simple yet effective template regularization network (TRN) to prevent deep networks from over-fitting uncertain templates and thus stabilize the FSRE models. TRN alleviates the template bias with three mechanisms: 1) an attention mechanism over mini-batch to weight each template; 2) a ranking regularization mechanism to regularize the attention weights and constrain the importance of uncertain templates; and 3) a template calibration module with two calibrating techniques to modify the uncertain templates in the lowest-ranked group. Experimental results on two benchmark datasets (i.e., FewRel and NYT ) show that our model has robust superiority over strong competitors. For reproducibility, we will release our code and data upon the publication of this article.

26 April 2024 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
SLShujie Li
Shujie Li
GYGuanghu Yuan
Guanghu Yuan
Min YangMin Yang
Min Yang
Ying ShenYing Shen
Ying Shen
CLChengming Li
Chengming Li
XZXiaoyan Zhao
Xiaoyan Zhao
The goal of semi-supervised text classification (SSTC) is to train a model by exploring both a small number of labeled data and a large number of unlabeled data, such that the learned semi-supervised classifier performs better than the supervised classifier trained on solely the labeled samples. Pseudo-labeling is one of the most widely used SSTC techniques, which trains a teacher classifier with a small number of labeled examples to predict pseudo labels for the unlabeled data. The generated pseudo-labeled examples are then utilized to train a student classifier, such that the learned student classifier can outperform the teacher classifier. Nevertheless, the predicted pseudo labels may be inaccurate, making the performance of the student classifier degraded. The student classifier may perform even worse than the teacher classifier. To alleviate this issue, in this paper, we introduce a dual meta-learning ( DML ) technique for semi-supervised text classification, which improves the teacher and student classifiers simultaneously in an iterative manner. Specifically, we propose a meta-noise correction method to improve the student classifier by proposing a Noise Transition Matrix (NTM) with meta-learning to rectify the noisy pseudo labels. In addition, we devise a meta pseudo supervision method to improve the teacher classifier. Concretely, we exploit the feedback performance from the student classifier to further guide the teacher classifier to produce more accurate pseudo labels for the unlabeled data. In this way, both teacher and student classifiers can co-evolve in the iterative training process. Extensive experiments on four benchmark datasets highlight the effectiveness of our DML method against existing state-of-the-art methods for semi-supervised text classification. We release our code and data of this paper publicly at https://github.com/GRIT621/DML.

8 August 2026
Verified
Conference Paper
Open access
CLChang Liu
Chang Liu
YBYimeng Bai
Yimeng Bai
XZXiaoyan Zhao
Xiaoyan Zhao
YZYang Zhang
Yang Zhang
QWQifan Wang
Qifan Wang
WRWenge Rong
Wenge Rong