Pith. sign in

REVIEW 5 cited by

Sailing by the Stars: A Survey on Reward Models and Learning Strategies for Learning from Rewards

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 2505.02686 v2 pith:EUBTURJB submitted 2025-05-05 cs.CL

classification cs.CL
keywords learningmodelsrewardrewardsacrossdevelopmentsllmsparadigm
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent developments in Large Language Models (LLMs) have shifted from pre-training scaling to post-training and test-time scaling. Across these developments, a key unified paradigm has arisen: Learning from Rewards, where reward signals act as the guiding stars to steer LLM behavior. It has underpinned a wide range of prevalent techniques, such as reinforcement learning (RLHF, RLAIF, DPO, and GRPO), reward-guided decoding, and post-hoc correction. Crucially, this paradigm enables the transition from passive learning from static data to active learning from dynamic feedback. This endows LLMs with aligned preferences and deep reasoning capabilities for diverse tasks. In this survey, we present a comprehensive overview of learning from rewards, from the perspective of reward models and learning strategies across training, inference, and post-inference stages. We further discuss the benchmarks for reward models and the primary applications. Finally we highlight the challenges and future directions. We maintain a paper collection at https://github.com/bobxwu/learning-from-rewards-llm-papers.

Discussion (0). Sign in to comment.

Forward citations

Cited by 5 Pith papers

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

  1. SCOPE: Compress Mathematical Reasoning Steps for Efficient Automated Process Annotation

    cs.AI 2025-05 conditional novelty 7.0 of 10

    SCOPE compresses sampled math reasoning traces into a prefix tree of AST-normalized code steps, yielding PRM training labels at O(N) cost and improving Best-of-N and ProcessBench scores over automated baselines.

  2. Unsupervised Hallucination Detection by Inspecting Reasoning Processes

    cs.CL 2025-09 conditional novelty 6.0 of 10

    IRIS detects LLM hallucinations by training a lightweight probe on hidden states elicited during the model's own step-by-step verification, using the model's verbalized confidence as soft pseudolabels.

  3. Training LLMs for EHR-Based Reasoning Tasks via Reinforcement Learning

    cs.CL 2025-05 conditional novelty 6.0 of 10

    A 3B model trained with a small SFT warm-up followed by verifiable-reward RL matches or exceeds far larger models on EHR-based medical calculation, trial matching, and diagnosis tasks.

  4. Towards Storage-Efficient Visual Document Retrieval: An Empirical Study on Reducing Patch-Level Embeddings

    cs.IR 2025-06 conditional novelty 5.0 of 10

    Semantic clustering of patch embeddings at the final model layer, plus fine-tuning, preserves 94.6 to 98.2% of retrieval performance while reducing stored embedding memory to 1.8 to 11.8% of original.

  5. ReAgent-V: A Reward-Driven Multi-Agent Framework for Video Understanding

    cs.CV 2025-06 conditional novelty 5.0 of 10

    ReAgent-V is an agentic video understanding framework whose critic agent generates real-time rewards to refine answers and filter training data, yielding gains of up to 6.9%, 2.1%, and 9.8% across three applications.

Pith tools