Adaptive Parallel Reasoning: The Next Paradigm in Efficient Inference Scaling

This post surveys parallel reasoning methods for LLMs, contrasting fixed approaches like self-consistency, Best-of-N, and tree search with adaptive parallel reasoning (APR), where the model itself decides when to parallelize, how many threads to spawn, and how to coordinate them. It describes fork-join inference designs, including engine-modifying KV cache stitching (Multiverse) versus client-side orchestration (ThreadWeaver), and covers training via SFT demonstrations and RL rewards based on critical-path efficiency gated by correctness. It closes with evaluation differences across Multiverse, ThreadWeaver, NPR, and Parallel-R1, plus open questions on stability and whether parallelization mainly helps as a training-time exploration scaffold.