English
Related papers

Related papers: AutoJudge: Judge Decoding Without Manual Annotatio…

200 papers

Token-level attention tuning, a class of training-free methods including Post-hoc Attention Steering (PASTA) and Attention Calibration (ACT), has emerged as a promising approach for improving frozen LLMs via interpretable interventions.…

Computation and Language · Computer Science 2026-02-12 Feijiang Han , Xiaodong Yu , Jianheng Tang , Delip Rao , Weihua Du , Lyle Ungar

Recent advancements in speculative decoding have demonstrated considerable speedup across a wide array of large language model (LLM) tasks. Speculative decoding inherently relies on sacrificing extra memory allocations to generate several…

Machine Learning · Computer Science 2025-06-04 Selin Yildirim , Deming Chen

Autoregressive decoding in Large Language Models (LLMs) generates one token per step, causing high inference latency. Speculative decoding (SD) mitigates this through a guess-and-verify strategy, but existing training-free variants face…

Computation and Language · Computer Science 2026-04-17 Zihong Zhang , Zuchao Li , Lefei Zhang , Ping Wang , Hai Zhao

Relevance judgments are crucial for evaluating information retrieval systems, but traditional human-annotated labels are time-consuming and expensive. As a result, many researchers turn to automatic alternatives to accelerate method…

Information Retrieval · Computer Science 2025-07-15 Naghmeh Farzi , Laura Dietz

Large Language Models (LLMs) present a critical trade-off between inference quality and computational cost: larger models offer superior capabilities but incur significant latency, while smaller models are faster but less powerful. Existing…

Machine Learning · Computer Science 2025-05-13 Hang Wu , Jianian Zhu , Yinghui Li , Haojie Wang , Biao Hou , Jidong Zhai

Speculative decoding (SD) accelerates large language model inference by allowing a lightweight draft model to propose outputs that a stronger target model verifies. However, its token-centric nature allows erroneous steps to propagate.…

Computation and Language · Computer Science 2026-04-17 Kiran Purohit , Ramasuri Narayanam , Soumyabrata Pal

The ability to rigorously estimate the failure rates of large language models (LLMs) is a prerequisite for their safe deployment. Currently, however, practitioners often face a tradeoff between expensive human gold standards and potentially…

Computation and Language · Computer Science 2026-04-07 Minghe Shen , Ananth Balashankar , Adam Fisch , David Madras , Miguel Rodrigues

Speculative decoding has emerged as an effective approach for accelerating autoregressive inference by parallelizing token generation through a draft-then-verify paradigm. However, existing methods rely on static drafting lengths and rigid…

Computation and Language · Computer Science 2026-05-29 Jaydip Sen , Subhasis Dasgupta , Hetvi Waghela

Large language models (LLMs) are increasingly used as raters for evaluation tasks. However, their reliability is often limited for subjective tasks, when human judgments involve subtle reasoning beyond annotation labels. Thinking traces,…

Artificial Intelligence · Computer Science 2026-02-23 Xingjian Zhang , Tianhong Gao , Suliang Jin , Tianhao Wang , Teng Ye , Eytan Adar , Qiaozhu Mei

Autoformalization plays a crucial role in formal mathematical reasoning by enabling the automatic translation of natural language statements into formal languages. While recent advances using large language models (LLMs) have shown…

Computation and Language · Computer Science 2025-06-13 Lan Zhang , Marco Valentino , Andre Freitas

Using Large Language Models (LLMs) in real-world applications presents significant challenges, particularly in balancing computational efficiency with model performance. Optimizing acceleration after fine-tuning and during inference is…

Computation and Language · Computer Science 2025-09-09 Sajjad Kachuee , Mohammad Sharifkhani

Speculative decoding is an inference-acceleration method for large language models (LLMs) where a small language model generates a draft-token sequence which is further verified by the target LLM in parallel. Recent works have advanced this…

Machine Learning · Computer Science 2024-03-06 Wonseok Jeon , Mukul Gagrani , Raghavv Goel , Junyoung Park , Mingu Lee , Christopher Lott

Large language model (LLM)-based judges are widely adopted for automated evaluation and reward modeling, yet their judgments are often affected by judgment biases. Accurately evaluating these biases is essential for ensuring the reliability…

Computation and Language · Computer Science 2026-03-10 Hongli Zhou , Hui Huang , Rui Zhang , Kehai Chen , Bing Xu , Conghui Zhu , Tiejun Zhao , Muyun Yang

The recent advancements in large language models (LLMs) have been extraordinary, yet the escalating inference costs associated with them present challenges in real-world applications. To address these challenges, we propose a novel approach…

Computation and Language · Computer Science 2024-06-07 Jiahao Liu , Qifan Wang , Jingang Wang , Xunliang Cai

Text generation with Large Language Models (LLMs) is known to be memory bound due to the combination of their auto-regressive nature, huge parameter counts, and limited memory bandwidths, often resulting in low token rates. Speculative…

Machine Learning · Computer Science 2024-05-15 Raghavv Goel , Mukul Gagrani , Wonseok Jeon , Junyoung Park , Mingu Lee , Christopher Lott

With the increasingly giant scales of (causal) large language models (LLMs), the inference efficiency comes as one of the core concerns along the improved performance. In contrast to the memory footprint, the latency bottleneck seems to be…

Computation and Language · Computer Science 2024-04-24 Chen Zhang , Zhuorui Liu , Dawei Song

The evaluation bottleneck in recommendation systems has become particularly acute with the rise of Generative AI, where traditional metrics fall short of capturing nuanced quality dimensions that matter in specialized domains like legal…

Computation and Language · Computer Science 2025-12-30 Anu Pradhan , Alexandra Ortan , Apurv Verma , Madhavan Seshadri

Clinical trials are critical for advancing medical treatments but remain prohibitively expensive and time-consuming. Accurate prediction of clinical trial outcomes can significantly reduce research and development costs and accelerate drug…

Machine Learning · Computer Science 2025-06-06 Fengze Liu , Haoyu Wang , Joonhyuk Cho , Dan Roth , Andrew W. Lo

Inference with modern Large Language Models (LLMs) is expensive and time-consuming, and speculative sampling has proven to be an effective solution. Most speculative sampling methods such as EAGLE use a static draft tree, implicitly…

Computation and Language · Computer Science 2024-07-02 Yuhui Li , Fangyun Wei , Chao Zhang , Hongyang Zhang

Speculative decoding is a powerful technique that attempts to circumvent the autoregressive constraint of modern Large Language Models (LLMs). The aim of speculative decoding techniques is to improve the average inference time of a large,…

Computation and Language · Computer Science 2024-10-25 Sudhanshu Agrawal , Wonseok Jeon , Mingu Lee