English
Related papers

Related papers: Cross-Family Speculative Prefill: Training-Free Lo…

200 papers

Scaling the size of language models to tens of billions of parameters has led to impressive performance on a wide range of tasks. At generation, these models are used auto-regressively, requiring a forward pass for each generated token, and…

Computation and Language · Computer Science 2023-11-23 Giovanni Monea , Armand Joulin , Edouard Grave

The quadratic complexity of self-attention during the prefill phase impedes long-context inference in large language models. Existing sparse attention methods face a trade-off among context adaptivity, sampling overhead, and fine-tuning…

Machine Learning · Computer Science 2026-03-06 Chen Guanzhong

Prompting has become a practical method for utilizing pre-trained language models (LMs). This approach offers several advantages. It allows an LM to adapt to new tasks with minimal training and parameter updates, thus achieving efficiency…

Audio and Speech Processing · Electrical Eng. & Systems 2024-08-26 Kai-Wei Chang , Haibin Wu , Yu-Kai Wang , Yuan-Kuei Wu , Hua Shen , Wei-Cheng Tseng , Iu-thing Kang , Shang-Wen Li , Hung-yi Lee

Large language models are increasingly used as proxies for human subjects in social science research, yet external validity requires that synthetic agents faithfully reflect the preferences of target human populations. We introduce…

Artificial Intelligence · Computer Science 2026-01-30 Bingchen Wang , Zi-Yu Khoo , Jingtan Wang

Large Language Models excel in tasks like natural language understanding and text generation. Prompt engineering plays a critical role in leveraging LLM effectively. However, LLMs black-box nature hinders its interpretability and effective…

Computation and Language · Computer Science 2024-10-31 Ximing Dong , Shaowei Wang , Dayi Lin , Gopi Krishnan Rajbahadur , Boquan Zhou , Shichao Liu , Ahmed E. Hassan

Large Language Models (LLMs) face efficiency bottlenecks due to the quadratic complexity of the attention mechanism when processing long contexts. Sparse attention methods offer a promising solution, but existing approaches often suffer…

Computation and Language · Computer Science 2025-03-06 Lida Chen , Dong Xu , Chenxin An , Xintao Wang , Yikai Zhang , Jiangjie Chen , Zujie Liang , Feng Wei , Jiaqing Liang , Yanghua Xiao , Wei Wang

Speculative decoding has become a widely adopted technique for accelerating large language model (LLM) inference by drafting multiple candidate tokens and verifying them with a target model in parallel. Its efficiency, however, critically…

Computation and Language · Computer Science 2026-05-19 Shuoyang Sun , Chang Dai , Hao Fang , Kuofeng Gao , Xinhao Zhong , Yi Sun , Fan Mo , Shu-Tao Xia , Bin Chen

Context-based fine-tuning methods, including prompting, in-context learning, soft prompting (also known as prompt tuning), and prefix-tuning, have gained popularity due to their ability to often match the performance of full fine-tuning…

Machine Learning · Computer Science 2024-04-10 Aleksandar Petrov , Philip H. S. Torr , Adel Bibi

Large Language Models (LLMs) often experience performance degradation during long-running interactions due to increasing context length, memory saturation, and computational overhead. This paper presents an adaptive context compression…

Computer Vision and Pattern Recognition · Computer Science 2026-04-01 Payal Fofadiya , Sunil Tiwari

Speculative decoding has emerged as a promising technique for large language model (LLM) inference by accelerating autoregressive decoding via draft-then-verify. This paper studies a new edge scenario with multi-user inference, where draft…

Information Theory · Computer Science 2026-04-24 Yaodan Xu , Sheng Zhou , Zhisheng Niu

As language models (LMs) deliver increasing performance on a range of NLP tasks, probing classifiers have become an indispensable technique in the effort to better understand their inner workings. A typical setup involves (1) defining an…

Computation and Language · Computer Science 2024-08-01 Charles Jin , Martin Rinard

Prompt Tuning has emerged as a prominent research paradigm for adapting vision-language models to various downstream tasks. However, recent research indicates that prompt tuning methods often lead to overfitting due to limited training…

Computer Vision and Pattern Recognition · Computer Science 2024-12-23 Jingchen Sun , Rohan Sharma , Vishnu Suresh Lokhande , Changyou Chen

Click-through rate (CTR) prediction has become increasingly indispensable for various Internet applications. Traditional CTR models convert the multi-field categorical data into ID features via one-hot encoding, and extract the…

Information Retrieval · Computer Science 2024-06-27 Jianghao Lin , Bo Chen , Hangyu Wang , Yunjia Xi , Yanru Qu , Xinyi Dai , Kangning Zhang , Ruiming Tang , Yong Yu , Weinan Zhang

Speculative decoding has emerged as a promising approach to accelerate autoregressive inference in large language models (LLMs). Self-draft methods, which leverage the base LLM itself for speculation, avoid the overhead of auxiliary draft…

Computation and Language · Computer Science 2026-04-15 Zhuofan Wen , Yang Feng

Large reasoning models (LRMs) such as Claude 3.7 Sonnet and OpenAI o1 achieve strong performance on mathematical benchmarks using lengthy chain-of-thought (CoT) reasoning, but the resulting traces are often unnecessarily verbose. This…

Computation and Language · Computer Science 2025-06-13 Ye Yu , Yaoning Yu , Haohan Wang

The quadratic complexity of attention remains the central bottleneck in long-context inference for large language models. Prior acceleration methods either sparsify the attention map with structured patterns or permanently evict tokens at…

Computation and Language · Computer Science 2026-05-04 Dongwon Jo , Beomseok Kang , Jiwon Song , Jae-Joon Kim

Prompt-based learning has emerged as a parameter-efficient finetuning (PEFT) approach to facilitate Large Language Model (LLM) adaptation to downstream tasks by conditioning generation with task-aware guidance. Despite its successes,…

Computation and Language · Computer Science 2025-10-21 Yiyang Liu , James C. Liang , Heng Fan , Wenhao Yang , Yiming Cui , Xiaotian Han , Lifu Huang , Dongfang Liu , Qifan Wang , Cheng Han

Recent work has shown that inference-time reasoning and reflection can improve text-to-image generation without retraining. However, existing approaches often rely on implicit, holistic critiques or unconstrained prompt rewrites, making…

Computer Vision and Pattern Recognition · Computer Science 2026-01-22 V. Kovalev , A. Kuvshinov , A. Buzovkin , D. Pokidov , D. Timonin

Language Reasoning Models (LRMs) achieve strong performance by scaling test-time computation but often suffer from ``overthinking'', producing excessively long reasoning traces that increase latency and memory usage. Existing LRMs typically…

As large language models (LLMs) are adopted as a fundamental component of language technologies, it is crucial to accurately characterize their performance. Because choices in prompt design can strongly influence model behavior, this design…

Computation and Language · Computer Science 2024-07-03 Melanie Sclar , Yejin Choi , Yulia Tsvetkov , Alane Suhr
‹ Prev 1 8 9 10 Next ›