Papers for

natural language generation teams

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Adaptive sampling improves translation quality and reduces compute costs

LAND: Learning an Adaptive Number of Draws for Bayesian Best-of-N Selection

Abstract: Best-of-N decoding improves generation quality by sampling multiple candidates and selecting the best, but it allocates equal compute to sources regardless of how much they benefit from additional sampling: the expected benefit is small for sources with low-variance score distributions and potentially much larger for those with high-variance distributions. To address this shortcoming, we propose LAND (Learning an Adaptive Number of Draws), which dynamically allocates samples according to their posterior-predictive marginal value. LAND learns a discrete empirical mixture of source-conditioned score distributions from calibration data, updates its belief about a source as completion scores are observed, and stops sampling when the expected improvement of another draw falls below a shared compute price. Across machine-translation experiments with multiple models and language pairs, LAND achieves better MetricX scores than fixed best-of-N at matched average compute. Conversely, at matched translation quality, LAND requires approximately 20-40% fewer candidate generations. Adaptive allocation therefore provides a simple way to retain the benefits of best-of-N while substantially improving its compute efficiency.

Mon 2 NovArtificial Intelligence
The gist
Generating text often involves picking the best out of many tries, but this uses the same amount of computing power for every piece of text, even when some need fewer tries and others need more. The authors propose a method called LAND that smartly decides how many tries to use based on how helpful additional attempts are likely to be. LAND learns from past examples and stops trying once more attempts aren't worth the computing effort. In tests on translating languages, LAND matched or beat fixed-number attempts while using less computing power.
Open → 2611.03388v1

Mixture-likelihood fine-tuning improves few-step masked diffusion language models

Train the Sampler You Run: Few-Step Masked Diffusion Language Models via Mixture-Likelihood Fine-Tuning

Abstract: When a masked diffusion language model is sampled in a few parallel steps in a random order, the model actually run is a mixture over reveal plans, while cross-entropy training fits token conditionals rather than this mixture. We introduce mixture-likelihood fine-tuning (Mix-FT), which fine-tunes a pretrained model on an importance-weighted bound of its own sampler's likelihood, with no teacher and no change to the architecture or the sampler. On LLaDA-8B, a LoRA fine-tune for 0.002% of the pretraining compute writes better OpenWebText continuations than continued cross-entropy and Alpha diffusion given the same compute, at every tested step count. With half the model evaluations, 16 rather than 32 steps per block, its continuations score better than the original model's in every seed under three judges, with confidence-based decoding as well as random order, and under confidence-based decoding two blinded LLM raters from different model families prefer them in 69 and 71% of pairs. On a public 110M-parameter block diffusion model, Mix-FT takes under four T4-hours and beats continued cross-entropy, Alpha diffusion and SDTT distillation at 4, 8 and 16 steps per block, under two judges in every seed. Exact likelihoods on text8, with a control that weights every plan equally, attribute about three quarters of the likelihood gain over continued cross-entropy to weighting each plan by how well it explains the sequence.

Mon 2 NovMachine LearningComputation and Language
The gist
Masked diffusion language models generate text by revealing words gradually in a certain order. The authors found that the way these models are usually trained doesn’t match how they actually generate words in practice, especially when doing it in few steps with a random order. They introduce a method called mixture-likelihood fine-tuning (Mix-FT) that better aligns the training with how the model samples the text, without changing the model itself. This leads to improved text generation quality using fewer steps and less computing power than previous methods.
Open → 2611.02666v1