README.md

May 11, 2026 ยท View on GitHub

๐Ÿงฌ Awesome Latent Refinement

Iterative Reasoning & Planning in Latent Space


โญ If you find this useful, please consider giving the repo a star!


๐Ÿง  Overview


๐ŸŽฏ Aim of the Project

Latent refinement has recently emerged across both supervised reasoning and reinforcement learning. In these systems, performance improves not by producing explicit intermediate outputs, but by repeatedly updating internal representations using shared or recurrent computation.

This repository aims to:

  • organize research on iterative refinement of latent state
  • highlight the connection between supervised reasoning and reinforcement-learned planning
  • track systems where additional inference-time compute improves performance
  • provide a focused, high-signal resource for researchers interested in latent iterative computation

๐Ÿงฌ Supervised Latent Refinement

Models that learn to perform iterative updates over latent state for reasoning tasks.

๐Ÿง  Dedicated Reasoners

Architectures explicitly designed to perform reasoning through iterative latent-state updates.

  • Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks. arXiv OpenReview Code

  • End-to-end Algorithm Synthesis with Recurrent Networks: Logical Extrapolation Without Overthinking. arXiv OpenReview Code

  • HRM: "Hierarchical Reasoning Model". arXiv Code

  • TRM: "Less is More: Recursive Reasoning with Tiny Networks". arXiv Code

  • Your Latent Reasoning is Secretly Policy Improvement Operator. arXiv Code

  • Are Your Reasoning Models Reasoning or Guessing? A Mechanistic Analysis of Hierarchical Reasoning Models. arXiv Code

  • Tiny Recursive Reasoning with Mamba-2 Attention Hybrid. arXiv

  • SE-RRM: "Symbol-Equivariant Recurrent Reasoning Models". arXiv Code

  • Recursive Inference Machines for Neural Reasoning. arXiv

  • One Step Forward and K Steps Back: Better Reasoning with Denoising Recursion Models. arXiv Code

๐Ÿ” Looped Language Models

Language models that reuse internal computation (e.g., via loops or recurrent depth) to iteratively refine latent representations.

  • Coconut: "Training Large Language Models to Reason in a Continuous Latent Space". arXiv OpenReview Code

  • Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach. arXiv Code

  • Inner Thinking Transformer: Leveraging Dynamic Depth Scaling to Foster Adaptive Internal Thinking. arXiv

  • Reasoning with Latent Thoughts: On the Power of Looped Transformers. arXiv OpenReview

  • Encode, Think, Decode: Scaling test-time reasoning with recursive latent thoughts. arXiv OpenReview

  • Efficient Parallel Samplers for Recurrent-Depth Models and Their Connection to Diffusion Language Models. arXiv OpenReview Code

  • PLT: "Parallel Loop Transformer (PLT) for Efficient Test-Time Computation Scaling". arXiv

  • Ouro: "Scaling Latent Reasoning via Looped Language Models". arXiv Website HuggingFace

  • Teaching Pretrained Language Models to Think Deeper with Retrofitted Recurrence. arXiv Code HuggingFace

  • Think-at-Hard: "Selective Latent Iterations to Improve Reasoning Language Models". arXiv Code

  • Depth-Recurrent Attention Mixtures: Giving Latent Reasoning the Attention it Deserves. arXiv

  • LoopFormer: "Elastic-Depth Looped Transformers for Latent Reasoning via Shortcut Modulation". arXiv OpenReview Website Code HuggingFace

  • GTS: "Inference-Time Scaling of Latent Reasoning with a Learnable Gaussian Thought Sampler". arXiv

  • Inner Loop Inference for Pretrained Transformers: Unlocking Latent Capabilities Without Training. arXiv

  • From Growing to Looping: A Unified View of Iterative Computation in LLMs. arXiv

  • Thinking in Latents: Adaptive Anchor Refinement for Implicit Reasoning in LLMs. arXiv OpenReview

  • Thinking Deeper, Not Longer: Depth-Recurrent Transformers for Compositional Generalization. arXiv

  • Loop, Think, & Generalize: Implicit Reasoning in Recurrent-Depth Transformers. arXiv Code

  • A Mechanistic Analysis of Looped Reasoning Language Models. arXiv

๐Ÿฆพ Vision-Language-Action Models

Vision-language-action systems that use latent iterative refinement instead of explicit tokenized reasoning.

  • RD-VLA: "Recurrent-Depth VLA: Implicit Test-Time Compute Scaling of Vision-Language-Action Models via Latent Iterative Reasoning". arXiv OpenReview Website Code

๐Ÿšซ Excluded (Supervised)

  • text-based self-refinement methods
  • branching or search-based reasoning
  • diffusion or generative latent refinement not used for reasoning
  • standard feedforward transformers without iterative computation

๐ŸŽฎ Reinforcement-Learned Latent Refinement

Agents that develop iterative latent computation through interaction and reward.

๐Ÿ—บ๏ธ Model-Free Planning

Recurrent agents that exhibit planning-like behavior through internal latent computation without explicit world models.

  • An Investigation of Model-Free Planning. arXiv Code

  • Planning in a recurrent neural network that plays Sokoban. arXiv OpenReview Code Code

  • Interpreting Emergent Planning in Model-Free Reinforcement Learning. arXiv OpenReview Website Code

  • Path Channels and Plan Extension Kernels: a Mechanistic Description of Planning in a Sokoban RNN. arXiv OpenReview

โ™ป๏ธ Recurrent Reasoning Agents

Agents trained with reinforcement learning that develop reusable latent reasoning dynamics across environment interactions.

  • HRM-Agent: "HRM-Agent: Training a recurrent reasoning model in dynamic environments using reinforcement learning". arXiv

โฑ๏ธ Compute in RL

Work studying how increased internal computation improves reinforcement learning performance and generalization.

  • On the Role of Iterative Computation in Reinforcement Learning. arXiv Website

๐Ÿšซ Excluded (RL)

  • model-based RL relying on explicit planning over learned world models
  • tree search methods such as MCTS
  • policies without iterative internal computation
  • latent world models used purely for simulation

๐Ÿ”’ Inclusion Criteria

A paper is included only if it satisfies all of the following:

  1. Iterative refinement of latent state at inference time
  2. Shared or recurrent computation across refinement steps
  3. Performance improves with additional internal compute

Neighboring curated lists and resources on latent reasoning, implicit reasoning, efficient reasoning, and inference-time computation:


๐Ÿค Contributing

Contributions are very welcome!

If you know of a paper, project, implementation, or related resource that fits the scope of this repository, feel free to open a pull request or issue.

This list is intended to stay focused, so suggested additions should match the core idea:

  1. Iterative refinement of latent state at inference time
  2. Shared or recurrent computation across refinement steps
  3. Performance improves with additional inference-time compute

If you are unsure whether something belongs, opening an issue for discussion is completely fine.

Please see CONTRIBUTING.md for formatting guidelines.


๐Ÿ“œ License

This work is licensed under the Creative Commons Zero v1.0 Universal (CC0 1.0).