Paper 2512.07461
Native Parallel Reasoner: Reasoning in Parallelism via Self-Distilled Reinforcement Learning
- Published
- Dec 2025
- Research lab
- Independent
- Citations
- 11
- GitHub
- 113 stars
01 In brief
Summary
The paper introduces Native Parallel Reasoner (NPR), a teacher-free framework that enables large language models to develop genuine parallel reasoning capabilities through self-distillation and reinforcement learning.
NPR uses a three-stage progressive training paradigm: Stage 1 applies format-following RL (DAPO) to induce a structured parallel format, producing NPR-ZERO; Stage 2 uses rejection sampling and parallel SFT with parallel attention masks and positional encoding to create NPR-BETA; Stage 3 applies a novel Parallel-Aware Policy Optimization (PAPO) algorithm that optimizes branching policies directly within the parallel execution graph.
The authors also developed the NPR Engine, which refactors SGLang's memory management and flow control to support stable large-scale parallel RL training.
Experiments on Qwen3-4B across eight reasoning benchmarks show performance gains up to 24.5% and inference speedups up to 4.6x compared to autoregressive baselines.
NPR achieves 100% genuine parallel execution, unlike prior baselines that often fall back to autoregressive decoding.
The self-distilled dataset outperforms teacher-generated trajectories by an average of 10.1 points, and parallel RL consistently surpasses sequential RL baselines.
The framework demonstrates that native parallel reasoning is a promising direction for more scalable and efficient agentic intelligence.
02 From the paper
Abstract
We introduce Native Parallel Reasoner (NPR), a teacher-free framework that enables Large Language Models (LLMs) to self-evolve genuine parallel reasoning capabilities. NPR transforms the model from sequential emulation to native parallel cognition through three key innovations: 1) a self-distilled progressive training paradigm that transitions from ``cold-start'' format discovery to strict topological constraints without external supervision; 2) a novel Parallel-Aware Policy Optimization (PAPO) algorithm that optimizes branching policies directly within the execution graph, allowing the model to learn adaptive decomposition via trial and error; and 3) a robust NPR Engine that refactors memory management and flow control of SGLang to enable stable, large-scale parallel RL training. Across eight reasoning benchmarks, NPR trained on Qwen3-4B achieves performance gains of up to 24.5% and inference speedups up to 4.6x. Unlike prior baselines that often fall back to autoregressive decoding, NPR demonstrates 100% genuine parallel execution, establishing a new standard for self-evolving, efficient, and scalable agentic reasoning.