Name: MLn Club (ML Reading Group) #3: Tiny Recursive Models
Start: 2026-06-01T19:00:00.000-04:00
End: 2026-06-01T21:00:00.000-04:00
Location: Pittsburgh, PA

We meet weekly on Sundays in person to talk about ML papers! Optional quiet reading from 7 pm, discussion starts 8 pm. Come and join the discussion! Open to all. Website: https://czhs.github.io/mln/

MLn Reading Club

Less is More: Recursive Reasoning with Tiny Networks

This paper introduces Tiny Recursive Models (TRM), which drastically simplifies previous 

 while achieving better performance on puzzle tasks like Sudoku and ARC-AGI. Using just a single 2-layer network with 7M parameters, TRM outperforms much larger language models by recursively refining both its current answer and internal reasoning state.

The work challenges conventional scaling wisdom by showing that smaller networks with deeper recursion can outperform larger models, offering a parameter-efficient approach to complex reasoning tasks that's particularly relevant for practitioners interested in efficient architectures and the role of iterative refinement in problem-solving.

The Hidden Drivers of HRM's Performance on ARC-AGI

- Artificial reasoning - Think again vs think bigger?

- What if we've been scaling AI models in completely the wrong direction?

Discussion at 20:00, (optional) quiet reading from 19:00.

MLn Club (ML Reading Group) #3: Tiny Recursive Models