Non-Autoregressive Text Generation
Overview
Non-autoregressive text generation studies how to generate sequences without choosing every next token in left-to-right order, aiming for faster inference and better use of parallel computation. Common approaches include masked diffusion with iterative remasking, discrete and continuous flow matching, latent-variable models, insertion-based generation, and distillation from autoregressive teachers. Methods are tested on language modeling, open-ended generation, summarization, and reasoning, with designs ranging from many refinement steps to one-step decoding. The main tension is speed versus coherence: parallel updates can miss token dependencies, and likelihood-based metrics may not reliably capture whether generated text is fluent or distributionally representative.
Latest papers
31 papers7 papers in the last four weeks, against 2 the four weeks before. 0.0% of all new papers.