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

Charles Yu

dblp:265/1258 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
4since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 1 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
5 papers
Knowledge representation and reasoning · 42% Trustworthy machine learning · 31% Information extraction and text analysis · 14%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › data annotation
LLM-based annotation
0.912025
Automating Intervention Discovery from Scientific Literature: A Progressive Ontology Prompting and Dual-LLM Framework · IJCAI 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning › ontology
ontology-based annotation
0.912025
Automating Intervention Discovery from Scientific Literature: A Progressive Ontology Prompting and Dual-LLM Framework · IJCAI 2025
Machine learning › Trustworthy machine learning
fairness
0.712023
ADEPT: A DEbiasing PrompT Framework · AAAI 2023
Machine learning › Trustworthy machine learning › fairness
fairness and bias mitigation
0.712023
Social-Group-Agnostic Bias Mitigation via the Stereotype Content Model · ACL (1) 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning
knowledge graph
0.712023
Logical Entity Representation in Knowledge-Graphs for Differentiable Rule Learning · ICLR 2023
Machine learning › Trustworthy machine learning › fairness › bias mitigation
large language model debiasing
0.712023
ADEPT: A DEbiasing PrompT Framework · AAAI 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning
rule learning
0.712023
Logical Entity Representation in Knowledge-Graphs for Differentiable Rule Learning · ICLR 2023
Natural language and speech › Language models and text generation › natural language understanding › linguistic knowledge in language models
subject-verb agreement
0.412020
Word Frequency Does Not Predict Grammatical Knowledge in Language Models · EMNLP (1) 2020
Knowledge, reasoning and agents › Knowledge representation and reasoning
syntactic knowledge
0.412020
Word Frequency Does Not Predict Grammatical Knowledge in Language Models · EMNLP (1) 2020
Natural language and speech › Language models and text generation
prompt tuning
0.212023
ADEPT: A DEbiasing PrompT Framework · AAAI 2023

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

progressive ontology prompting · 0.9multi-agent system · 0.9large language model · 0.9stereotype content model · 0.7manifold learning · 0.7differentiable rule learning · 0.7continuous prompt tuning · 0.7few-shot learning · 0.4
YearPublicationVenuePosition
2025 Automating Intervention Discovery from Scientific Literature: A Progressive Ontology Prompting and Dual-LLM Framework
abstract
Identifying effective interventions from the scientific literature is challenging due to the high volume of publications, specialized terminology, and inconsistent reporting formats, making manual curation laborious and prone to oversight. To address this challenge, this paper proposes a novel framework leveraging large language models (LLMs), which integrates a progressive ontology prompting (POP) algorithm with a dual-agent system, named LLM-Duo. On the one hand, the POP algorithm conducts a prioritized breadth-first search (BFS) across a predefined ontology, generating structured prompt templates and action sequences to guide the automatic annotation process. On the other hand, the LLM-Duo system features two specialized LLM agents, an explorer and an evaluator, working collaboratively and adversarially to continuously refine annotation quality. We showcase the real-world applicability of our framework through a case study focused on speech-language intervention discovery. Experimental results show that our approach surpasses advanced baselines, achieving more accurate and comprehensive annotations through a fully automated process. Our approach successfully identified 2,421 interventions from a corpus of 64,177 research articles in the speech-language pathology domain, culminating in the creation of a publicly accessible intervention knowledge base with great potential to benefit the speech-language pathology community.
Dancheng Liu, Qingyun Wang 0005, Charles Yu, Chenhui Xu, Qingxiao Zheng 0001, Heng Ji 0001, Jinjun Xiong
IJCAI4
2023 ADEPT: A DEbiasing PrompT Framework
abstract
Several works have proven that finetuning is an applicable approach for debiasing contextualized word embeddings. Similarly, discrete prompts with semantic meanings have shown to be effective in debiasing tasks. With unfixed mathematical representation at the token level, continuous prompts usually surpass discrete ones at providing a pre-trained language model (PLM) with additional task-specific information. Despite this, relatively few efforts have been made to debias PLMs by prompt tuning with continuous prompts compared to its discrete counterpart. Furthermore, for most debiasing methods that alter a PLM's original parameters, a major problem is the need to not only decrease the bias in the PLM but also to ensure that the PLM does not lose its representation ability. Finetuning methods typically have a hard time maintaining this balance, as they tend to violently remove meanings of attribute words (like the words developing our concepts of "male" and "female" for gender), which also leads to an unstable and unpredictable training process. In this paper, we propose ADEPT, a method to debias PLMs using prompt tuning while maintaining the delicate balance between removing biases and ensuring representation ability. To achieve this, we propose a new training criterion inspired by manifold learning and equip it with an explicit debiasing term to optimize prompt tuning. In addition, we conduct several experiments with regard to the reliability, quality, and quantity of a previously proposed attribute training corpus in order to obtain a clearer prototype of a certain attribute, which indicates the attribute's position and relative distances to other words on the manifold. We evaluate ADEPT on several widely acknowledged debiasing benchmarks and downstream tasks, and find that it achieves competitive results while maintaining (and in some cases even improving) the PLM's representation ability. We further visualize words' correlation before and after debiasing a PLM, and give some possible explanations for the visible effects.
Ke Yang 0003, Charles Yu, Yi R. Fung 0001, Manling Li, Heng Ji 0001
AAAI2
2023 Social-Group-Agnostic Bias Mitigation via the Stereotype Content Model
abstract
Ali Omrani, Alireza Salkhordeh Ziabari, Charles Yu, Preni Golazizian, Brendan Kennedy, Mohammad Atari, Heng Ji, Morteza Dehghani. Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2023.
Ali Omrani, Alireza S. Ziabari, Charles Yu, Preni Golazizian, Brendan Kennedy 0001, Mohammad Atari, Heng Ji 0001, Morteza Dehghani
ACL (1)3
2023 Logical Entity Representation in Knowledge-Graphs for Differentiable Rule Learning
Chi Han, Qizheng He, Charles Yu, Xinya Du, Hanghang Tong, Heng Ji 0001
ICLR3
2020 Word Frequency Does Not Predict Grammatical Knowledge in Language Models
abstract
Neural language models learn, to varying degrees of accuracy, the grammatical properties of natural languages.In this work, we investigate whether there are systematic sources of variation in the language models' accuracy.Focusing on subject-verb agreement and reflexive anaphora, we find that certain nouns are systematically understood better than others, an effect which is robust across grammatical tasks and different language models.Surprisingly, we find that across four orders of magnitude, corpus frequency is unrelated to a noun's performance on grammatical tasks.Finally, we find that a novel noun's grammatical properties can be few-shot learned from various types of training data.The results present a paradox: there should be less variation in grammatical performance than is actually observed.
Charles Yu, Ryan Sie, Nico Tedeschi, Leon Bergen
EMNLP (1)1