English
Related papers

Related papers: Decoding-Free Sampling Strategies for LLM Marginal…

200 papers

Standard decoding strategies for text generation, including top-k, nucleus sampling, and contrastive search, select tokens based on likelihood, restricting selection to high-probability regions. Human language production operates…

Computation and Language · Computer Science 2026-03-20 Esteban Garces Arias , Nurzhan Sapargali , Christian Heumann , Matthias Aßenmacher

Tokenising continuous speech into sequences of discrete tokens and modelling them with language models (LMs) has led to significant success in text-to-speech (TTS) synthesis. Although these models can generate speech with high quality and…

Sound · Computer Science 2024-08-30 Zehai Tu , Guangyan Zhang , Yiting Lu , Adaeze Adigwe , Simon King , Yiwen Guo

Large language models (LLMs) have revolutionized natural language processing and broadened their applicability across diverse commercial applications. However, the deployment of these models is constrained by high inference time in…

Computation and Language · Computer Science 2024-11-12 Euiin Yi , Taehyeon Kim , Hongseok Jeung , Du-Seong Chang , Se-Young Yun

Despite their ubiquity in language generation, it remains unknown why truncation sampling heuristics like nucleus sampling are so effective. We provide a theoretical explanation for the effectiveness of the truncation sampling by proving…

Computation and Language · Computer Science 2023-10-04 Matthew Finlayson , John Hewitt , Alexander Koller , Swabha Swayamdipta , Ashish Sabharwal

The advancement of Large Language Models (LLMs) has significantly boosted performance in natural language processing (NLP) tasks. However, the deployment of high-performance LLMs incurs substantial costs, primarily due to the increased…

Machine Learning · Computer Science 2024-03-22 Saehan Jo , Immanuel Trummer

Large Language Models (LLMs) have transformed natural language processing tasks successfully. Yet, their large size and high computational needs pose challenges for practical use, especially in resource-limited settings. Model compression…

Computation and Language · Computer Science 2024-07-31 Xunyu Zhu , Jian Li , Yong Liu , Can Ma , Weiping Wang

We present a novel inference scheme, self-speculative decoding, for accelerating Large Language Models (LLMs) without the need for an auxiliary model. This approach is characterized by a two-stage process: drafting and verification. The…

Computation and Language · Computer Science 2025-02-11 Jun Zhang , Jue Wang , Huan Li , Lidan Shou , Ke Chen , Gang Chen , Sharad Mehrotra

Large language models have evolved to process multiple modalities beyond text, such as images and audio, which motivates us to explore how to effectively leverage them for graph reasoning tasks. The key question, therefore, is how to…

We propose a method to teach multiple large language models (LLM) to collaborate by interleaving their generations at the token level. We model the decision of which LLM generates the next token as a latent variable. By optimizing the…

Computation and Language · Computer Science 2024-08-28 Shannon Zejiang Shen , Hunter Lang , Bailin Wang , Yoon Kim , David Sontag

One of the challenges with finetuning pretrained language models (PLMs) is that their tokenizer is optimized for the language(s) it was pretrained on, but brittle when it comes to previously unseen variations in the data. This can for…

Computation and Language · Computer Science 2023-04-21 Verena Blaschke , Hinrich Schütze , Barbara Plank

The widespread adoption of large language models (LLMs) makes it important to recognize their strengths and limitations. We argue that in order to develop a holistic understanding of these systems we need to consider the problem that they…

Computation and Language · Computer Science 2023-09-26 R. Thomas McCoy , Shunyu Yao , Dan Friedman , Matthew Hardy , Thomas L. Griffiths

Text stemming is a natural language processing technique that is used to reduce words to their base form, also known as the root form. The use of stemming in IR has been shown to often improve the effectiveness of keyword-matching models…

Information Retrieval · Computer Science 2024-02-20 Shuai Wang , Shengyao Zhuang , Guido Zuccon

Language models (LMs) have demonstrated remarkable capabilities in NLP, yet adapting them efficiently and robustly to specific tasks remains challenging. As their scale and complexity grow, fine-tuning LMs on labelled data often…

Computation and Language · Computer Science 2025-06-27 Zhengyan Shi

Language model (LM) pre-training has resulted in impressive performance and sample efficiency on a variety of language understanding tasks. However, it remains unclear how to best use pre-trained LMs for generation tasks such as abstractive…

Computation and Language · Computer Science 2019-05-23 Urvashi Khandelwal , Kevin Clark , Dan Jurafsky , Lukasz Kaiser

When using an LLM to process text outside the training domain(s), an often overlooked factor is vocabulary mismatch, where the general-domain tokenizer fails to capture frequent domain-specific terms, leading to higher token fertility and…

Computation and Language · Computer Science 2025-10-01 Christian Herold , Michael Kozielski , Nicholas Santavas , Yannick Versley , Shahram Khadivi

State-of-the-art supervised NLP models achieve high accuracy but are also susceptible to failures on inputs from low-data regimes, such as domains that are not represented in training data. As an approximation to collecting ground-truth…

Computation and Language · Computer Science 2023-06-29 Parikshit Bansal , Amit Sharma

Consistently scaling pre-trained language models (PLMs) imposes substantial burdens on model adaptation, necessitating more efficient alternatives to conventional fine-tuning. Given the advantage of prompting in the zero-shot setting and…

Computation and Language · Computer Science 2023-06-01 Yulin Chen , Ning Ding , Xiaobin Wang , Shengding Hu , Hai-Tao Zheng , Zhiyuan Liu , Pengjun Xie

Automatic text summarization has achieved high performance in high-resourced languages like English, but comparatively less attention has been given to summarization in less-resourced languages. This work compares a variety of different…

Computation and Language · Computer Science 2026-01-01 Chester Palen-Michel , Constantine Lignos

Large language models (LLMs) have shown promise for automatic summarization but the reasons behind their successes are poorly understood. By conducting a human evaluation on ten LLMs across different pretraining methods, prompts, and model…

Computation and Language · Computer Science 2023-02-01 Tianyi Zhang , Faisal Ladhak , Esin Durmus , Percy Liang , Kathleen McKeown , Tatsunori B. Hashimoto

Flow Language Models (FLMs) are a recently introduced class of language models which adapt continuous flow matching for one-hot encoded token sequences. Their denoisers have a special structure absent from generic continuous diffusion…

Machine Learning · Computer Science 2026-05-14 Iskander Azangulov , Leo Zhang
‹ Prev 1 4 5 6 7 8 10 Next ›