mlsanityData to 14 Oct 2026

Free(): Learning to Forget in Malloc-Only Reasoning Models

arXiv 2602.08030 ↗First posted 8 Feb 2026cs.AI cs.CLcited by 1

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

Reasoning models enhance problem-solving by scaling test-time compute, yet they face a critical paradox: excessive thinking tokens often degrade performance rather than improve it. We attribute this to a fundamental architectural flaw: standard LLMs operate as "malloc-only" engines, continuously accumulating valid and redundant steps alike without a mechanism to prune obsolete information. To break this cycle, we propose Free()LM, a model that introduces an intrinsic self-forgetting capability via the Free-Module, a plug-and-play LoRA adapter. By iteratively switching between reasoning and cleaning modes, Free()LM dynamically identifies and prunes useless context chunks, maintaining a compact and noise-free state. Extensive experiments show that Free()LM provides consistent improvements across all model scales (8B to 685B). It achieves a 3.3% average improvement over top-tier reasoning baselines, even establishing a new SOTA on IMOanswerBench using DeepSeek V3.2-Speciale. Most notably, in long-horizon tasks where the standard Qwen3-235B-A22B model suffers a total collapse (0% accuracy), Free()LM restores performance to 50%. Our findings suggest that sustainable intelligence requires the freedom to forget as much as the power to think.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 19 of its 43 references that are in the map. First posted on arXiv 8 Feb 2026.

Builds on

19 of 43 references.

Closest ancestors · 3

Same direction, newest first

  1. 2025DeepCompress: A Dual Reward Strategy for Dynamically Exploring and Compressing Reasoning Chains31 Oct
  2. 2025Explore Briefly, Then Decide: Mitigating LLM Overthinking via Cumulative Entropy Regulation2 Oct
  3. 2025O1-Pruner: Length-Harmonizing Fine-Tuning for O1-Like Reasoning Pruning22 Jan

Other references · 16

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  2. 2025Qwen3 Technical Reportcited by 8,820
  3. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  4. 2025Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilitiescited by 3,796
  5. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
  6. 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,868
  7. 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
  8. 2025DeepSeek-V3.2: Pushing the Frontier of Open Large Language Modelscited by 815
  9. 2024KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cachecited by 637
  10. 2025Humanity's Last Examcited by 491
  11. 2023Ring Attention with Blockwise Transformers for Near-Infinite Contextcited by 457
  12. 2024LongRoPE: Extending LLM Context Window Beyond 2 Million Tokenscited by 313
4 more
  1. 2025DeepMath-103K: A Large-Scale, Challenging, Decontaminated, and Verifiable Mathematical Dataset for Advancing Reasoningcited by 280
  2. 2025NoLiMa: Long-Context Evaluation Beyond Literal Matchingcited by 126
  3. 2025KVzip: Query-Agnostic KV Cache Compression with Context Reconstructioncited by 95
  4. 2025The Pitfalls of KV Cache Compressioncited by 15

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026GUARD: Natural Forgetting in Large Reasoning Models via Guided Answer-Reasoning Distillation
  2. 2025Temporal Sampling for Forgotten Reasoning in LLMs
  3. 2026REDaCT: Collapse-Free Unlearning in Large Reasoning Models
  4. 2026Neural Garbage Collection: Learning to Forget while Learning to Reason
  5. 2025ThinkLess: A Training-Free Inference-Efficient Method for Reducing Reasoning Redundancy
  6. 2025Less Is More: Fast and Accurate Reasoning with Cross-Head Unified Sparse Attention
  7. 2025Gold-Switch: Training-Free Superposition of Slow- and Fast- Thinking LLMs
  8. 2026RAIN-Merging: A Gradient-Free Method to Enhance Instruction Following in Large Reasoning Models with Preserved Thinking Format