Skip to content
Conference

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

Jul 2026 · 2026 4th International Conference on Sustainable Computing and Smart Systems (ICSCSS) · pp. 1924-1929 · 0 citations · 20 references

Abstract

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.

View source

Similar papers

Preprint Jul 2026

PyroDash: Cost-Efficient Token-Level Small-Large Language Model Collaborative Inference

Results show that learned token-level handoffs can reduce LLM use while preserving strong reasoning performance, and show that learned token-level handoffs can reduce LLM use while preserving strong reasoning performance.

Niqi Lyu, Pengtao Shi, Wei Qiu et al. · 0 citations

Sprint or Delve: A Distribution-Aware Approach to Efficient Reasoning

The Powered Length Penalty (PLP) is proposed, an adaptive regularizer that penalizes redundancy in short sequences while gradually reducing penalties for longer sequences, preserving deep reasoning.

Zehui Ling, Deshu Chen, Hongwei Zhang 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
Conference Jul 2026

Lightweight reasoning models for NER

Lite-CoNER is proposed, a lightweight NER framework that achieves an effective balance between recognition accuracy and inference efficiency and provides a transparent view of the decision-making process, proving that lightweight models can effectively inherit complex logic through structured distillation.

Yang Wang, Lushuang Gao · 0 citations
Conference Open access 2026

CLARO: Controlled Attribute-Driven Reasoning Optimization for Efficient Chain-of-Thought

Overall, the findings establish that optimizing the thought process structure refines reasoning efficacy, with computational efficiency emerging as a derivative benefit of a clearer thought process.

Oded Schlesinger, Young Kyung Kim, J. Matias Di Martino et al. · 0 citations
Open access Jul 2026

Adaptive Depth Sparse Framework: Similarity-Driven Resource Allocation for Pre-Trained LLMs

An Adaptive Depth Sparse Framework (AdaDSF) that converts off-the-shelf pre-trained LLMs into depth-sparse models without full retraining and consistently yields smaller accuracy degradation than strong baselines including MoD, D-LLM, and DLO.

Yi-Da Wu, Xiang Wang, Kejie Zhao et al. · 0 citations