← Search

Ziwen Xu

11 accepted papers

2026

LightMem: Lightweight and Efficient Memory-Augmented Generation

ICLR 2026poster

Despite their remarkable capabilities, Large Language Model (LLM) struggle to effectively leverage historical interaction information in dynamic and complex environments. Memory systems enable LLMs to move beyond stateless interactions by introducing persistent information storage, retrieval, and ut…

Cited by 0SourcecodeScholar
2025

Automating Steering for Safe Multimodal Large Language Models

EMNLP 2025

Recent progress in Multimodal Large Language Models (MLLMs) has unlocked powerful cross-modal reasoning abilities, but also raised new safety concerns, particularly when faced with adversarial multimodal inputs. To improve the safety of MLLMs during inference, we introduce a modular and adaptive inf

2025

Beyond Prompt Engineering: Robust Behavior Control in LLMs via Steering Target Atoms

ACL 2025long

Precise control over language model generation is vital for ensuring both safety and reliability. Although prompt engineering and steering are commonly used to intervene in model behaviors, the vast number of parameters in models often results in highly intertwined internal representations. This int…

2025

Model Merging in Pre-training of Large Language Models

NeurIPS 2025poster

Model merging has emerged as a promising technique for enhancing large language models, though its application in large-scale pre-training remains relatively unexplored. In this paper, we present a comprehensive investigation of model merging techniques during the pre-training process. Through exten…

Cited by 0SourceScholar
2024

Detoxifying Large Language Models via Knowledge Editing

ACL 2024long

This paper investigates using knowledge editing techniques to detoxify Large Language Models (LLMs). We construct a benchmark, SafeEdit, which covers nine unsafe categories with various powerful attack prompts and equips comprehensive metrics for systematic evaluation. We conduct experiments with se…

2024

EasyEdit: An Easy-to-use Knowledge Editing Framework for Large Language Models

ACL 2024system demonstrations

Large Language Models (LLMs) usually suffer from knowledge cutoff or fallacy issues, which means they are unaware of unseen events or generate text with incorrect facts owing to outdated/noisy data. To this end, many knowledge editing approaches for LLMs have emerged – aiming to subtly inject/edit u…

2024

EasyInstruct: An Easy-to-use Instruction Processing Framework for Large Language Models

ACL 2024system demonstrations

In recent years, instruction tuning has gained increasing attention and emerged as a crucial technique to enhance the capabilities of Large Language Models (LLMs). To construct high-quality instruction datasets, many instruction processing approaches have been proposed, aiming to achieve a delicate…

2024

Knowledge Circuits in Pretrained Transformers

NeurIPS 2024poster

The remarkable capabilities of modern large language models are rooted in their vast repositories of knowledge encoded within their parameters, enabling them to perceive the world and engage in reasoning. The inner workings of how these models store knowledge have long been a subject of intense inte…

2024

Knowledge Mechanisms in Large Language Models: A Survey and Perspective

EMNLP 2024finding

Understanding knowledge mechanisms in Large Language Models (LLMs) is crucial for advancing towards trustworthy AGI. This paper reviews knowledge mechanism analysis from a novel taxonomy including knowledge utilization and evolution. Knowledge utilization delves into the mechanism of memorization, c…

Cited by 20SourcePDFScholar
2024

WISE: Rethinking the Knowledge Memory for Lifelong Model Editing of Large Language Models

NeurIPS 2024poster

Large language models (LLMs) need knowledge updates to meet the ever-growing world facts and correct the hallucinated responses, facilitating the methods of lifelong model editing. Where the updated knowledge resides in memories is a fundamental question for model editing. In this paper, we find tha…