Pith. sign in

REVIEW 1 cited by

Improving Large Language Models via Fine-grained Reinforcement Learning with Minimum Editing Constraint

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 2401.06081 v2 pith:WIDACTC3 submitted 2024-01-11 cs.CL

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

Reinforcement learning (RL) has been widely used in training large language models (LLMs) for preventing unexpected outputs, eg reducing harmfulness and errors. However, existing RL methods mostly adopt the instance-level reward, which is unable to provide fine-grained supervision for complex reasoning tasks, and can not focus on the few key tokens that lead to the incorrectness. To address it, we propose a new RL method named RLMEC that incorporates a generative model as the reward model, which is trained by the erroneous solution rewriting task under the minimum editing constraint, and can produce token-level rewards for RL training. Based on the generative reward model, we design the token-level RL objective for training and an imitation-based regularization for stabilizing RL process. And the both objectives focus on the learning of the key tokens for the erroneous solution, reducing the effect of other unimportant tokens. The experiment results on mathematical tasks and question-answering tasks have demonstrated the effectiveness of our approach. Our code and data are available at https://github.com/RUCAIBox/RLMEC.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Flipping Knowledge Distillation: Leveraging Small Models' Expertise to Enhance LLMs in Text Matching

    cs.CL 2025-07 conditional novelty 6.0 of 10

    A flipped distillation method lets a decoder-only LLM learn text-matching similarity from a smaller encoder teacher through LoRA and a margin-aware contrastive loss, improving matching accuracy and online FAQ retrieval.

Pith tools