English
Related papers

Related papers: Selection-p: Self-Supervised Task-Agnostic Prompt …

200 papers

Large language models (LLMs) have demonstrated remarkable performance across a wide range of industrial applications, from search and recommendation systems to generative tasks. Although scaling laws indicate that larger models generally…

Large Language Models (LLMs) demonstrate exceptional reasoning abilities, enabling strong generalization across diverse tasks such as commonsense reasoning and instruction following. However, as LLMs scale, inference costs become…

Computation and Language · Computer Science 2025-02-06 Rhea Sanjay Sukthanker , Benedikt Staffler , Frank Hutter , Aaron Klein

Large language models (LLMs) process entire input contexts indiscriminately, which is inefficient when the information required to answer a query is localized within the context. We present dynamic context cutoff, a novel method enabling…

Computation and Language · Computer Science 2026-02-10 Roy Xie , Junlin Wang , Paul Rosu , Chunyuan Deng , Bolun Sun , Zihao Lin , Bhuwan Dhingra

Large Language Models (LLMs) have transformed natural language processing, but face significant challenges in widespread deployment due to their high runtime cost. In this paper, we introduce SeedLM, a novel post-training compression method…

Large language models (LLMs) have demonstrated remarkable proficiency in machine translation (MT), even without specific training on the languages in question. However, translating rare words in low-resource or domain-specific contexts…

Computation and Language · Computer Science 2024-11-14 Shangfeng Chen , Xiayang Shi , Pu Li , Yinlin Li , Jingjing Liu

In-context learning (ICL) has emerged as a new approach to various natural language processing tasks, utilizing large language models (LLMs) to make predictions based on context that has been supplemented with a few examples or…

Computation and Language · Computer Science 2023-05-23 Linyong Nan , Yilun Zhao , Weijin Zou , Narutatsu Ri , Jaesung Tae , Ellen Zhang , Arman Cohan , Dragomir Radev

Large Language Models (LLMs) have achieved remarkable performance across a wide range of Natural Language Processing (NLP) tasks. However, in long-context scenarios, they face two challenges: high computational cost and information…

Computation and Language · Computer Science 2026-02-10 Jiwei Tang , Zhicheng Zhang , Shunlong Wu , Jingheng Ye , Lichen Bai , Zitai Wang , Tingwei Lu , Lin Hai , Yiming Zhao , Hai-Tao Zheng , Hong-Gee Kim

Large language models (LMs) are currently trained to predict tokens given document prefixes, enabling them to directly perform long-form generation and prompting-style tasks which can be reduced to document completion. Existing pretraining…

Large language models (LLMs) achieve impressive results over various tasks, and ever-expanding public repositories contain an abundance of pre-trained models. Therefore, identifying the best-performing LLM for a given task is a significant…

Computation and Language · Computer Science 2025-11-13 Idan Kashani , Avi Mendelson , Yaniv Nemcovsky

Approaches for compressing large-language models using low-rank decomposition have made strides, particularly with the introduction of activation and loss-aware SVD, which improves the trade-off between decomposition rank and downstream…

Machine Learning · Computer Science 2025-12-17 Sidhant Sundrani , Francesco Tudisco , Pasquale Minervini

Context compression aims to shorten long context inputs with minimal information loss for LLM inference acceleration. While existing methods have shown promise, they typically rely on complex compression modules or compression-specific…

Artificial Intelligence · Computer Science 2026-05-28 Guoxin Ma , Yibing Liu , Chengzhengxu Li , Yu Liang , Yan Wang , Yueyang Zhang , Kecheng Chen , Zhaohan Zhang , Zhiyuan Sun , Daiting Shi

Prompt tuning (PT) offers a cost-effective alternative to fine-tuning large-scale pre-trained language models (PLMs), requiring only a few parameters in soft prompt tokens added before the input text. However, existing PT approaches face…

Computation and Language · Computer Science 2025-02-19 Pengxiang Lan , Haoyu Xu , Enneng Yang , Yuliang Liang , Guibing Guo , Jianzhe Zhao , Xingwei Wang

Large language models (LLMs) effectively generate fluent text when the target output follows natural language patterns. However, structured prediction tasks confine the output format to a limited ontology, causing even very large models to…

Computation and Language · Computer Science 2023-10-19 Derek Chen , Celine Lee , Yunan Lu , Domenic Rosati , Zhou Yu

Recent developments in text classification using Large Language Models (LLMs) in the social sciences suggest that costs can be cut significantly, while performance can sometimes rival existing computational methods. However, with a wide…

Computation and Language · Computer Science 2026-03-27 Erkan Gunes , Christoffer Florczak , Tevfik Murat Yildirim

Explicit chain-of-thought (CoT) reasoning substantially improves the reasoning ability of large language models (LLMs), but incurs high inference cost due to lengthy autoregressive traces. Existing latent reasoning methods offer a promising…

Computation and Language · Computer Science 2026-05-26 Hui Xie , Jie Liu , Ziyue Qiao , Joaquin Vanschore

Large language models (LLMs) require lengthy prompts as the input context to produce output aligned with user intentions, a process that incurs extra costs during inference. In this paper, we propose the Gist COnditioned deCOding…

Computation and Language · Computer Science 2024-02-27 Xinze Li , Zhenghao Liu , Chenyan Xiong , Shi Yu , Yukun Yan , Shuo Wang , Ge Yu

Grammar-based compression is a popular and powerful approach to compressing repetitive texts but until recently its relatively poor time-space trade-offs during real-life construction made it impractical for truly massive datasets such as…

Data Structures and Algorithms · Computer Science 2020-07-21 Travis Gagie , Tomohiro I , Giovanni Manzini , Gonzalo Navarro , Hiroshi Sakamoto , Louisa Seelbach Benkner , Yoshimasa Takabatake

Recent reasoning Large Language Models (LLMs) demonstrate remarkable problem-solving abilities but often generate long thinking traces whose utility is unclear. Our work aims to improve their efficiency, enabling them to reach high…

Computation and Language · Computer Science 2026-05-11 Xiang Liu , Xuming Hu , Xiaowen Chu , Eunsol Choi

Large language models (LLMs) have achieved substantial progress in processing long contexts but still struggle with long-context reasoning. Existing approaches typically involve fine-tuning LLMs with synthetic data, which depends on…

Computation and Language · Computer Science 2024-11-14 Siheng Li , Cheng Yang , Zesen Cheng , Lemao Liu , Mo Yu , Yujiu Yang , Wai Lam

Large language models (LLMs) have achieved remarkable success in many natural language processing (NLP) tasks. To achieve more accurate output, the prompts used to drive LLMs have become increasingly longer, which incurs higher…

Computation and Language · Computer Science 2025-09-19 Yaxin Gao , Yao Lu , Zongfei Zhang , Jiaqi Nie , Shanqing Yu , Qi Xuan