Research
FROST: Filtering Reasoning Outliers with Attention for Efficient Reasoning
Overview Research area: Efficient reasoning in large reasoning models (LRMs) — specifically, using internal attention signals to prune redundant reasoning steps during mathematical problem solving. Te
- arXiv
- 2601.19001
- Published
- 2026-01-26
- Authors
- Haozheng Luo, Zhuolin Jiang, Md Zahid Hasan, Yan Chen, Soumalya Sarkar
AI summary
Overview
Research area: Efficient reasoning in large reasoning models (LRMs) — specifically, using internal attention signals to prune redundant reasoning steps during mathematical problem solving.
Technical level: Intermediate. Readers should be comfortable with transformer attention, softmax normalization, and supervised fine-tuning concepts, but the paper's core idea is intuitive.
Scope: This paper introduces a method that replaces the standard softmax in attention with a variant called Softmax₁ to suppress low-attention "reasoning outliers," then fine-tunes reasoning models to produce shorter, more accurate reasoning traces.
What This Paper Is About
Large reasoning models (like Phi-4-Reasoning and GPT-OSS-20B) solve math problems by generating long chains of intermediate steps, but many of those steps are redundant self-checks, repetitions, or irrelevant detours that waste computation and can even introduce errors. The authors call these useless steps reasoning outliers and show that they consistently receive low attention weights from the model's own transformer layers. FROST's goal is to automatically identify and eliminate these outliers during training so that the resulting model reasons more concisely without losing accuracy.
Key Contributions
-
Definition and diagnosis of "reasoning outliers." The authors formalize the concept of reasoning steps that receive low attention weight and contribute negligibly to the final answer token, and they empirically show these steps dominate many LRM outputs.
-
Softmax₁ as a reasoning-outlier filter. They replace the standard softmax with Softmax₁ (softmax with an added +1 in the denominator), which selectively drives very low attention weights toward zero while preserving high-attention weights. This is adapted to sentence-level reasoning rather than token-level sparsity.
-
A lightweight SFT training recipe. They combine Softmax₁ with supervised fine-tuning and LoRA adapters, achieving effective outlier removal in only a few fine-tuning steps from an existing checkpoint — far cheaper than prior methods requiring training from scratch or multi-step continual learning.
-
Theoretical and empirical validation. They prove that Softmax₁ contracts heavy-tailed sentence-level attention distributions and that low-attention sentences contribute only O(ε) to the output logits, then confirm the effect across three base models and four math benchmarks.
Main Findings
-
Large efficiency and accuracy gains: Across three base models (Phi-4-Reasoning, GPT-OSS-20B, Magistral-Small-1.1) and four benchmarks (GSM8K, MATH500, AIME24, Minerva), FROST achieves an average 69.68% reduction in token usage and a 26.70% average relative accuracy improvement over the base models.
-
Outperforms state-of-the-art efficient reasoning baselines: FROST beats TALE, DRP, SelfBudgeter, and ThinkLess on most benchmark-metric combinations. Baselines like TALE occasionally reach higher raw accuracy but at the cost of much longer outputs.
-
Softmax₁ beats other sharpening activations: Compared with vanilla Softmax, Sparsemax, and Entmax15, Softmax₁ delivers the best overall tradeoff (+15.65% average accuracy, −68.18% tokens vs. base). Entmax15 and Sparsemax sharpen both high- and low-attention weights, which the authors argue can inadvertently delete critical reasoning steps.
-
Outlier metrics confirm the mechanism: On AIME2024 with Phi-4-Reasoning, FROST reduces the maximum infinity norm of activations by 15.97%, the average kurtosis by 91.09%, and increases average sentence entropy by 13.28% — evidence that the model is concentrating on critical sentences.
-
Generalizes beyond math: Fine-tuned only on math data, FROST also improves Pass@1 on LeetCode, LiveCodeBench, and UGPhysics, showing that outlier removal transfers across reasoning domains.
-
Compute savings beyond token count: FROST cuts inference time by at least 28.6% and training time by 42.2% relative to other SFT baselines.
-
Occasional trade-off: FROST can sometimes prune low-attention steps that happen to be important, which explains why it is not always the top scorer on every individual benchmark.
Methodology in Plain English
The authors start by running a reasoning model on math problems and inspecting attention heatmaps across transformer layers. They observe that in shallow layers attention is spread evenly, but in deeper layers, attention concentrates on a small subset of reasoning sentences that actually influence the final answer token — while many other sentences receive almost no attention.
They then swap out the standard softmax in the attention mechanism for Softmax₁, a variant with an extra "+1" in the denominator. Mathematically, this extra term makes tiny attention scores become disproportionately tiny (close to zero) while leaving large scores nearly unchanged — a form of one-sided sparsification. Since the model's own attention already assigns low scores to useless steps, Softmax₁ effectively zeroes them out.
To make the pretrained model adapt to this new activation function, they run a small amount of supervised fine-tuning on the OpenR1 math dataset, using LoRA adapters and cross-entropy loss to keep training cheap. They then evaluate on held-out math benchmarks and additional coding/physics tasks to check that the model hasn't lost general reasoning ability.
Why This Matters
Impact on research: This work bridges two normally separate threads — attention-sparsity techniques (from efficient transformer literature) and reasoning-efficiency methods (from LLM reasoning literature). By framing redundant reasoning steps as attention outliers, it gives a mechanistic, interpretable explanation for why long reasoning chains are inefficient, and it shows that a relatively minor architectural change plus lightweight fine-tuning can replace heavier prompt-engineering or RL-based approaches.
Real-world applications:
-
Cost-efficient LLM deployment: A ~70% reduction in generated tokens directly translates to lower inference cost for any product running reasoning models at scale (chat assistants, tutoring systems, customer support).
-
Latency-sensitive applications: Shorter reasoning traces mean faster responses, useful for interactive coding assistants, real-time math solvers, and voice-based AI agents.
-
Edge and on-device reasoning: Lower token counts and reduced compute make smaller reasoning models more practical on hardware with limited memory or power budgets.
-
Education and tutoring tools: Cleaner reasoning traces are easier to read and grade, improving the transparency of step-by-step solutions shown to students.
Industry relevance: Companies that serve reasoning models (OpenAI, Microsoft, Mistral, Google, and enterprises built on their APIs) pay per token, so efficiency methods like FROST have direct cost implications. The LoRA-based training recipe is also attractive to teams that cannot afford full fine-tuning or reinforcement learning pipelines.
Future Directions
-
Extending beyond math: The authors explicitly note that FROST is currently validated mainly on mathematical reasoning; applying it to coding, scientific QA, and agentic tasks is an open direction.
-
Combining with reinforcement learning: Integrating FROST with GRPO or other RL fine-tuning methods could compound the efficiency gains, since FROST currently uses SFT only.
-
Characterizing failure cases: FROST sometimes prunes low-attention sentences that turn out to be important. Understanding when attention is a misleading signal — and designing safeguards — remains an open problem.
-
Cross-architecture generality: All experiments use LoRA fine-tuning on a handful of models. Whether Softmax₁ benefits models trained from scratch, mixture-of-experts architectures, or very large-scale models is untested.
-
Unifying with KV-cache compression: The paper mentions related work (Think Clearly, R-KV) that prunes redundancy for KV-cache efficiency; a combined approach that operates on both reasoning content and cache footprint could yield larger gains.
Target Audience
This paper is most valuable for machine learning researchers and engineers working on LLM inference efficiency, reasoning models, or attention mechanisms — particularly those interested in sparsity-based methods, transformer internals, or low-cost fine-tuning recipes. Practitioners deploying reasoning models in production will also benefit from the concrete efficiency numbers and the practical LoRA-based training pipeline. Readers without background in transformer attention will find the high-level idea accessible, but the theoretical section (Assumption 5.1, Theorems 5.1–5.2) requires comfort with real analysis and operator norms.
Authors’ abstract
We propose FROST, an attention-aware method for efficient reasoning. Unlike traditional approaches, FROST leverages attention weights to prune uncritical reasoning paths, yielding shorter and more reliable reasoning trajectories. Methodologically, we introduce the concept of reasoning outliers and design an attention-based mechanism to remove them. Theoretically, FROST preserves and enhances the model's reasoning capacity while eliminating outliers at the sentence level. Empirically, we validate FROST on four benchmarks using two strong reasoning models (Phi-4-Reasoning and GPT-OSS-20B), outperforming state-of-the-art methods such as TALE and ThinkLess. Notably, FROST achieves an average 69.68% reduction in token usage and a 26.70% improvement in accuracy over the base model. Furthermore, in evaluations of attention outlier metrics, FROST reduces the maximum infinity norm by 15.97% and the average kurtosis by 91.09% compared to the base model. Code is available at https://github.com/robinzixuan/FROST