Papers by Ye Ding

12 papers
On the Effectiveness of Adapter-based Tuning for Pretrained Language Model Adaptation (2021.acl-long)

Copied to clipboard

Challenge: Existing studies have shown that adapter-based tuning is more parameter-efficient than fine-tuning.
Approach: They propose to add adapter modules to a pretrained language model and update the parameters of adapter module when learning on a downstream task.
Outcome: The proposed method outperforms fine-tuning on low-resource and cross-lingual tasks and settings.
B-APO: Bias-Targeted Adversarial Preference Optimization for Debiasing Multimodal Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing debiasing methods create biased responses by completely removing an entire modality, forming an extreme and static training environment.
Approach: They propose a method to debiase multimodal large language models by masking one modality and then enlarge the margin between clean and adversarial responses.
Outcome: The proposed method achieves superior debiasing performance while maintaining general capabilities.
Temporal Scaling Law for Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing studies have found that the test loss of LLMs scales as power-laws with model size, computational budget, and dataset size.
Approach: They propose a concept of Temporal Scaling Law to study test loss of LLMs . they break down test loss into fine-grained token positions and develop a dynamic hyperbolic-law .
Outcome: The proposed model predicts the test loss of LLMs as the training steps scale up.
SHAPED: Shared-Private Encoder-Decoder for Text Style Adaptation (N18-1)

Copied to clipboard

Challenge: Experimentally, we find that the proposed models consistently outperform models that encapsulate single-style or average-style language generation capabilities.
Approach: They propose a family of model architectures capable of capturing both generic language characteristics via shared model parameters, as well as particular style characteristics via private model parameters.
Outcome: The proposed models outperform models that encapsulate single-style or average-style language generation capabilities.
A Novel Matching Paradigm: Unified Generative and Discriminative LLM with Prompt Compression for Relevance Learning (2026.acl-industry)

Copied to clipboard

Challenge: Existing approaches to matching use Large Language Models as feature extractors, underutilizing their full modeling capabilities.
Approach: They propose a matching paradigm that integrates two-tower, single-towing, and generative tasks within a unified LLM framework via attention-mask partitioning.
Outcome: The proposed model achieves superior performance and strong practical value in an industrial search engine.
MindRef: Mimicking Human Memory for Hierarchical Reference Retrieval with Fine-Grained Location Awareness (2025.acl-short)

Copied to clipboard

Challenge: Existing methods require pre-segmented article chunks, limiting reference flexibility like human memory.
Approach: They propose a framework that leverages parameterized knowledge stored during the pre-training phase of large language models to recall reference passages from any starting position independently.
Outcome: The proposed framework can recall reference passages from any starting position independently.
Universally Empowering Zeroth-Order Optimization via Adaptive Layer-wise Sampling (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for fine-tuning Large Language Models are slow and lack of performance.
Approach: They propose a Zeroth-Order optimization framework that uses forward passes to fine-tune Large Language Models.
Outcome: The proposed framework achieves 1.7 to 3.0 wall-clock acceleration on LLaMA and OPT models.
Fast Quiet-STaR: Thinking Without Thought Tokens (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models have achieved impressive performance across a range of tasks, but further gains require more than scaling up model sizes or training data.
Approach: They propose a method that gradually reduces the number of thought tokens . this method allows models to internalize more abstract reasoning processes .
Outcome: The proposed framework preserves the benefits of token-level reasoning while reducing computational cost.
Affective Knowledge Enhanced Multiple-Graph Fusion Networks for Aspect-based Sentiment Analysis (2022.emnlp-main)

Copied to clipboard

Challenge: Existing methods for sentiment analysis ignore the roles of syntax dependency relation labels and affective semantic information in determining the sentiment polarity of social media users.
Approach: They propose a new multi-graph fusion network to leverage the richer syntax dependency relation labels and affective semantic information of words.
Outcome: The proposed model outperforms state-of-the-art methods on three datasets.
Improving Multi-task Stance Detection with Multi-task Interaction Network (2022.emnlp-main)

Copied to clipboard

Challenge: Recent studies have proposed multi-task learning models that introduce sentiment information to boost stance detection but neglect to capture the fine-grained task-specific interaction between stance and sentiment tasks, thus degrading performance.
Approach: They propose a novel multi-task interaction network (MTIN) that captures the word-level interaction between tasks, so as to obtain richer task representations.
Outcome: The proposed approach outperforms state-of-the-art methods on two real-world datasets.
Demystifying Uncertainty in LLMs: Active Calibration between Concepts and Human Evaluations (2026.acl-long)

Copied to clipboard

Challenge: Existing static strategies for mitigating hallucinations do not explicitly model the information gain from interacting with the external environment.
Approach: They propose a calibration-driven interactive learning strategy that selects clarification queries by optimizing calibration error.
Outcome: The proposed method provides theoretical guarantees and empirical gains for reliability.
Robust Question Answering against Distribution Shifts with Test-Time Adaption: An Empirical Study (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing work on robustness tuning (RT) methods has found that QA models fail when the test data has a distribution shift compared to the training data.
Approach: They propose to use test-time adaptation methods to improve QA models after deployment to evaluate their model against text corruption and changes in language and domain.
Outcome: The proposed method improves TTA to be more robust to variation in hyper-parameters and test distributions over time.

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