Portrait of Taozhi Chen (陈韬至)
Portrait of Taozhi Chen (陈韬至)
Taozhi Chen
Research Assistant
Tsinghua University
About Me

I am a PhD student in Computer Science at Emory University, where I am advised by Prof. Joon-Seok Kim in the AI and Simulation Lab. Before joining Emory, I worked as a Research Assistant at the College of AI, Tsinghua University, and also conducted research at Peking University under Prof. Ge Li and at Microsoft under Prof. Lee Stott. I graduated from Imperial College London and Tsinghua University.

My research interests include AI agents, large language models, multi-agent systems, and data science. I am particularly interested in building intelligent systems that can reason, interact with tools and environments, and operate robustly in complex real-world settings. More broadly, I aim to bridge research and engineering to make AI systems not only more capable, but also more dependable and practically useful.

I welcome conversations and collaborations with researchers and engineers interested in AI agents, applied machine learning, and intelligent systems.

Education
  • Emory University
    Emory University
    Ph.D. in Computer Science and Informatics
    Advisor: Prof. Joon-Seok Kim
    AI & Simulation Lab
    Sep. 2026 - Present
  • Imperial College London
    Imperial College London
    MSc in Data Science and Machine Learning
    Supervisor: Prof. Gerard Gorman
    Lab Director: Prof. Rossella Arcucci
    Ada Lovelace Academy
    Sep. 2024 - Sep. 2025
Experience
  • Tsinghua University
    Tsinghua University
    College of AI
    Advisor: Prof. Jia Li
    Research Assistant
    Sep. 2025 - Aug. 2026
  • Microsoft
    Microsoft
    AI Advocacy team
    Advisor: Prof. Lee Stott
    Research Intern
    Apr. 2025 - Sep. 2025
  • Peking University
    Peking University
    School of Computer Science
    Advisor: Prof. Ge Li
    Research Assistant
    Jun. 2024 - Nov. 2025
  • Tsinghua University
    Tsinghua University
    Department of Electronic Engineering
    Advisor: Prof. Xi Xiao
    Undergraduate Research Assistant
    Jun. 2023 - Jun. 2024
Honors & Awards (view all )
  • Laney Graduate School Fellowship,
    Emory University
    2026
  • China-U.S. Young Maker Competition,
    National First Prize (Main Track)
    2024
News
2026
Our paper EvoCoT has been accepted by ACL 2026.
Apr 06
I received a PhD offer from MIT CEE.
Mar 13
I received a PhD offer from Georgia Tech CS.
Mar 02
I received a PhD offer from Emory CSI.
Feb 17
I received a PhD offer from UIUC CS.
Feb 10
2025
I graduated from Imperial College London.
Sep 28
I passed my final defenses at Imperial College London and Microsoft!
Sep 10
I joined Microsoft as a Research Intern.
Apr 08
2024
I received an MPhil offer from the University of Cambridge.
May 18
I received an MSc offer from Imperial College London.
May 09
I received an MSc offer from LSE.
Mar 21
I received an MSc offer from University College London.
Feb 07
2023
I received a PhD offer from Tsinghua University.
Jun 27
Selected Publications (view all )
Multi-agent Collaboration with State Management
Multi-agent Collaboration with State Management

Mengyang Liu, Taozhi Chen, Zhenhua Xu, Xue Jiang, Yihong Dong

Under review. May 2026

Recent advances in multi-agent systems have shown great potential for solving complex tasks. However, when multiple agents edit a shared codebase concurrently, their changes can silently conflict and inconsistent views lead to integration failures. Existing multi-agent systems address this through workspace isolation (e.g., one git worktree per agent), but this defers conflict resolution to a post-hoc merge step where recovery is expensive. In this paper, we propose STORM, i.e., STate-ORiented Management for multi-agent collaboration. Specifically, STORM manages agent states by mediating their interactions with the shared workspace, ensuring that each agent operates on a consistent view of the codebase and that conflicting edits are detected and resolved at write time.We evaluate STORM on Commit0 and PaperBench across multiple LLMs. STORM outperforms the git-worktree-based multi-agent baseline by +18.7 on Commit0-Lite and +1.4 on PaperBench, while achieving comparable or better cost efficiency. Combined with single-agent runs, STORM reaches highest scores of 87.6 and 78.2 on the two benchmarks respectively, suggesting that explicit state management is a more effective foundation for multi-agent collaboration than workspace isolation. STORM can also be plugged into any multi-agent system.

Multi-agent Collaboration with State Management

Mengyang Liu, Taozhi Chen, Zhenhua Xu, Xue Jiang, Yihong Dong

Under review. May 2026

Recent advances in multi-agent systems have shown great potential for solving complex tasks. However, when multiple agents edit a shared codebase concurrently, their changes can silently conflict and inconsistent views lead to integration failures. Existing multi-agent systems address this through workspace isolation (e.g., one git worktree per agent), but this defers conflict resolution to a post-hoc merge step where recovery is expensive. In this paper, we propose STORM, i.e., STate-ORiented Management for multi-agent collaboration. Specifically, STORM manages agent states by mediating their interactions with the shared workspace, ensuring that each agent operates on a consistent view of the codebase and that conflicting edits are detected and resolved at write time.We evaluate STORM on Commit0 and PaperBench across multiple LLMs. STORM outperforms the git-worktree-based multi-agent baseline by +18.7 on Commit0-Lite and +1.4 on PaperBench, while achieving comparable or better cost efficiency. Combined with single-agent runs, STORM reaches highest scores of 87.6 and 78.2 on the two benchmarks respectively, suggesting that explicit state management is a more effective foundation for multi-agent collaboration than workspace isolation. STORM can also be plugged into any multi-agent system.

Think Anywhere in Code Generation
Think Anywhere in Code Generation

Xue Jiang, Tianyu Zhang, Mengyang Liu, Taozhi Chen, Zhenhua Xu, Wenpin Jiao, Zhi Jin, Ge Li, Yihong Dong

arXiv Mar 2026

Recent advances in reasoning Large Language Models (LLMs) have primarily relied on upfront thinking, where reasoning occurs before final answer. However, this approach suffers from critical limitations in code generation, where upfront thinking is often insufficient as problems' full complexity only reveals itself during code implementation. Moreover, it cannot adaptively allocate reasoning effort throughout the code generation process where difficulty varies significantly. In this paper, we propose Think-Anywhere, a novel reasoning mechanism that enables LLMs to invoke thinking on-demand at any token position during code generation. We achieve Think-Anywhere by first teaching LLMs to imitate the reasoning patterns through cold-start training, then leveraging outcome-based RL rewards to drive the model's autonomous exploration of when and where to invoke reasoning. Extensive experiments on four mainstream code generation benchmarks (i.e., LeetCode, LiveCodeBench, HumanEval, and MBPP) show that Think-Anywhere achieves state-of-the-art performance over both existing reasoning methods and recent post-training approaches, while demonstrating consistent generalization across diverse LLMs. Our analysis further reveals that Think-Anywhere enables the model to adaptively invoke reasoning at high-entropy positions, providing enhanced interpretability.

Think Anywhere in Code Generation

Xue Jiang, Tianyu Zhang, Mengyang Liu, Taozhi Chen, Zhenhua Xu, Wenpin Jiao, Zhi Jin, Ge Li, Yihong Dong

arXiv Mar 2026

Recent advances in reasoning Large Language Models (LLMs) have primarily relied on upfront thinking, where reasoning occurs before final answer. However, this approach suffers from critical limitations in code generation, where upfront thinking is often insufficient as problems' full complexity only reveals itself during code implementation. Moreover, it cannot adaptively allocate reasoning effort throughout the code generation process where difficulty varies significantly. In this paper, we propose Think-Anywhere, a novel reasoning mechanism that enables LLMs to invoke thinking on-demand at any token position during code generation. We achieve Think-Anywhere by first teaching LLMs to imitate the reasoning patterns through cold-start training, then leveraging outcome-based RL rewards to drive the model's autonomous exploration of when and where to invoke reasoning. Extensive experiments on four mainstream code generation benchmarks (i.e., LeetCode, LiveCodeBench, HumanEval, and MBPP) show that Think-Anywhere achieves state-of-the-art performance over both existing reasoning methods and recent post-training approaches, while demonstrating consistent generalization across diverse LLMs. Our analysis further reveals that Think-Anywhere enables the model to adaptively invoke reasoning at high-entropy positions, providing enhanced interpretability.

All publications