CPT shares deduplicated intermediate information across parallel search branches at inference time, yielding a stronger accuracy-latency Pareto frontier than isolated-branch baselines on HMMT and AIME.
InInternational Conference on Machine Learning (ICML), volume 235, pages 49890–49920
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Share More, Search Less: Collaborative Parallel Thinking for Efficient Test-Time Scaling
CPT shares deduplicated intermediate information across parallel search branches at inference time, yielding a stronger accuracy-latency Pareto frontier than isolated-branch baselines on HMMT and AIME.