Papers by Kai Zhen

14 papers
AGD: Adversarial Game Defense Against Jailbreak Attacks in Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Existing defenses, including post-training alignment and prompt engineering, struggle with adaptability to out-of-distribution (OOD) attacks.
Approach: They propose an adversarial game-based defense method that dynamically adjusts LLMs’ internal representations to achieve a balanced trade-off between helpfulness and harmlessness.
Outcome: The proposed method improves LLMs’ safety over all baselines.
Self-supervised Quantized Representation for Seamlessly Integrating Knowledge Graphs with Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) are gaining popularity due to their lack of knowledge hallucination and lack of a coherent model.
Approach: They propose a self-supervised quantized representation method to compress KG structural and semantic knowledge into discrete codes that align the format of language sentences.
Outcome: The proposed framework outperforms existing unsupervised methods producing more distinguishable codes on KG link prediction and triple classification tasks.
AdaZeta: Adaptive Zeroth-Order Tensor-Train Adaption for Memory-Efficient Large Language Models Fine-Tuning (2024.emnlp-main)

Copied to clipboard

Challenge: Recent advances in memory-efficient zeroth-order methods have limited their widespread adoption due to performance drops and a high risk of divergence.
Approach: They propose a memory-efficient zeroth-order framework to improve performance and convergence of the MeZO methods by using only forward passes.
Outcome: The proposed framework improves performance and convergence of the proposed methods on Roberta-Large and Llama-2-7B models.
Wanda++: Pruning Large Language Models via Regional Gradients (2025.findings-acl)

Copied to clipboard

Challenge: Existing pruning methods suffer from accuracy degradation without full-model sparsity-aware fine-tuning.
Approach: They propose a pruning framework that uses decoder-block-level regional gradients to improve pruning accuracy.
Outcome: The proposed pruning framework outperforms the state-of-the-art pruning frameworks by utilizing decoder-block-level regional gradients.
QuZO: Quantized Zeroth-Order Fine-Tuning for Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) are quantized to lower precision to reduce memory cost and latency in inference.
Approach: They propose a quantized zeroth-order framework for fine-tuning Large Language Models (LLMs) using low-precision forward passes.
Outcome: The proposed method achieves comparable results to first-order methods in FP8 and superior accuracy in INT8 and INT4 training.
Beyond Yes and No: Improving Zero-Shot LLM Rankers via Scoring Fine-Grained Relevance Labels (2024.naacl-short)

Copied to clipboard

Challenge: Existing pointwise LLMs provide noisy or biased answers for documents that are partially relevant to the query.
Approach: They propose to incorporate fine-grained relevance labels into the LLM prompt . they propose to better differentiate between documents with different levels of relevance .
Outcome: The proposed model can differentiate between documents with different levels of relevance to the query and derive a more accurate ranking.
From Generation to Judgment: Opportunities and Challenges of LLM-as-a-judge (2025.emnlp-main)

Copied to clipboard

Challenge: Recent advances in Large Language Models (LLMs) inspire the "LLM-as-a-judge" paradigm . traditional methods of assessment and evaluation fail in dynamic and open-ended scenarios .
Approach: They propose a paradigm where LLMs are leveraged to perform scoring, ranking, or selection for machine learning evaluation scenarios.
Outcome: The proposed model-based judgment and evaluation paradigms are based on large language models and are compared to the current model-driven evaluation paradigm.
Large Language Models are Effective Text Rankers with Pairwise Ranking Prompting (2024.findings-naacl)

Copied to clipboard

Challenge: Existing methods to rank documents using large language models do not understand these challenging ranking formulations.
Approach: They propose to use Pairwise Ranking Prompting to improve ranking performance . they propose to outperform fine-tuned baseline rankers on benchmark datasets .
Outcome: The proposed technique outperforms supervised baselines on benchmark datasets and outperformed other LLM-based solutions by over 10% on average.
D4: a Chinese Dialogue Dataset for Depression-Diagnosis-Oriented Chat (2022.emnlp-main)

Copied to clipboard

Challenge: Existing human-machine dialogue systems are not able to provide diagnostic information for depression diagnosis due to stigma associated with mental illness.
Approach: They propose to construct a Chinese Dialogue Dataset for depression-diagnosis-oriented chat based on clinical depression diagnostic criteria.
Outcome: The proposed system can be used to diagnose depression using a Chinese Dialogue Dataset.
Saten: Sparse Augmented Tensor Networks for Post-Training Compression of Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Low-rank tensor compression techniques are used for over-parameterized neural networks, but their applications to compress pre-trained LLMs for downstream tasks remain challenging due to the high-rank nature of pre-training data.
Approach: They propose sparse augmented tensor networks to enhance low-rank tenorized LLMs . they also propose a framework that enables full model compression .
Outcome: The proposed framework improves accuracy and efficiency in tensorized language models.
MaZO: Masked Zeroth-Order Optimization for Multi-Task Fine-Tuning of Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated exceptional capabilities across diverse tasks, but their fine-tuning requires significant memory, posing challenges for resource-constrained environments.
Approach: They propose a ZO-based framework that eliminates the need for backpropagation and provides a memory-efficient alternative to backprograming.
Outcome: The proposed framework surpasses first-order methods in performance and accuracy.
Curriculum Learning based Hierarchical Scoring and Analysis Framework for Question Answering Task Evaluation (2026.findings-acl)

Copied to clipboard

Challenge: Existing evaluation methods rely on rule-based matching with shallow semantic understanding or adopt LLM-as-a-Judge approaches that incur high cost and latency while offering limited error interpretability.
Approach: They propose a curriculum learning based hierarchical framework for QA task evaluation that supports quick scoring and fine-grained error analysis.
Outcome: The proposed framework outperforms baseline methods on quick scoring and error analysis tasks while being 25 faster.
PaRaDe: Passage Ranking using Demonstrations with LLMs (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing studies show that large language models can be instructed to perform zero-shot passage re-ranking . Existing work like UPR demonstrate promising results for zero- shot ranking using LLMs .
Approach: They propose a demonstration selection strategy based on difficulty rather than semantic similarity . they propose to include only one demonstration in the prompt to improve re-ranking .
Outcome: The proposed method improves LLM-based re-ranking by adding one demonstration to the prompt.
ED2LM: Encoder-Decoder to Language Model for Faster Document Re-ranking Inference (2022.findings-acl)

Copied to clipboard

Challenge: State-of-the-art neural models typically encode document-query pairs using cross-attention for re-ranking.
Approach: They propose to fine tune a pretrained encoder-decoder model using document to query generation.
Outcome: The proposed model achieves comparable results to more expensive approaches while being 6.8X faster.

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