Quasi-random Multi-Sample Inference for Large Language Models

Avinash Amballa, Aditya Parashar, Aditya Vikram Singh, Jinlin Lai, Benjamin Rozonoyer

Keywords: efficient models, few-shot generation, text-to-text generation, inference methods

TL;DR: Arithmetic sampling enhances reasoning and translation by generating diverse samples, achieving 3–5% higher GSM8K accuracy and up to 0.89% COMET gains in WMT19, with no extra computational cost.

Abstract: Large language models (LLMs) are often used with decoding strategies that require sampling multiple outputs. \citet{vilnis2023arithmetic} show that an LLM implicitly defines an arithmetic code book, facilitating efficient and embarrassingly parallelizable \textbf{arithmetic sampling} to produce multiple samples using quasi-random codes. Traditional text generation methods, such as beam search and sampling-based techniques, have notable limitations: they lack parallelizability or diversity of sampled sequences. This study explores the potential of arithmetic sampling, contrasting it with ancestral sampling across two decoding tasks that employ multi-sample inference: chain-of-thought reasoning with self-consistency and machine translation with minimum Bayes risk decoding. Our results demonstrate that arithmetic sampling produces more diverse samples, significantly improving reasoning and translation performance as the sample size increases. We observe a $\mathbf{3\text{-}5\%}$ point increase in accuracy on the GSM8K dataset and a $\mathbf{0.45\text{-}0.89\%}$ point increment in COMET score for WMT19 tasks using arithmetic sampling without any significant computational overhead.

Submission Number: 76