English
Related papers

Related papers: Beyond the Frontier: Stochastic Backtracking for E…

200 papers

Transferable backdoors pose a severe threat to the Pre-trained Language Models (PLMs) supply chain, yet defensive research remains nascent, primarily relying on detecting anomalies in the output feature space. We identify a critical flaw…

Cryptography and Security · Computer Science 2025-12-09 Tianhang Zhao , Wei Du , Haodong Zhao , Sufeng Duan , Gongshen Liu

Soft prompt tuning techniques have recently gained traction as an effective strategy for the parameter-efficient tuning of pretrained language models, particularly minimizing the required adjustment of model parameters. Despite their…

Computation and Language · Computer Science 2024-06-11 MohammadAli SadraeiJavaeri , Ehsaneddin Asgari , Alice Carolyn McHardy , Hamid Reza Rabiee

Prompt-based techniques, such as prompt-tuning and prefix-tuning, have gained prominence for their efficiency in fine-tuning large pre-trained models. Despite their widespread adoption, the theoretical foundations of these methods remain…

Machine Learning · Computer Science 2025-04-03 Minh Le , Chau Nguyen , Huy Nguyen , Quyen Tran , Trung Le , Nhat Ho

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

Prompt engineering is an essential technique for enhancing the abilities of large language models (LLMs) by providing explicit and specific instructions. It enables LLMs to excel in various tasks, such as arithmetic reasoning, question…

Computation and Language · Computer Science 2024-03-29 Fobo Shi , Peijun Qing , Dong Yang , Nan Wang , Youbo Lei , Haonan Lu , Xiaodong Lin , Duantengchuan Li

Supervised fine-tuning (SFT) is crucial for aligning Large Language Models (LLMs) with human instructions. The primary goal during SFT is to select a small yet representative subset of training data from the larger pool, such that…

Computation and Language · Computer Science 2024-12-10 Tingyu Xia , Bowen Yu , Kai Dang , An Yang , Yuan Wu , Yuan Tian , Yi Chang , Junyang Lin

Recent advances have demonstrated that large language models (LLMs) excel as listwise rerankers, but their high computational demands remain a barrier to widespread adoption. Further, the traditional language modeling (LM) objective is not…

Information Retrieval · Computer Science 2024-11-13 Zijian Chen , Ronak Pradeep , Jimmy Lin

Large language models (LLMs) have demonstrated significant utility in real-world applications, exhibiting impressive capabilities in natural language processing and understanding. Benchmark evaluations are crucial for assessing the…

Computation and Language · Computer Science 2026-05-12 Wenbo Zhang , Hengrui Cai , Wenyu Chen

We present a framework for optimizing prompts in vision-language models to elicit multimodal reasoning without model retraining. Using an evolutionary algorithm to guide prompt updates downstream of visual tasks, our approach improves upon…

Computation and Language · Computer Science 2025-04-01 Sid Bharthulwar , John Rho , Katrina Brown

Large language models (LLM) trained using the next-token-prediction objective, such as GPT3 and PaLM, have revolutionized natural language processing in recent years by showing impressive zero-shot and few-shot capabilities across a wide…

Computation and Language · Computer Science 2023-02-01 Hao Liu , Xinyang Geng , Lisa Lee , Igor Mordatch , Sergey Levine , Sharan Narang , Pieter Abbeel

Linear interpolation between fine-tuned checkpoints has been shown to trace the Pareto front between competing objectives, but whether extrapolative weight averaging can extend such frontiers to new checkpoints useful at inference time,…

Machine Learning · Computer Science 2026-05-28 Kunhao Zheng , Pierre Chambon , Juliette Decugis , Jonas Gehring , Taco Cohen , Benjamin Negrevergne , Gabriel Synnaeve

In this work, we explore "prompt tuning", a simple yet effective mechanism for learning "soft prompts" to condition frozen language models to perform specific downstream tasks. Unlike the discrete text prompts used by GPT-3, soft prompts…

Computation and Language · Computer Science 2021-09-03 Brian Lester , Rami Al-Rfou , Noah Constant

Process Reward Models (PRMs) provide step-level supervision that improves the reliability of reasoning in large language models. While PRMs have been extensively studied in text-based domains, their extension to Vision Language Models…

Artificial Intelligence · Computer Science 2025-10-08 Brandon Ong , Tej Deep Pala , Vernon Toh , William Chandra Tjhi , Soujanya Poria

Deep research agents rely on iterative retrieval and reasoning to answer complex queries, but scaling test-time computation raises significant efficiency concerns. We study how to allocate reasoning budget in deep search pipelines, focusing…

Information Retrieval · Computer Science 2026-01-21 Sahel Sharifymoghaddam , Jimmy Lin

As Large Language Models (LLMs) scale, data curation has shifted from maximizing volume to optimizing the signal-to-noise ratio by performing quality filtering. However, for many languages, native high quality data is insufficient to train…

Computation and Language · Computer Science 2026-04-23 Yassine Turki , Vinko Sabolčec , Bettina Messmer , Martin Jaggi

While language models have shown remarkable performance across diverse tasks, they still encounter challenges in complex reasoning scenarios. Recent research suggests that language models trained on linearized search traces toward…

Artificial Intelligence · Computer Science 2025-10-28 Seungyong Moon , Bumsoo Park , Hyun Oh Song

Sampling-based search, a simple paradigm for utilizing test-time compute, involves generating multiple candidate responses and selecting the best one -- typically by having models self-verify each response for correctness. In this paper, we…

Machine Learning · Computer Science 2025-02-21 Eric Zhao , Pranjal Awasthi , Sreenivas Gollapudi

Text generation has a fundamental limitation almost by definition: there is no taking back tokens that have been generated, even when they are clearly problematic. In the context of language model safety, when a partial unsafe generation is…

Machine Learning · Computer Science 2024-09-24 Yiming Zhang , Jianfeng Chi , Hailey Nguyen , Kartikeya Upasani , Daniel M. Bikel , Jason Weston , Eric Michael Smith

Test-time scaling has emerged as a promising paradigm in language modeling, leveraging additional computational resources at inference time to enhance model performance. In this work, we introduce R2-LLMs, a novel and versatile hierarchical…

Computation and Language · Computer Science 2025-07-09 Alex ZH Dou , Zhongwei Wan , Dongfei Cui , Xin Wang , Jing Xiong , Haokun Lin , Chaofan Tao , Shen Yan , Mi Zhang

The newly released OpenAI-o1 and DeepSeek-R1 have demonstrated that test-time scaling can significantly improve model performance, especially in complex tasks such as logical reasoning. Common test-time scaling methods involve generating…

Computation and Language · Computer Science 2025-10-01 Zhendong Tan , Xingjun Zhang , Chaoyi Hu , Yancheng Pan , Shaoxun Wang