Sign inGet started
Paper · arXiv

MemReward: Graph-Based Experience Memory for LLM Reward Prediction with Limited Labels

Reinforcement learning has emerged as a powerful paradigm for improving large language model (LLM) reasoning, where rollouts are sampled from the policy and reward signals computed on those rollouts are used to update the policy. However, in data-scarce scenarios, obtaining ground-truth labels to verify rollouts at scale often requires expensive human annotation or labor-intensive expert verification. For instance, evaluating mathematical proofs demands expert review, and open-ended question answering lacks definitive ground truth. When ground-truth labels are scarce, the effectiveness of reinforcement learning fine-tuning is constrained. Inspired by the success of semi-supervised learnin...

AuthorsTianyang Luo, Tao Feng, Zhigang Hua et al.
Primary categorycs.LG
Published13 March 2026
Last updated at source22 May 2026
cs.LGcs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/3aee203f-f68e-49ab-9c61-5cdddcd328ec" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Connected in the knowledge graph

Explore this entry in the graph

Models and datasets referencing this paper

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 18 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.