Pith. sign in

REVIEW 4 cited by

Process-based Self-Rewarding Language Models

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

arxiv 2503.03746 v1 pith:QY62SQFF submitted 2025-03-05 cs.CL cs.AI

classification cs.CLcs.AI
keywords self-rewardingperformancereasoninglanguagellmsmodelsparadigmprocess-based
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Large Language Models have demonstrated outstanding performance across various downstream tasks and have been widely applied in multiple scenarios. Human-annotated preference data is used for training to further improve LLMs' performance, which is constrained by the upper limit of human performance. Therefore, Self-Rewarding method has been proposed, where LLMs generate training data by rewarding their own outputs. However, the existing self-rewarding paradigm is not effective in mathematical reasoning scenarios and may even lead to a decline in performance. In this work, we propose the Process-based Self-Rewarding pipeline for language models, which introduces long-thought reasoning, step-wise LLM-as-a-Judge, and step-wise preference optimization within the self-rewarding paradigm. Our new paradigm successfully enhances the performance of LLMs on multiple mathematical reasoning benchmarks through iterative Process-based Self-Rewarding, demonstrating the immense potential of self-rewarding to achieve LLM reasoning that may surpass human capabilities.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Consistent Paths Lead to Truth: Self-Rewarding Reinforcement Learning for LLM Reasoning

    cs.AI 2025-06 conditional novelty 6.0 of 10

    CoVo trains LLMs with a self-generated reward based on the consistency and volatility of intermediate reasoning states, matching supervised RL performance without external labels.

  2. Temporal Self-Rewarding Language Models: Decoupling Chosen-Rejected via Past-Future

    cs.CL 2025-08 conditional novelty 5.0 of 10

    Anchoring rejected responses to the initial model and choosing responses from a future model raises AlpacaEval 2.0 win rate from 19.69 to 29.44 for Llama3.1-8B.

  3. SwS: Self-aware Weakness-driven Problem Synthesis in Reinforcement Learning for LLM Reasoning

    cs.LG 2025-06 conditional novelty 5.0 of 10

    SwS uses failures during RL training to synthesize targeted math problems, improving reasoning accuracy on eight benchmarks.

  4. PATS: Process-Level Adaptive Thinking Mode Switching

    cs.CL 2025-05 conditional novelty 5.0 of 10

    PATS adapts the number of beam-search candidates per reasoning step using process reward model scores, improving accuracy-efficiency tradeoffs on math benchmarks.

Pith tools