
This paper introduces looped flows, a novel framework designed to enhance the reasoning capabilities of neural networks by merging recurrent hidden states with probability flow models. Traditional looped models often struggle with training instability because they cannot effectively backpropagate through many iterations, but this approach sidesteps that issue by using local denoising objectives across various noise levels. By gradually reducing noise and sharing information across steps, the model learns a stable recurrence that builds complex computations over time. During inference, the system solves difficult problems by integrating a stateful probability flow, which allows for increased accuracy through more intensive computation. This method significantly outperforms previous benchmarks in abstract reasoning and complex puzzles like Sudoku and Maze-Hard. Furthermore, the framework enables diverse solution generation by transporting different initial noise samples toward valid final outcomes.
Podzilla Summary coming soon
Sign up to get notified when the full AI-powered summary is ready.
Free forever for up to 3 podcasts. No credit card required.

Jailbreaking Jailbreaks: A Proactive Defense for LLMs

When Agents Slow Down: Understanding LLM Agents’ Test-Time Strategies via Elo-per-token Analysis

Multi-Turn LLM Conversations under the Least-Recently-Used Policy: Mean-Field Asymptotics

Breaking the Token Ceiling: Distilling Smaller, Stronger Byte Models
Free AI-powered recaps of Best AI papers explained and your other favorite podcasts, delivered to your inbox.
Free forever for up to 3 podcasts. No credit card required.