paper-with-me

홈 › Papers

Sandwich Reasoning: An Answer-Reasoning-Answer Approach for Low-Latency Query Correction

2026-01-07 · Chen Zhang, Kepu Zhang, Jiatong Zhang, Xiao Zhang, Jun Xu arxiv

Query correction is a critical entry point in modern search pipelines, demanding high accuracy strictly within real-time latency constraints. Chain-of-Thought (CoT) reasoning improves accuracy but incurs prohibitive latency for real-time query correction. A potential solution is to output an answer before reasoning to reduce latency; however, under autoregressive decoding, the early answer is independent of subsequent reasoning, preventing the model from leveraging its reasoning capability to improve accuracy. To address this issue, we propose Sandwich Reasoning (SandwichR), a novel approach that explicitly aligns a fast initial answer with post-hoc reasoning, enabling low-latency query correction without sacrificing reasoning-aware accuracy. SandwichR follows an Answer-Reasoning-Answer paradigm, producing an initial correction, an explicit reasoning process, and a final refined correction. To align the initial answer with post-reasoning insights, we design a consistency-aware reinforcement learning (RL) strategy: a dedicated consistency reward enforces alignment between the initial and final corrections, while margin-based rejection sampling prioritizes borderline samples where reasoning drives the most impactful corrective gains. Additionally, we construct a high-quality query correction dataset, addressing the lack of specialized benchmarks for complex query correction. Experimental results demonstrate that SandwichR achieves SOTA accuracy comparable to standard CoT while delivering a 40-70% latency reduction, resolving the latency-accuracy trade-off in online search.

📄 PDF Abstract BibTeX arXiv:2601.03672

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Self-Commitment Latency: A Reward-Free Probe for Prompted Implicit Hacking

2026-06-04 · Bonan Shen, Youting Wang, Dingyan Shang, Tao Ning arxiv

Implicit reward hacking is hard to audit when a language model's chain of thought appears benign: a final answer may be anchored by a prompt shortcut while the written reasoning still resembles ordinary problem solving. …

Large Language Models Decide Early and Explain Later

2026-04-24 · Ayan Datta, Zhixue Zhao, Bhuvanesh Verma, Radhika Mamidi 외 arxiv

Large Language Models often achieve strong performance by generating long intermediate chain-of-thought reasoning. However, it remains unclear when a model's final answer is actually determined during generation. If the …

Post Reasoning: Improving the Performance of Non-Thinking Models at No Cost

2026-05-07 · Richmond Sin Jing Xuan, Rishabh Bhardwaj, Soujanya Poria arxiv

As the widespread adoption of Large Language Models (LLMs) accelerates, token consumption from intermediate reasoning traces increasingly contributes to inference latency and operational cost. Recent studies suggest that…

Shorter Reasoning, Earlier Answers? An Evaluation of Reasoning Interfaces

2026-08-04 · Francesca Carlon, Vincent Ginis, Andres Algaba arxiv

Large language models often reason at length before answering, increasing cost and latency. Prompts and trained settings can shorten this reasoning, but a shorter trace may only show that the model stopped sooner. Here, …

Stop When Reasoning Converges: Semantic-Preserving Early Exit for Reasoning Models

2026-05-17 · Dehai Min, Giovanni Vaccarino, Huiyi Chen, Yongliang Wu 외 arxiv

Large Reasoning Models (LRMs) achieve strong performance by generating long chains of thought (CoT), but often overthink, continuing to reason after a solution has already stabilized and thereby wasting tokens and increa…

Code Generation