Compute Time Scaling with Recursive Models for Combinatorial Optimization
A graph-aware tiny recursive model that iterates on a latent state with adaptive halting and needs only a lightweight problem-specific decoder is proposed, which achieves a better balance between solution quality and inference speed on both the Traveling Salesman Problem and the Maximum Independent Set problem.