Skip to content

CritICL: Inference-Time Weak-to-Strong Generalization from Small Language Model Failure Modes

Aug 2026 · 1 citation · 27 references
Computer Science

TL;DR

Experimental results show that CritICL consistently outperforms standard in-context learning and achieves performance competitive with or superior to test-time scaling methods, while requiring significantly fewer generations and lower token cost.

Abstract

Recent advances in inference-time scaling have significantly improved the reasoning performance of large language models (LLMs). However, these methods typically rely on repeated generation or external verification. To address this limitation, we introduce CritICL, a novel inference-time framework that improves reasoning while maintaining high efficiency. Our key insight is that LLM failure modes exhibit structured patterns across model scales within the same family. Instead of treating failures as undesirable outputs, CritICL leverages them as a source of guidance. Specifically, we utilize failure modes derived from weaker models and incorporate them into inference through critique-based in-context examples. We propose two variants: CritICL-dynamic, which adaptively predicts input-specific failure modes and retrieves critiques, and CritICL-static, which uses a global failure mode profile to provide stable guidance. Experimental results show that CritICL consistently outperforms standard in-context learning and achieves performance competitive with or superior to test-time scaling methods, while requiring significantly fewer generations and lower token cost. Code available at: https://github.com/umwyf/CRITICL

View source

Similar papers

Preprint Jul 2026

SPARK: Susceptibility-Guided Profiling and Steering of Latent Reasoning States in Large Language Models

SPARK is introduced, which uses hidden-state response to diagnose whether a model internally enters an effective reasoning state and to guide lightweight test-time steering, and suggests that susceptibility can serve not only as a diagnostic signal for reasoning failures, but also as a practical guide for targeted test-time intervention.

Dongxu Zhang, Yiding Sun, Zihao Guo et al. · 0 citations
2025

Evaluating the Inductive Abilities of Large Language Models: Why Chain-of-Thought Reasoning Sometimes Hurts More Than Helps

This work presents a theoretical framework that reveals how reasoning steps can amplify error through three failure modes: incorrect sub-task decomposition, incorrect sub-task solving, and incorrect final answer summarization, and introduces structured interventions that adapt CoT generation according to the identified failure types.

Haibo Jin, Peiyan Zhang, Man Luo et al. · 1 citation
Conference Jul 2026

AdaptiReason: Adaptive Chain-of-Thought Compression for Efficient Large Language Model Inference

Large Language Models (LLMs) trained using Chain-of-Thought (CoT) supervision have achieved state-of-the-art performance on complex reasoning tasks. However, the generation of long reasoning chains introduces substantial computational overhead during inference, limiting their deployment in low-latency and resource-constrained environments. This paper proposes AdaptiReason, a novel framework that dynamically compresses intermediate reasoning steps based on task difficulty and model confidence without requiring retraining of the underlying base model. AdaptiReason employs a lightweight difficulty estimator to determine the appropriate reasoning depth for each input, followed by a learned token-pruning policy that eliminates redundant or low-information reasoning steps. Experimental evaluation on the MATH, GSM8K, and ARC-Challenge benchmarks demonstrates that AdaptiReason reduces the average number of generated tokens by 3.7× while preserving 98.2% of the baseline reasoning accuracy. Furthermore, the proposed framework is model-agnostic and can be seamlessly integrated with instruction-tuned LLMs without requiring access to model parameters, relying solely on output logits for adaptive reasoning compression. The results demonstrate that AdaptiReason significantly improves inference efficiency while maintaining high reasoning performance, making it suitable for real-time and resource-constrained LLM applications.

V. A, Mithaguru, Amrita Kundu et al. · 0 citations
Preprint Jul 2026

OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping

OS-Pruner is a lightweight plug-in framework that formulates chain-of-thought pruning as an optimal stopping problem that achieves 20-60\% reduction in generation length with minimal accuracy sacrifice on diverse reasoning benchmarks and base models.

Mohammed Ehab, Aymane El Gadarri, Vivek F. Farias et al. · 0 citations
Preprint Aug 2026

AI4AI at Test-Time: Strong-to-Weak Capability Transfer via Harnesses

It is suggested that inference-time harness design is an important complement to conventional training-time distillation, enabling strong models to transfer cognitive structure to weaker models without retraining.

Cheng Qian, Wenting Zhao, Liangwei Yang et al. · 1 citation
Preprint Jul 2026

Looped State-Space Language Models with Adaptive Exit-State Selection

Looped Mamba and Looped Hybrid Mamba-Transformer architectures, which repeatedly apply a shared Mamba block to introduce explicit finite-depth recurrent computation, are investigated and adaptive exit-state selection improves downstream performance at intermediate depths, while actual inference-time savings require additional state-handling mechanisms.

Zhenxuan Yu, Takeshi Kojima, Yutaka Matsuo et al. · 0 citations

Related blog posts