Papers by Huadong Wang

10 papers
Recyclable Tuning for Continual Pre-training (2023.findings-acl)

Copied to clipboard

Challenge: Continual pre-training is the paradigm where pre-trained language models acquire fresh knowledge and gradually get upgraded.
Approach: They propose to use adapted weights to recycle old PLMs for continual pre-training . they propose to combine initialization and distillation methods to achieve better performance .
Outcome: The proposed method improves the convergence and performance of the upgraded PLM.
Knowledgeable Prompt-tuning: Incorporating Knowledge into Prompt Verbalizer for Text Classification (2022.acl-long)

Copied to clipboard

Challenge: Recent studies suggest that pre-trained language models have gained rich knowledge during pre-training.
Approach: They propose to tune pre-trained language models with task-specific prompts to improve and stabilize prompttuning.
Outcome: Extensive experiments on zero and few-shot text classification tasks show that prompt-tuning improves and stabilizes prompttun-ing.
Correct When Paired, Wrong When Split: Decoupling and Editing Modality-Specific Neurons in MLLMs (2026.acl-long)

Copied to clipboard

Challenge: Existing knowledge editing paradigms suffer from editing decoupling failures . entity knowledge is sequestered into disentangled modality-specific pathways .
Approach: They propose a method that explicitly disentangles and localizes modality-specific neuron groups for targeted knowledge.
Outcome: The proposed method outperforms baselines in reliability and consistency while preserving model locality.
Token-level Dynamic Self-Attention Network for Multi-Passage Reading Comprehension (P19-1)

Copied to clipboard

Challenge: Multi-passage reading comprehension requires the ability to combine cross-passages information and reason over multiple passages to infer the answer.
Approach: They propose a Dynamic Self-attention Network (DynSAN) which processes cross-passage information at token-level and meanwhile avoids substantial computational costs.
Outcome: The proposed model achieves state-of-the-art performance on the SearchQA, Quasar-T and WikiHop datasets and further ablation validates the effectiveness of its components.
On Transferability of Prompt Tuning for Natural Language Processing (2022.naacl-main)

Copied to clipboard

Challenge: Pre-trained language models (PLMs) can achieve comparable performance to full-parameter fine-tuning by tuning a few soft prompts, but require much more training time than fine-timing.
Approach: They empirically investigate the transferability of soft prompts across different downstream tasks and PLMs to determine what decides prompt transferability.
Outcome: The proposed method can achieve comparable performance to full-parameter fine-tuning by tuning a few soft prompts, but requires much more training time than fine-timing.
Plug-and-Play Knowledge Injection for Pre-trained Language Models (2023.acl-long)

Copied to clipboard

Challenge: Existing knowledge injection methods are not suitable for enhancing pre-trained language models with external knowledge bases.
Approach: They propose a plug-and-play knowledge injection method where knowledge bases are injected into frozen existing downstream models by a knowledge plugin.
Outcome: The proposed method improves the performance of knowledge injection on knowledge-driven tasks while keeping model parameters frozen.
FPT: Improving Prompt Tuning Efficiency via Progressive Training (2022.findings-emnlp)

Copied to clipboard

Challenge: Recent prompt tuning (PT) has gained increasing attention as a parameter-efficient way of tuning pre-trained language models (PLMs).
Approach: They propose a prompt tuning algorithm that uses a small-scale partial PLM and progressively expands its depth and width until the full-model size.
Outcome: The proposed method could save over 30% of training computations while achieving comparable performance.
Distance between Relevant Information Pieces Causes Bias in Long-Context LLMs (2025.findings-acl)

Copied to clipboard

Challenge: Positional biases in large language models hinder their ability to process long inputs.
Approach: They propose a benchmark to assess positional bias in large language models involving multiple pieces of relevant information.
Outcome: The proposed benchmark assesses the performance of long-context language models by examining their models with different input lengths and tasks.
WebCPM: Interactive Web Search for Chinese Long-form Question Answering (2023.acl-long)

Copied to clipboard

Challenge: Long-form question answering requires two procedures: information retrieval and information synthesis.
Approach: They propose a Chinese long-form question answering dataset called WebCPM . the dataset is based on a web search interface that engages with a search engine in real time .
Outcome: The proposed dataset generates answers that are no worse than human-written ones . the dataset is the first Chinese LFQA dataset .
Won’t Get Fooled Again: Answering Questions with False Premises (2023.acl-long)

Copied to clipboard

Challenge: Pre-trained language models (PLMs) are often easily deceived by tricky questions such as “How many eyes does the sun have?” .
Approach: They annotate a FalseQA dataset containing 2365 human-written FPQs and find that PLMs are capable of discriminating FPqs by fine-tuning on moderate numbers.
Outcome: The proposed model can discriminate on FPQs by fine-tuning on moderate numbers of examples and generate reasonable explanations for false premise questions.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations