Skip to content
conftrace_
2026 AACL AACL 2026

DALSA: Difficulty-Aware Long-to-Short LLM Reasoning with Model Merging

AbstractRecent advances in large language models(LLMs) have given rise to large reasoning models that achieve strong performance through explicit multi-step reasoning. However, models often generate long reasoning chains even for simple inputs. We present Difficulty-Aware Long-to-Short LLM Reasoning with Model Merging (DALSA), an inference-time framework that adaptively controls reasoning depth based on input difficulty. DALSA integrates (i) representation-based difficulty estimation, which predicts a soft failure-rate score from the prompt hidden state, and (ii) difficulty-aware model merging, which uses a quantile remapped score to modulate the interpolation coefficient between short- and long-reasoning models. DALSA trains a lightweight probe while keeping both LLMs frozen. On mathematical benchmarks with the evaluated Qwen pairs, the accuracy–length trade-off depends on scale: at 7B, DALSA preserves static ACM-TA average accuracy (66.60% vs. 66.61%) while reducing average response length by 22.35%; at 1.5B, it improves average accuracy from 56.75% to 58.24% with a 2.27% length in- crease. Additional merging baselines, routing-threshold and merge-range sweeps, and component ablations show sensitivity to the operating configuration. Domain-matched commonsense and Llama-family diagnostics do not establish broader efficiency gains, limiting the primary empirical claim to the evaluated Qwen mathematical setting.

More from AACL 2026

All AACL 2026 papers →