- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes Negative Space, a bi-level optimization method that trains LLMs to adapt from unsuccessful attempts at test time. The method introduces a LoRA adapter whose shared matrix A is jointly trained with the base model parameters through reinforcement learning, while its query-specific matrix B is updated at test time to reduce the likelihood of rejected responses. Experiments on code generation and mathematical reasoning show that the proposed method achieves higher accuracy than RL without a retry loop, RL with independent retry, and RL with self-correction. On coding tasks, the method also improves Pass@k and repair rates, but requires more inference time and computation.
Critical strengths
- The proposed method shows consistent performance gains across coding and mathematical reasoning, improving average accuracy over the strongest baseline by 4.8% and 3.7%, respectively. Higher deployment pass@k and repair rate on coding tasks provide further evidence that the adaptation improves subsequent attempts.
Critical weaknesses
- The main contribution of this paper is using failed responses for test-time unlearning and learning a shared LoRA matrix that makes these updates improve subsequent attempts. However, LoRA-based meta-learning has already been explored in PERK [1] and Meta-LoRA [2]. In particular, Meta-LoRA learns shared LoRA components and adapts the remaining components to individual subjects at test time. Outer-loop RL for optimizing test-time adaptation has been proposed in SEAL [3] and MASS [4]. The unlearning objective itself is also standard. Therefore, the conceptual novelty limited, with the main contribution being the combination of these existing ideas for learning from failed attempts at test time.
- The experiments use only Qwen3-4B and Qwen3-8B in non-thinking mode. It is therefore unclear whether the reported gains extend to models using extended reasoning. This is particularly relevant because suppressing an entire failed response using the unlearning objective may penalize useful intermediate reasoning steps.
[1] Zeming Chen, Angelika Romanou, Gail Weiss, Antoine Bosselut, PERK: Long-Context Reasoning as Test-Time Learning, ICLR 2026
[2] Bo Cheng, Xu Wang, Jinda Liu, Yi Chang, Yuan Wu, MeTA-LoRA: Data-Efficient Multi-Task Fine-Tuning for Large Language Models, arXiv 2025
[3] Adam Zweiger, Jyothish Pari, Han Guo, Ekin Akyürek, Yoon Kim, Pulkit Agrawal, Self-Adapting Language Models, NeurIPS 2025
[4] Zeyneb N. Kaya, Nick Rui, Test-Time Meta-Adaptation with Self-Synthesis, arXiv 2026
Questions for authors
- Could you please evaluate the method with thinking models? It would be important for establishing the applicability of the method to reasoning models.
- Could you please compare the method with baselines under the same total compute budget, allowing the baselines to use additional samples or retries?
5 comments
Thank you for the additional experiments. I believe the experiment on Qwen3-4B in thinking mode is crucial. Therefore, I have raised my score from 2 to 3.
Thank you
Thank you for your constructive feedback and for raising your score. Your comments have helped us improve the paper, and we appreciate your time and effort.
Response by Authors
W1. Clarifying the Conceptual Novelty
We thank the reviewer for highlighting these related works. We agree that LoRA-based meta-learning, outer-loop optimization, and unlearning have established precedents. Our contribution is not a new meta-learning operator, but a framework that integrates failure-driven test-time adaptation into LLM post-training. Specifically, we train models to correct their own reasoning failures at test time: after a rejection, the model temporarily updates its parameters to suppress the failed attempt, retries the same question, and discards the update.
Distinction from prior work. While existing methods primarily adapt to additional information or training examples, Negative Space learns to correct the model's own failed attempts:
Table R1: Comparison of Negative Space with related test-time adaptation methods.
Two properties make this framework non-trivial:
The inner loop unlearns rather than learns. Unlike the cited approaches, which adapt by fitting additional information, our framework uses rejected attempts as negative learning signals, without positive targets or additional training examples at deployment.
Learning to make unlearning effective. Directly suppressing a failed response may also suppress useful reasoning steps and degrade subsequent performance. Our outer loop learns to make such potentially harmful updates beneficial. On LiveCodeBench (Table 3a), norm-matched random-A unlearning achieves 35.1%, below no adaptation (38.9%), whereas learned-A adaptation reaches 42.4%.
Importantly, the asymmetric LoRA factorization provides a computationally efficient implementation of this framework, rather than constituting its conceptual novelty. Our contribution is the post-training framework that learns to turn rejected reasoning attempts into effective test-time corrections.
W2 and Q1. Generalization to Thinking Models
We thank the reviewer for this suggestion. We extend our evaluation to Qwen3-4B in thinking mode to examine whether Negative Space remains effective with extended reasoning.
Table R2: Results on Qwen3-4B in thinking mode (accuracy, %).
Negative Space outperforms the strongest retry baseline by 4.2 percentage points on average, demonstrating that failure-driven adaptation remains effective with extended reasoning, despite the potential suppression of useful intermediate steps.
Q2. Comparison under the Same Total Compute Budget
We thank the reviewer for this suggestion. We compare Negative Space with RL with independent retry, the strongest coding baseline, under matched compute on LiveCodeBench, allowing the baseline additional retries. At K=1, Negative Space uses 1.86× the FLOPs and 1.26× the wall-clock time of independent retry per returned response (Table 3b). We pair each retry budget of Negative Space with the smallest independent-retry budget that uses at least as much compute:
Table R3: Compute-matched comparison on LiveCodeBench (accuracy, %).
Costs are per returned response, relative to a single attempt. Independent retry saturates at 43.2% for K≥5, below Negative Space at every K≥2. Thus, even with at least as much compute, independent retry does not reach the accuracy of Negative Space: the margin is small at the lowest FLOPs budget and grows at larger budgets, where additional resampling no longer helps. Under wall-clock time, which reflects deployment latency, Negative Space leads at every budget.
Thank you once again for your insightful comments, which have strengthened our work. We hope that our responses address your concerns, and we welcome any further feedback you may have.