English
Related papers

Related papers: Foundations of Top-$k$ Decoding For Language Model…

200 papers

Large Language Models (LLMs) have demonstrated impressive performance on multiple-choice question answering (MCQA) benchmarks, yet they remain highly vulnerable to minor input perturbations. In this paper, we introduce and evaluate Token…

Computation and Language · Computer Science 2025-06-12 Jui-Ming Yao , Hao-Yuan Chen , Zi-Xian Tang , Bing-Jia Tan , Sheng-Wei Peng , Bing-Cheng Xie , Shun-Feng Su

Large language models (LLMs) process and predict sequences containing text to answer questions, and address tasks including document summarization, providing recommendations, writing software and solving quantitative problems. We provide a…

Numerical Analysis · Mathematics 2026-02-02 Ricardo Baptista , Andrew Stuart , Son Tran

We propose a novel decoding approach for neural machine translation (NMT) based on continuous optimisation. We convert decoding - basically a discrete optimization problem - into a continuous optimization problem. The resulting constrained…

Computation and Language · Computer Science 2017-07-25 Cong Duy Vu Hoang , Gholamreza Haffari , Trevor Cohn

Code generation has been greatly enhanced by the profound advancements in Large Language Models (LLMs) recently. Nevertheless, such LLM-based code generation approaches still struggle to generate error-free code in a few tries when faced…

Artificial Intelligence · Computer Science 2024-08-13 Zhi-Cun Lyu , Xin-Ye Li , Zheng Xie , Ming Li

Decoding methods play an indispensable role in converting language models from next-token predictors into practical task solvers. Prior research on decoding methods, primarily focusing on task-specific models, may not extend to the current…

Computation and Language · Computer Science 2024-10-10 Chufan Shi , Haoran Yang , Deng Cai , Zhisong Zhang , Yifan Wang , Yujiu Yang , Wai Lam

Speculative decoding (SD) accelerates Large Language Model (LLM) generation by using an efficient draft model to propose the next few tokens, which are verified by the LLM in a single forward call, reducing latency while preserving its…

Computation and Language · Computer Science 2025-05-30 Milan Gritta , Huiyin Xue , Gerasimos Lampouras

Probabilistic language generators are theoretically modeled as discrete stochastic processes, yet standard decoding strategies (Top-k, Top-p) impose static truncation rules that fail to accommodate the dynamic information density of natural…

Computation and Language · Computer Science 2026-03-17 Deepon Halder , Raj Dabre

A new approach for estimating the Decoding Error-Probability (DEP) of LT codes with dense rows is derived by using the conditional Kovalenko's rank distribution. The estimate by the proposed approach is very close to the DEP approximated by…

Information Theory · Computer Science 2009-01-19 Ki-Moon Lee , Hayder Radha , Beom-Jin Kim

Recent advances in language models (LMs) have led to significant improvements in quality on complex NLP tasks, but at the expense of increased inference costs. Cascading offers a simple strategy to achieve more favorable cost-quality…

Computation and Language · Computer Science 2024-04-17 Neha Gupta , Harikrishna Narasimhan , Wittawat Jitkrittum , Ankit Singh Rawat , Aditya Krishna Menon , Sanjiv Kumar

Large Language Models (LLMs) often lack meaningful confidence estimates for their outputs. While base LLMs are known to exhibit next-token calibration, it remains unclear whether they can assess confidence in the actual meaning of their…

Computation and Language · Computer Science 2025-11-10 Preetum Nakkiran , Arwen Bradley , Adam Goliński , Eugene Ndiaye , Michael Kirchhof , Sinead Williamson

This paper studies maximum likelihood(ML) decoding in error-correcting codes as rational maps and proposes an approximate ML decoding rule by using a Taylor expansion. The point for the Taylor expansion, which will be denoted by $p$ in the…

Dynamical Systems · Mathematics 2010-06-30 Kazunori Hayashi , Yasuaki Hiraoka

Token-based semantic communication is promising for future wireless networks, as it can compact semantic tokens under very limited channel capacity. However, harsh wireless channels often cause missing tokens, leading to severe distortion…

Signal Processing · Electrical Eng. & Systems 2026-04-15 Jingzhi Hu , Geoffrey Ye Li

Communication overhead is one of the major obstacles to train large deep learning models at scale. Gradient sparsification is a promising technique to reduce the communication volume. However, it is very challenging to obtain real…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-22 Shigang Li , Torsten Hoefler

Today's probabilistic language generators fall short when it comes to producing coherent and fluent text despite the fact that the underlying models perform well under standard metrics, e.g., perplexity. This discrepancy has puzzled the…

Computation and Language · Computer Science 2025-06-06 Clara Meister , Tiago Pimentel , Gian Wiher , Ryan Cotterell

Code Large Language Models (LLMs) have demonstrated remarkable capabilities in generating, understanding, and manipulating programming code. However, their training process inadvertently leads to the memorization of sensitive information,…

Cryptography and Security · Computer Science 2025-04-22 Yuqing Nie , Chong Wang , Kailong Wang , Guoai Xu , Guosheng Xu , Haoyu Wang

This paper describes the functioning of a broad-coverage probabilistic top-down parser, and its application to the problem of language modeling for speech recognition. The paper first introduces key notions in language modeling and…

Computation and Language · Computer Science 2007-05-23 Brian Roark

Large Vision-Language Models (LVLMs) achieve strong performance on single-image tasks, but their performance declines when multiple images are provided as input. One major reason is the cross-image information leakage, where the model…

Computer Vision and Pattern Recognition · Computer Science 2026-02-26 Minyoung Lee , Yeji Park , Dongjun Hwang , Yejin Kim , Seong Joon Oh , Junsuk Choe

Sampling-based decoding strategies have been widely adopted for Large Language Models (LLMs) in numerous applications, targeting a balance between diversity and quality via temperature tuning and tail truncation. Considering the strong…

Computation and Language · Computer Science 2025-01-09 Yuxuan Zhou , Margret Keuper , Mario Fritz

Decoding strategies for generative large language models (LLMs) are a critical but often underexplored aspect of text generation tasks. Guided by specific hyperparameters, these strategies aim to transform the raw probability distributions…

Computation and Language · Computer Science 2024-12-17 Esteban Garces Arias , Meimingwei Li , Christian Heumann , Matthias Aßenmacher

Many complex multi-target prediction problems that concern large target spaces are characterised by a need for efficient prediction strategies that avoid the computation of predictions for all targets explicitly. Examples of such problems…

Information Retrieval · Computer Science 2018-03-06 Michiel Stock , Krzysztof Dembczynski , Bernard De Baets , Willem Waegeman
‹ Prev 1 4 5 6 7 8 10 Next ›