Tiny recursive models drop their two-level state: STRM beats TRM on Sudoku-Extreme at equal compute
The tiny recursive model TRM relies on a high-level and a low-level state plus nested loops to avoid memorization, which makes its recursion complicated. STRM replaces both states with a single state updated as a bank of fixed-rate, log-spaced exponential moving averages, and reads the answer only from the slowest-updating channels. With the same data, parameters and compute, STRM improves on TRM on Sudoku-Extreme and PPBench, matches it on Maze-Hard, and no longer shows a late drop in held-out accuracy.