← Search

Li Zhong

5 accepted papers

2026

Terminal-Bench: Benchmarking Agents on Hard, Realistic Tasks in Command Line Interfaces

ICLR 2026poster

AI agents may soon become capable of autonomously completing valuable, long-horizon tasks in diverse domains. Current benchmarks either do not measure real-world tasks, or are not sufficiently difficult to meaningfully measure frontier models. To this end, we present Terminal-Bench 1.5: a carefully…

Cited by 0SourcecodeScholar
2025

Training Language Models to Generate Quality Code with Program Analysis Feedback

NeurIPS 2025poster

Code generation with large language models (LLMs), often termed vibe coding, is increasingly adopted in production but fails to ensure code quality, particularly in security (e.g., SQL injection vulnerabilities) and maintainability (e.g., missing type annotations). Existing methods, such as supervis…

Cited by 0SourcecodeScholar
2024

Can LLM Replace Stack Overflow? A Study on Robustness and Reliability of Large Language Model Code Generation

AAAI 2024technical

Recently, large language models (LLMs) have shown an extraordinary ability to understand natural language and generate programming code. It has been a common practice for software engineers to consult LLMs when encountering coding questions. Although efforts have been made to avoid syntax errors and…

2024

Debug like a Human: A Large Language Model Debugger via Verifying Runtime Execution Step by Step

ACL 2024findings

Large language models (LLMs) are leading significant progress in code generation. Beyond one-pass code generation, recent works further integrate unit tests and program verifiers into LLMs to iteratively refine the generated programs. However, these works consider the generated programs as an indivi…

2021

How Does the Combined Risk Affect the Performance of Unsupervised Domain Adaptation Approaches?

AAAI 2021technical

Unsupervised domain adaptation (UDA) aims to train a target classifier with labeled samples from the source domain and unlabeled samples from the target domain. Classical UDA learning bounds show that target risk is upper bounded by three terms: source risk, distribution discrepancy, and combined ri…