Papers by Ke Yuan
One QuantLLM for ALL: Fine-tuning Quantized LLMs Once for Efficient Deployments (2025.acl-long)
Copied to clipboard
| Challenge: | Quantization has shown promise for Large Language Models, but current methods require lengthy training to alleviate quantization loss. |
| Approach: | They propose to decouple weights and incorporate Low-Rank adapters to reduce weight sharing . they validate the approach on LLaMA2 families and Mistral on downstream evaluation . |
| Outcome: | The proposed approach shows high performance while reducing deployment time faced with multiple scenarios. |
HILL: Hierarchy-aware Information Lossless Contrastive Learning for Hierarchical Text Classification (2024.naacl-long)
Copied to clipboard
| Challenge: | Existing self-supervised methods in natural language processing rely on augmentation rules to generate contrastive samples. |
| Approach: | They propose a hierarchy-aware information lossless contrastive learning scheme that uses syntactic information reserved in the input sample and fused during the learning process. |
| Outcome: | The proposed learning scheme is superior to existing methods in hierarchical text classification . the proposed learning system is based on a structure encoder and a text encoder . |
FusionDTI: Fine-grained Binding Discovery with Token-level Fusion for Drug-Target Interaction (2025.findings-emnlp)
Copied to clipboard
| Challenge: | despite advances in DTI models, models often struggle to capture fine-grained interactions between drugs and proteins. |
| Approach: | They propose a novel drug-target interaction model that uses a token-level module to learn fine-grained information for drug-target interactions. |
| Outcome: | The proposed model learns fine-grained information for drug-target interaction . it mitigates sequence fragment invalidation and incorporates the structure-aware vocabulary of target proteins . |
DP3: Differentially Private Prompt Perturbation for Multi-turn LLM Inference (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models (LLMs) are widely used for text understanding and generation . existing methods that assume single-turn interactions break down in multi-turn settings . |
| Approach: | They propose a differentially private prompt perturbation framework for multi-turn LLM inference . DP3 constructs a perturbation mapping table to reuse perturbations for recurring tokens . |
| Outcome: | The proposed framework reduces privacy costs and degrades cross-turn semantic coherence . it also provides a context-aware utility function to maintain semantic consistency across turns . |
Rethinking Text-based Protein Understanding: Retrieval or LLM? (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies have focused on integrating protein-related knowledge into large language models through continued pretraining and multi-modal alignment. |
| Approach: | They propose a retrieval-enhanced method which significantly outperforms fine-tuned LLMs for protein-to-text generation and shows accuracy and efficiency in training-free scenarios. |
| Outcome: | The proposed method significantly outperforms fine-tuned LLMs for protein-to-text generation and shows accuracy and efficiency in training-free scenarios. |
Knowledge-Infused Multi-Bit Watermarking for RAG Knowledge Bases (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing RAG watermarking methods are limited in their encoding capacity and potential degradation of performance or knowledge quality. |
| Approach: | They propose knowledge-infused and multi-bit watermarking (KMW) for RAG knowledge bases by benign knowledge completion and a tailored generative watermark algorithm. |
| Outcome: | The proposed method extracts watermarks from adversarial RAGs while remaining stealthy and secure. |
DeKeyNLU: Enhancing Natural Language to SQL Generation through Task Decomposition and Keyword Extraction (2025.findings-emnlp)
Copied to clipboard
Jian Chen, Zhenyan Chen, Xuming Hu, Peilin Zhou, Yining Hua, Han Fang, Cissy Hing Yee Choy, Xinmei Ke, Jingfeng Luo, Zixuan Yuan
| Challenge: | NL2SQL provides a model-centric paradigm that simplifies database access for non-technical users . challenges such as inaccurate task decomposition and keyword extraction remain major bottlenecks . |
| Approach: | They propose a RAG-based NL2SQL pipeline that employs three modules for query understanding, entity retrieval, and generation to improve SQL generation accuracy. |
| Outcome: | The proposed pipeline improves the accuracy of query generation on BIRD and Spider datasets. |
You Can Have a Second Chance: Unbiased and Multi-bit Watermarking for Diffusion Language Models with Regret-based Remasking (2026.acl-long)
Copied to clipboard
| Challenge: | Existing sequential LLMs cannot be directly applied to DLMs, as their generation order is arbitrary. |
| Approach: | They propose a stability-aware constraint that allows watermarking only in stable contexts and a bit-controlled, unbiased modulation to preserve the original DLM output distribution. |
| Outcome: | The proposed scheme achieves stable watermarking with minimal quality impact while maintaining high detection accuracy and multi-bit capacity. |
FRAG: A Flexible Modular Framework for Retrieval-Augmented Generation based on Knowledge Graphs (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for retrieval-augmented generation struggle with a trade-off between flexibility and retrieval quality. |
| Approach: | They propose a flexible modular KG-RAG framework that uses query text instead of KGs . they propose to use query text to infer the structural information of reasoning paths . |
| Outcome: | The proposed method achieves state-of-the-art performance with high efficiency and low resource consumption. |
Global Context or Local Detail? Adaptive Visual Grounding for Hallucination Mitigation (2026.findings-acl)
Copied to clipboard
Yubo Jiang, Xin Yang, Abudukelimu Wuerkaixi, Zheming Yuan, Xuxin Cheng, Cao Liu, Ke Zeng, Fengying Xie, Zhiguo Jiang, Haopeng Zhang
| Challenge: | Large vision–language models suffer from object-existence hallucinations when multi-step deliberation decouples from visual evidence. |
| Approach: | They propose a framework that allocates visual computation by uncertainty . they propose highlighting retains global context, while selective zoom-in performs local verification. |
| Outcome: | The proposed framework reduces the complexity of multimodal reasoning by minimizing the operator trade-off. |
SCOPE: Preserving Modality-Specific Cues to Mitigate Modality Laziness in Multimodal Learning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to learning multimodal representations emphasize shared semantics and overlook modality-specific cues. |
| Approach: | They propose a framework for learning complete multimodal representations using shared and practical cues. |
| Outcome: | SCOPE outperforms SOTA benchmarks on four datasets and achieves 27.10% accuracy improvement. |
AudioChatLlama: Towards General-Purpose Speech Abilities for LLMs (2024.naacl-long)
Copied to clipboard
Yassir Fathullah, Chunyang Wu, Egor Lakomkin, Ke Li, Junteng Jia, Yuan Shangguan, Jay Mahadeokar, Ozlem Kalinli, Christian Fuegen, Mike Seltzer
| Challenge: | a new model for speech processing and reasoning uses curated data instead of text. |
| Approach: | They extend the instruction-tuned Llama-2 model with end-to-end speech processing and reasoning abilities without using any carefully curated paired data. |
| Outcome: | The proposed model outperforms or outperfects existing models on synthesized and recorded speech QA tests. |
EquiBench: Benchmarking Large Language Models’ Reasoning about Program Semantics via Equivalence Checking (2025.emnlp-main)
Copied to clipboard
Anjiang Wei, Jiannan Cao, Ran Li, Hongyu Chen, Yuhui Zhang, Ziheng Wang, Yuan Liu, Thiago S. F. X. Teixeira, Diyi Yang, Ke Wang, Alex Aiken
| Challenge: | EquiBench is a new benchmark to evaluate large language models' ability to reason about program semantics . Unlike natural language, code is executable. |
| Approach: | They propose a benchmark to evaluate large language models through equivalence checking . EquiBench consists of 2400 program pairs across four languages and six categories . |
| Outcome: | The proposed benchmark consists of 2400 program pairs across four languages and six categories. |