REVIEW 4 cited by
AdaptiveStep: Automatically Dividing Reasoning Step through Model Confidence
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Current approaches for training Process Reward Models (PRMs) often involve breaking down responses into multiple reasoning steps using rule-based techniques, such as using predefined placeholder tokens or setting the reasoning step's length into a fixed size. These approaches overlook the fact that specific words do not typically mark true decision points in a text. To address this, we propose AdaptiveStep, a method that divides reasoning steps based on the model's confidence in predicting the next word. This division method provides more decision-making information at each step, enhancing downstream tasks, such as reward model learning. Moreover, our method does not require manual annotation. We demonstrate its effectiveness through experiments with AdaptiveStep-trained PRMs in mathematical reasoning and code generation tasks. Experimental results indicate that the outcome PRM achieves state-of-the-art Best-of-N performance, surpassing greedy search strategy with token-level value-guided decoding, while also reducing construction costs by over 30% compared to existing open-source PRMs. In addition, we provide a thorough analysis and case study on the PRM's performance, transferability, and generalization capabilities.
Forward citations
Cited by 4 Pith papers
-
AdapThink: Adaptive Thinking Preferences for Reasoning Language Model
AdapThink is an RL post-training framework that adaptively reduces overthinking and underthinking in reasoning language models by rewarding confidence-appropriate reasoning depth and diverse training samples.
-
AdaCoT: Pareto-Optimal Adaptive Chain-of-Thought Triggering via Reinforcement Learning
AdaCoT uses reinforcement learning with adjustable penalties to make LLMs trigger chain-of-thought reasoning only when needed, cutting response tokens by up to 69% with a small benchmark score loss.
-
Reward-Driven Interaction: Enhancing Proactive Dialogue Agents through User Satisfaction Prediction
A multi-task user satisfaction model with SimCSE-style contrastive learning and domain-intent classification shows small gains on DuerOS, but test-set threshold tuning and input-label leakage weaken the evidence.
-
A Survey of Slow Thinking-based Reasoning LLMs using Reinforced Learning and Inference-time Scaling Law
A structured survey of reasoning LLMs that use reinforcement learning and inference-time scaling to achieve slow, deliberate thought, organized into three method categories.
Discussion (0). Continue with ORCID to comment.