Probabilistic Tiny Recursive Model
- Published
- Source
- arXiv
- Paper number
- 191
- Field
- AI / General
- arXiv ID
- 2605.19943
Key points
- Although powerful, deterministic recursion can converge to suboptimal solutions without any escape mechanism.
- A common workaround combines test-time task-specific input perturbation with answer aggregation through voting.
Paper links
External research summaries. These are not HDATF publications or measured product results.