CRANE: Constrained Reasoning Injection for Code Agents via Nullspace Editing
Not on the map. Why?
Abstract (arXiv)
Code agents must both reason over long-horizon repository state and obey strict tool-use protocols. In paired Instruct/Thinking checkpoints, these capabilities are complementary but misaligned. The Instruct model is concise and tool-disciplined, whereas the Thinking model offers stronger planning and recovery behavior but often over-deliberates and degrades agent performance. We present CRANE (Constrained Reasoning Injection for Code Agents via Nullspace Editing), a training-free parameter-editing method that treats the Thinking-Instruct delta as a directional pool of candidate reasoning edits for the Instruct backbone. CRANE combines magnitude thresholding to denoise the delta, a Conservative Taylor Gate to retain edits that are jointly beneficial for reasoning transfer and tool-use preservation, and Graduated Sigmoidal Projection to suppress format-critical update directions. By merging paired Instruct and Thinking checkpoints, CRANE delivers strong gains over either individual model while preserving Instruct-level efficiency: on Roo-Eval it achieves pass1 of 66.2% (+19.5%) for Qwen3-30B-A3B and 81.5% (+8.7%) for Qwen3-Next-80B-A3B; on SWE-bench-Verified it resolves up to 14 additional instances at both scales (122/500 and 180/500); and on Terminal-Bench v2 it improves pass1/pass5 by up to 2.3%/7.8%, reaching 7.6%/17.9% and 14.8%/30.3%, respectively, consistently outperforming alternative merging strategies across all three benchmarks.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 32 of its 39 references that are in the map. First posted on arXiv 13 May 2026.
Builds on
32 of 39 references.
References · 32
- 2025Qwen3 Technical Reportcited by 8,820
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
- 2018Neural Ordinary Differential Equationscited by 3,779
- 2023SWE-bench: Can Language Models Resolve Real-World GitHub Issues?cited by 3,373
- 2022Locating and Editing Factual Associations in GPTcited by 2,691
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2024SWE-agent: Agent-Computer Interfaces Enable Automated Software Engineeringcited by 1,737
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2022Editing Models with Task Arithmeticcited by 1,120
- 2024OpenHands: An Open Platform for AI Software Developers as Generalist Agentscited by 1,002
- 2022Mass-Editing Memory in a Transformercited by 1,001
20 more
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
- 2021Merging Models with Fisher-Weighted Averagingcited by 621
- 2026Terminal-Bench: Benchmarking Agents on Hard, Realistic Tasks in Command Line Interfacescited by 585
- 2024BigCodeBench: Benchmarking Code Generation with Diverse Function Calls and Complex Instructionscited by 546
- 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 387
- 2023LoraHub: Efficient Cross-Task Generalization via Dynamic LoRA Compositioncited by 364
- 2021Gradient Projection Memory for Continual Learningcited by 348
- 2022Teaching Small Language Models to Reasoncited by 284
- 2024LiveBench: A Challenging, Contamination-Limited LLM Benchmarkcited by 262
- 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 252
- 2024Mind Your Step (by Step): Chain-of-Thought can Reduce Performance on Tasks where Thinking Makes Humans Worsecited by 109
- 2026Qwen3-Coder-Next Technical Reportcited by 71
- 2025Activation-Informed Merging of Large Language Modelscited by 30
- 2022Do Residual Neural Networks discretize Neural Ordinary Differential Equations?cited by 27
- 2025THINK-Bench: Evaluating Thinking Efficiency and Chain-of-Thought Quality of Large Reasoning Modelscited by 19
- 2026When More Thinking Hurts: Overthinking in LLM Test-Time Compute Scalingcited by 16
- 2026RAIN-Merging: A Gradient-Free Method to Enhance Instruction Following in Large Reasoning Models with Preserved Thinking Formatcited by 9
- 2025LEWIS (LayEr WIse Sparsity) -- A Training Free Guided Model Merging Approachcited by 3
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026SWE-Edit: Rethinking Code Editing for Efficient SWE-Agent
- 2025Breakpoint: Scalable evaluation of system-level reasoning in LLM code agents
- 2026Inducing Reasoning Primitives from Agent Traces
- 2026Yet Even Less Is Even Better For Agentic, Reasoning, and Coding LLMs
- 2025CodeARC: Benchmarking Reasoning Capabilities of LLM Agents for Inductive Program Synthesis
- 2026RACE-Bench: A Reasoning-Augmented Benchmark for Repository-Level Code Agents on Feature Addition
- 2026Codoku: Renewable Program-Reasoning Challenges for Frontier Coding Agents
- 2026Preventing Premature Commitment in Coding Agents with an Evidence-Conditioned Execution Layer