No sign of backtracking in latent reasoning: the final answer simply settles in instead

·LessWrong··

Solving a hard math problem is not linear, it's trial and error.You drop an idea, pick up an earlier one, go back to a computation from another approach, until something clicks. You might scribble on paper, but even if you don't, you still remember the path to get to the result, as well as the other methods you tried before one worked.Do language models do this too?In chain-of-thought reasoning, we can see that they do: the backtracking shows up in the transcript, signaled by tokens such as "wai...

Read full article →

Related Articles

google.com/goto: Google's anti-scraping update
1e1a · Hacker News · 19h ago
Will There Be a 7G?
Betelbuddy · Hacker News · 5h ago
Navier-Stokes Announcement
rvz · Hacker News · 18h ago
Measuring the sloppiness of code
doppp · Hacker News · 1d ago
Google will buy half the electricity from one of Finland's nuclear power plants
lukaspetersson · Hacker News · 1d ago