Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yongchang Cao

dblp:20/8873 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
3since 2021 · last 2023
—ORCID · conflict

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Theory of computation · 2Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Trustworthy machine learning · 44% Information extraction and text analysis · 44% Efficient and distributed learning · 13%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
out-of-distribution detection
0.712023
On Prefix-tuning for Lightweight Out-of-distribution Detection · ACL (1) 2023
Natural language and speech › Information extraction and text analysis
relation extraction
0.712023
MORE: A Multimodal Object-Entity Relation Extraction Dataset with a Benchmark Evaluation · ACM Multimedia 2023
Knowledge graphs › relation extraction
multimodal relation extraction
0.712023
MORE: A Multimodal Object-Entity Relation Extraction Dataset with a Benchmark Evaluation · ACM Multimedia 2023
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
0.212023
On Prefix-tuning for Lightweight Out-of-distribution Detection · ACL (1) 2023

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

multimodal learning · 1.3benchmark evaluation · 1.3prefix-tuning · 0.7contrastive learning · 0.7
YearPublicationVenuePosition
2023 On Prefix-tuning for Lightweight Out-of-distribution Detection
abstract
Out-of-distribution (OOD) detection, a fundamental task vexing real-world applications, has attracted growing attention in the NLP community.Recently fine-tuning based methods have made promising progress.However, it could be costly to store fine-tuned models for each scenario.In this paper, we depart from the classic fine-tuning based OOD detection toward a parameter-efficient alternative, and propose an unsupervised prefix-tuning based OOD detection framework termed PTO.Additionally, to take advantage of optional training data labels and targeted OOD data, two practical extensions of PTO are further proposed.Overall, PTO and its extensions offer several key advantages of being lightweight, easy-to-reproduce, and theoretically justified.Experimental results show that our methods perform comparably to, even better than, existing fine-tuning based OOD detection approaches under a wide range of metrics, detection settings, and OOD types.
Yawen Ouyang, Yongchang Cao, Zhen Wu 0002, Xinyu Dai
ACL (1)2
2023 Make BERT-based Chinese Spelling Check Model Enhanced by Layerwise Attention and Gaussian Mixture Model
abstract
BERT-based models have shown a remarkable ability in the Chinese Spelling Check (CSC) task recently. However, traditional BERT-based methods still suffer from two limitations. First, although previous works have identified that explicit prior knowledge like Part-Of-Speech (POS) tagging can benefit in the CSC task, they neglected the fact that spelling errors inherent in CSC data can lead to incorrect tags and therefore mislead models. Additionally, they ignored the correlation between the implicit hierarchical information encoded by BERT's intermediate layers and different linguistic phenomena. This results in sub-optimal accuracy. To alleviate the above two issues, we design a heterogeneous knowledge-infused framework to strengthen BERT-based CSC models. To incorporate explicit POS knowledge, we utilize an auxiliary task strategy driven by Gaussian mixture model. Meanwhile, to incorporate implicit hierarchical linguistic knowledge within the encoder, we propose a novel form of n-gram-based layerwise self-attention to generate a multilayer representation. Experimental results show that our proposed framework yields a stable performance boost over four strong baseline models and outperforms the previous state-of-the-art methods on two datasets.
Yongchang Cao, Liang He 0009, Zhen Wu 0002, Xinyu Dai
IJCNN1
2023 MORE: A Multimodal Object-Entity Relation Extraction Dataset with a Benchmark Evaluation
abstract
Extracting relational facts from multimodal data is a crucial task in the field of multimedia and knowledge graphs that feeds into widespread real-world applications. The emphasis of recent studies centers on recognizing relational facts in which both entities are present in one modality and supplementary information is used from other modalities. However, such works disregard a substantial amount of multimodal relational facts that arise across different modalities, such as one entity seen in a text and another in an image. In this paper, we propose a new task, namely Multimodal Object-Entity Relation Extraction, which aims to extract "object-entity" relational facts from image and text data. To facilitate research on this task, we introduce MORE, a new dataset comprising 21 relation types and 20,136 multimodal relational facts annotated on 3,522 pairs of textual news titles and corresponding images. To show the challenges of Multimodal Object-Entity Relation Extraction, we evaluated recent state-of-the-art methods for multimodal relation extraction and conducted a comprehensive experimentation analysis on MORE. Our results demonstrate significant challenges for existing methods, underlining the need for further research on this task. Based on our experiments, we identify several promising directions for future research. The MORE dataset and code are available at https://github.com/NJUNLP/MORE.
Liang He 0009, Hongke Wang, Yongchang Cao, Zhen Wu 0002, Xinyu Dai
ACM Multimedia3
2020 General Rumor Blocking: An efficient random algorithm with martingale approach
Qizhi Fang, Xin Chen 0097, Qingqin Nong, Zongchao Zhang, Yongchang Cao, Suning Gong, Ding-Zhu Du
Theor. Comput. Sci.5
2018 General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach
Qizhi Fang, Xin Chen 0097, Qingqin Nong, Zongchao Zhang, Yongchang Cao, Suning Gong, Ding-Zhu Du
AAIM5