Xudong Zhu

he/him The Ohio State University Columbus, OH

I am a PhD student in Computer Science at The Ohio State University, advised by Prof. Zhihui Zhu. My research examines how large language models represent concepts and how these representations evolve during generation and training. I am particularly interested in the linear structure of these representations and its role in understanding and steering model behavior. I also study how different training methods, such as SFT and RL, shape this structure. I received my B.S. in Computer Science from UESTC, where I worked with Prof. Zhao Kang on relation extraction and Prof. Dong Hao on graph learning.

  • Representation Learning
  • Interpretability
  • Representation & Behavior Steering
  • Training Dynamics
  • Agent Behavior Control
Portrait of Xudong Zhu

News

  • Oct 2026 Released One Token Can Be Enough on arXiv: steering an LLM’s activations only briefly at the start of generation, even for a single token, often keeps much of full steering’s control while better preserving general capabilities.
  • 2026 Received the MMLS 2026 Travel Award from the Midwest Machine Learning Symposium.
  • Jan 2026 AbsTopK, on sparse autoencoders for bidirectional features, was accepted to ICLR 2026.
  • Jun 2025 Released From Emergence to Control, on probing and steering self-reflection in LLMs.
  • 2024 Started my Ph.D. at The Ohio State University, advised by Prof. Zhihui Zhu.
  • 2024 FCDS was published at LREC-COLING 2024.

Publications

Cover of AbsTopK: Rethinking Sparse Autoencoders For Bidirectional Features

ICLR 2026

AbsTopK: Rethinking Sparse Autoencoders For Bidirectional Features

, ,

Sparse autoencoders (SAEs) are widely used for LLM interpretability, but existing variants often impose non-negativity that prevents single features from representing bidirectional concepts. We derive SAE variants from unrolled proximal gradient updates, identify this structural limitation, and propose AbsTopK SAE with magnitude-based hard thresholding. Across four LLMs and seven probing/steering tasks, AbsTopK improves reconstruction and interpretability while enabling single features to encode contrasting concepts.

Cover of From Emergence to Control: Probing and Modulating Self-Reflection in Language Models

TMLR 2026

From Emergence to Control: Probing and Modulating Self-Reflection in Language Models

, , ,

We study the emergence and control of self-reflection in large language models. Our probing method reveals that pretrained models already contain a latent capacity for reflection, which can be amplified without additional training. By identifying and manipulating a “self-reflection vector” in activation space, we achieve bidirectional control over reflective behavior, improving reasoning accuracy or reducing computation as needed. This work deepens understanding of self-reflection and demonstrates how model internals can enable precise behavioral modulation.

Cover of FCDS: Fusing Constituency and Dependency Syntax into Document-Level Relation Extraction

LREC-COLING 2024

FCDS: Fusing Constituency and Dependency Syntax into Document-Level Relation Extraction

, ,

We introduce FCDS, a document-level relation extraction model that fuses constituency and dependency syntax. By combining sentence-level aggregation from constituency trees with dependency-based graph reasoning, FCDS better captures cross-sentence relations between entities. Experiments across multiple domains show significant performance gains, highlighting the effectiveness of integrating both syntactic views.

Cover of Alleviating subgraph-induced oversmoothing in link prediction via coarse graining

Neurocomputing, 2025

Alleviating subgraph-induced oversmoothing in link prediction via coarse graining

, , ,

We address the oversmoothing problem in link prediction caused by repetitive high-degree nodes across subgraphs. Our method introduces a coarse-graining strategy that merges strongly correlated nodes, yielding more diverse receptive fields and reducing subgraph size. This not only mitigates oversmoothing but also improves scalability and efficiency of GNN-based link prediction.

Preprints & Working Papers

Writing

All posts

Building in Public

View projects

TypeScript

LLMUsage

Local-first LLM subscription usage for Hyprland, OpenAI, GLM, Grok, and Claude in your bar.

  • CLI
  • Quickshell

Lua

dotfiles

Personal dotfiles for fish, Neovim, and OpenCode, managed with GNU Stow.

  • Neovim
  • OpenCode

Education

Full CV
  1. Present

    Ph.D. in Computer Science and Engineering

  2. B.S. in Computer Science

    GPA 3.98 / 4.00