arXiv AI

SyRuP: Enhancing System-Prompt Following via Reward-Guided Prediction in LLM Decoding

arXiv:2607. 23991v1 Announce Type: cross Abstract: Large Language Models (LLMs) are increasingly controlled through system prompts that specify roles, styles, formats, and safety requirements.

arXiv Computation and Language
Aug 31

Learning a Single Token to Replace Long System Prompts in LLMs

arXiv:2511.23271v2 Announce Type: replace Abstract: Long system prompts are widely used to steer Large Language Models (LLMs), but repeatedly processing them at inference time is inefficient and cons...

By Jiancheng Dong, Pengyue Jia, Jingyu Peng, Maolin Wang, Yuhao Wang, Lixin Su, Xin Sun, Shuaiqiang Wang, Dawei Yin, Xiangyu Zhao
Hugging Face Trending Papers
Jul 2

PARTREP: Learning What to Repeat for Decoder-only LLMs

While decoder-only LLMs excel at a vast array of natural language tasks, it suffers from an asymmetric information flow induced by causal attention: later tokens are richer in contextual grounding than earlier ones. A simple and effective remedy is prompt repetition -- just appending a second copy of prompt before generation can redistribute grounding across positions and improve reasoning performance.

arXiv AI
Sep 12

Beyond Confidence: Stability-Aware Test-Time Adaptation for LLM Reasoning

The paper introduces TASCO, a test‑time adaptation framework that enhances Large Language Model reasoning by incorporating local stability into confidence‑based adaptation while keeping the model frozen. TASCO optimizes a lightweight task‑level prefix using two perturbation strategies—Random Perturbation for distributional stability and Sharpness‑Aware Perturbation for worst‑case sensitivity—to ensure that high confidence aligns with correctness. Experiments show that TASCO improves reasoning accuracy and token efficiency across various LLMs and benchmarks, and behavioral analyses confirm that it maintains stable confidence without over‑concentrating the predictive distribution.

By Bincheng Gu, Min Gao, Zongwei Wang, Yibing Bai, Yulan He, Junliang Yu
arXiv Machine Learning
Sep 3

When Prompts Interact: Assessing Prompt Arithmetic for Deconfounding under Distribution Shift

The paper investigates how combining soft prompts via task arithmetic can reduce reliance on confounding variables in classification models. It introduces Hybrid Prompt Arithmetic (HyPA), which merges task prompts with linearized confounder prompts to counteract spurious correlations. Experiments across multiple benchmarks show that HyPA consistently improves the robustness‑performance trade‑off under distribution shift, and analysis of hidden representations suggests it mitigates confounding by diminishing the influence of confounder signals.

By Zhecheng Sheng, Yongsen Tan, Xiruo Ding, Trevor Cohen, Serguei Pakhomov