← Search

Justin T Chiu

7 accepted papers

2025

Block Diffusion: Interpolating Between Autoregressive and Diffusion Language Models

ICLR 2025oral

Diffusion language models offer unique benefits over autoregressive models due to their potential for parallelized generation and controllability, yet they lag in likelihood modeling and are limited to fixed-length generation. In this work, we introduce a class of block diffusion language models tha…

2025

Commit0: Library Generation from Scratch

ICLR 2025poster

With the goal of benchmarking generative systems beyond expert software development ability, we introduce Commit0, a benchmark that challenges AI agents to write libraries from scratch. Agents are provided with a specification document outlining the library’s API as well as a suite of interactive un…

2025

The Diffusion Duality

ICML 2025poster

Uniform-state discrete diffusion models hold the promise of fast text generation due to their inherent ability to self-correct. However, they are typically outperformed by autoregressive models and masked diffusion models. In this work, we narrow this performance gap by leveraging a key insight: Un…

2024

Language Model Inversion

ICLR 2024poster

Given a prompt, language models produce a distribution over all possible next tokens; when the prompt is unknown, can we use this distributional information to recover the prompt? We consider the problem of anguage model inversion and show that next-token probabilities contain a surprising amount of…

2024

Simple and Effective Masked Diffusion Language Models

NeurIPS 2024poster

While diffusion models excel at generating high-quality images, prior work reports a significant performance gap between diffusion and autoregressive (AR) methods in language modeling. In this work, we show that simple masked discrete diffusion is more performant than previously thought. We apply an…

2023

Symbolic Planning and Code Generation for Grounded Dialogue

EMNLP 2023long main

Large language models (LLMs) excel at processing and generating text and code. However, LLMs have had limited applicability in grounded task-oriented dialogue as they are difficult to steer toward task objectives and fail to handle novel grounding. We present a modular and interpretable grounded dia…

Cited by 0SourcecodeScholar
2021

Low-Rank Constraints for Fast Inference in Structured Models

NeurIPS 2021poster

Structured distributions, i.e. distributions over combinatorial spaces, are commonly used to learn latent probabilistic representations from observed data. However, scaling these models is bottlenecked by the high computational and memory complexity with respect to the size of the latent representat…