<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
    <channel>
        <title>Credit_assignment - 标签 - vllbc02&#39;s blogs</title>
        <link>https://blog.vllbc.top/tags/credit_assignment/</link>
        <description>Credit_assignment - 标签 - vllbc02&#39;s blogs</description>
        <generator>Hugo -- gohugo.io</generator><language>zh-CN</language><copyright>This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.</copyright><lastBuildDate>Tue, 23 Sep 2025 00:00:00 &#43;0000</lastBuildDate><atom:link href="https://blog.vllbc.top/tags/credit_assignment/" rel="self" type="application/rss+xml" /><item>
    <title>Process-Supervised Reinforcement Learning for Interactive Multimodal Tool-Use Agents</title>
    <link>https://blog.vllbc.top/process-supervised-reinforcement-learning-for-interactive-multimodal-tool-use-agents/</link>
    <pubDate>Tue, 23 Sep 2025 00:00:00 &#43;0000</pubDate>
    <author>vllbc</author>
    <guid>https://blog.vllbc.top/process-supervised-reinforcement-learning-for-interactive-multimodal-tool-use-agents/</guid>
    <description><![CDATA[<p>信用分配的工作，解决的问题是针对多步交互的agent，只给予结果奖励无法鼓励好的动作和抑制不好的动作，方法是利用外部大模型针对轨迹中的每一个step进行打分作为奖励，同时为了激发探索能力，混合了一些困难的数学题目。</p>]]></description>
</item>
<item>
    <title>Harnessing Uncertainty：Entropy-Modulated Policy Gradients for Long-Horizon LLM Agents</title>
    <link>https://blog.vllbc.top/harnessing-uncertaintyentropy-modulated-policy-gradients-for-long-horizon-llm-agents/</link>
    <pubDate>Sat, 13 Sep 2025 00:00:00 &#43;0000</pubDate>
    <author>vllbc</author>
    <guid>https://blog.vllbc.top/harnessing-uncertaintyentropy-modulated-policy-gradients-for-long-horizon-llm-agents/</guid>
    <description><![CDATA[<p>长时序任务下的信用分配问题，部分实验结果直接使用的<a
href="../Planning/Group-in-Group%20Policy%20Optimization%20for%20LLM%20Agent%20Training.md">Group-in-Group
Policy Optimization for LLM Agent
Training</a>，这说明如果到时候我写相关论文，也可以直接用别人论文的结果，避免了复现成本。不过baseline还是要自己跑。</p>]]></description>
</item>
<item>
    <title>GTPO and GRPO-S：Token and Sequence-Level Reward Shaping with Policy Entropy</title>
    <link>https://blog.vllbc.top/gtpo-and-grpo-stoken-and-sequence-level-reward-shaping-with-policy-entropy/</link>
    <pubDate>Fri, 08 Aug 2025 00:00:00 &#43;0000</pubDate>
    <author>vllbc</author>
    <guid>https://blog.vllbc.top/gtpo-and-grpo-stoken-and-sequence-level-reward-shaping-with-policy-entropy/</guid>
    <description><![CDATA[<p>又是信用分配的论文，不过实验做的比较少，直接把wandb的表放上来了。</p>
<hr />
<h3
id="论文深度解读从大锅饭式奖励到精准制导"><strong>论文深度解读：从“大锅饭”式奖励到“精准制导”</strong></h3>
<p>这篇论文的核心，是解决大型语言模型在进行长链推理（long-chain
reasoning）任务时的一个根本性难题：<strong>信贷分配（Credit
Assignment）</strong>。想象一下，模型在解答一个需要50个步骤的复杂数学题。如果它在第49步都完美无瑕，但在最后一步算错了，导致最终答案错误。那么，传统的强化学习方法，如<strong>GRPO
(Group Relative Policy
Optimization)</strong>，会给这整个50步的解答过程打上一个“0分”的标签。这意味着，前面49个正确的推理步骤，和最后一个错误的计算步骤，受到了同等的“惩罚”。这种“成王败寇”、“大锅饭”式的奖励机制，效率低下且不合理，是提升模型深度推理能力的一大瓶颈。</p>]]></description>
</item>
<item>
    <title>GTPO：Trajectory-Based Policy Optimization in Large Language Models</title>
    <link>https://blog.vllbc.top/gtpotrajectory-based-policy-optimization-in-large-language-models/</link>
    <pubDate>Fri, 08 Aug 2025 00:00:00 &#43;0000</pubDate>
    <author>vllbc</author>
    <guid>https://blog.vllbc.top/gtpotrajectory-based-policy-optimization-in-large-language-models/</guid>
    <description><![CDATA[<p>针对信用分配问题和熵坍塌问题进行解决。名字虽然和<a
href="GTPO%20and%20GRPO-S：Token%20and%20Sequence-Level%20Reward%20Shaping%20with%20Policy%20Entropy.md">GTPO
and GRPO-S：Token and Sequence-Level Reward Shaping with Policy
Entropy</a>一样，但T的含义不同。也都是针对信用分配提出的方法。</p>]]></description>
</item>
<item>
    <title>Beyond Policy Optimization：A Data Curation Flywheel for Sparse-Reward Long-Horizon Planning</title>
    <link>https://blog.vllbc.top/beyond-policy-optimizationa-data-curation-flywheel-for-sparse-reward-long-horizon-planning/</link>
    <pubDate>Thu, 07 Aug 2025 00:00:00 &#43;0000</pubDate>
    <author>vllbc</author>
    <guid>https://blog.vllbc.top/beyond-policy-optimizationa-data-curation-flywheel-for-sparse-reward-long-horizon-planning/</guid>
    <description><![CDATA[<p>信用分配在规划中，并且用了我想要做的benchmark：ALFWorld、ScienceWorld和WebShop。</p>
<hr />
<p>这篇论文的核心思想，可以说是在如何训练能执行复杂任务的“智能体（Agent）”这个问题上，提出了一个“大力出奇迹”但又充满智慧的解决范式。传统方法，尤其是强化学习（Reinforcement
Learning, RL），在处理需要很多步骤才能看到最终结果（即<strong>长时程规划
Long-Horizon Planning</strong>）且中途没有任何提示（即<strong>稀疏奖励
Sparse
Reward</strong>）的任务时，会陷入一个巨大的困境，我们称之为“<strong>信用分配难题（Credit
Assignment
Problem）</strong>”。这就像你在一个巨大的迷宫里走了100步，最后终于找到了出口，但你很难说清楚这100步里，哪几步是真正关键的。强化学习算法在这种情况下，常常因为反馈信号太弱或太滞后而无法有效学习。
</p>]]></description>
</item>
<item>
    <title>CAPO：Towards Enhancing LLM Reasoning through Verifiable Generative Credit Assignment</title>
    <link>https://blog.vllbc.top/capotowards-enhancing-llm-reasoning-through-verifiable-generative-credit-assignment/</link>
    <pubDate>Thu, 07 Aug 2025 00:00:00 &#43;0000</pubDate>
    <author>vllbc</author>
    <guid>https://blog.vllbc.top/capotowards-enhancing-llm-reasoning-through-verifiable-generative-credit-assignment/</guid>
    <description><![CDATA[<p>信用分配在推理任务中。对比了传统prm和RLVR。让大模型对step的正确与否打标签，然后针对step计算reward，然后加权计算最终token的reward计算adv。就是不知道针对adv进行加权计算是否更直接更好一点。很容易想到的方法。</p>]]></description>
</item>
<item>
    <title>Group-in-Group Policy Optimization for LLM Agent Training</title>
    <link>https://blog.vllbc.top/group-in-group-policy-optimization-for-llm-agent-training/</link>
    <pubDate>Thu, 07 Aug 2025 00:00:00 &#43;0000</pubDate>
    <author>vllbc</author>
    <guid>https://blog.vllbc.top/group-in-group-policy-optimization-for-llm-agent-training/</guid>
    <description><![CDATA[<p>信用分配问题，而且贡献了verl-agent库，可以方便针对真实环境进行训练。思想也类似于<a
href="../Reasoning/GTPO：Trajectory-Based%20Policy%20Optimization%20in%20Large%20Language%20Models.md">GTPO：Trajectory-Based
Policy Optimization in Large Language
Models</a>，不同的轨迹有相同的前缀，不过用在了完全不同的领域上。</p>]]></description>
</item>
<item>
    <title>Good Learners Think Their Thinking：Generative PRM Makes Large Reasoning Model More Efficient Math Learne</title>
    <link>https://blog.vllbc.top/good-learners-think-their-thinkinggenerative-prm-makes-large-reasoning-model-more-efficient-math-learne/</link>
    <pubDate>Sat, 02 Aug 2025 00:00:00 &#43;0000</pubDate>
    <author>vllbc</author>
    <guid>https://blog.vllbc.top/good-learners-think-their-thinkinggenerative-prm-makes-large-reasoning-model-more-efficient-math-learne/</guid>
    <description><![CDATA[<p>一篇关于PRM的方法（最近prm有点复兴的趋势）</p>
<hr />
<h3
id="论文深度解读从结果导向到过程学习的范式革命">论文深度解读：从“结果导向”到“过程学习”的范式革命</h3>
<p>在大型语言模型（LLM） стремительно (qián suǒ wèi
yǒu)发展的今天，我们已经见证了它们在语言理解和生成方面的惊人能力。然而，要让模型真正具备强大的<strong>逻辑推理</strong>能力，尤其是在数学、编程等需要严谨步骤的领域，仅仅依赖于预测下一个词的预训练目标是远远不够的。因此，<strong>强化学习（Reinforcement
Learning,
RL）</strong>，特别是基于结果反馈的RL方法，成为了提升模型推理能力的主流技术路径。</p>]]></description>
</item>
<item>
    <title>RLVMR：Reinforcement Learning with Verifiable Meta-Reasoning Rewards for Robust Long-Horizon Agents</title>
    <link>https://blog.vllbc.top/rlvmrreinforcement-learning-with-verifiable-meta-reasoning-rewards-for-robust-long-horizon-agents/</link>
    <pubDate>Sat, 02 Aug 2025 00:00:00 &#43;0000</pubDate>
    <author>vllbc</author>
    <guid>https://blog.vllbc.top/rlvmrreinforcement-learning-with-verifiable-meta-reasoning-rewards-for-robust-long-horizon-agents/</guid>
    <description><![CDATA[<p>这篇也是在过程上做文章，设计了过程导向的奖励，类似<a
href="../Reasoning/Good%20Learners%20Think%20Their%20Thinking：Generative%20PRM%20Makes%20Large%20Reasoning%20Model%20More%20Efficient%20Math%20Learne.md">Good
Learners Think Their Thinking：Generative PRM Makes Large Reasoning
Model More Efficient Math Learne</a></p>
<p>和<a
href="../Reasoning/First%20Return,%20Entropy-Eliciting%20Explore.md">First
Return, Entropy-Eliciting
Explore</a>等类似都是为了解决信用分配问题。</p>]]></description>
</item>
<item>
    <title>PROCESS REINFORCEMENT THROUGH IMPLICIT REWARDS</title>
    <link>https://blog.vllbc.top/process-reinforcement-through-implicit-rewards/</link>
    <pubDate>Wed, 16 Jul 2025 00:00:00 &#43;0000</pubDate>
    <author>vllbc</author>
    <guid>https://blog.vllbc.top/process-reinforcement-through-implicit-rewards/</guid>
    <description><![CDATA[<h3 id="论文深入解读">论文深入解读</h3>
<p>这篇名为《Process Reinforcement through Implicit
Rewards》(通过隐式奖励进行过程强化)
的论文，由来自清华大学、上海人工智能实验室、UIUC
等顶尖机构的研究者共同完成，为大语言模型（LLM）的强化学习（RL）领域带来了一个极具价值和创新性的解决方案——<strong>PRIME</strong>
框架。其核心贡献在于，它成功地将<strong>过程监督 (Process
Supervision)</strong> 的高效率与<strong>结果监督 (Outcome
Supervision)</strong>
的低成本相结合，解决了在复杂推理任务（如数学和编程）中应用强化学习时面临的关键瓶颈。</p>]]></description>
</item>
</channel>
</rss>
