arXiv cs.AI· John J. Vastola, Ann Huang, Satpreet H. Singh, Samuel J. Gershman, Kanaka Rajan·· 2 小时前AI 评分30
课程学习有效性取决于奖励稀疏性与竞争最优解:基于 REINFORCE 策略学习的最小模型分析
Effectiveness of Curriculum Learning Depends on Reward Sparsity and Competing Optima
AI 导读
研究者构建一个基于 REINFORCE 的开环目标拦截策略学习最小模型,分析课程学习何时有效。数学与数值分析显示:稠密奖励下课程收益有限,稀疏奖励下课程可能是学习发生的前提,尤其在智能体兼顾省力与高奖励、形成相互竞争的奖励地貌最优解时。有效课程的作用在于降低奖励稀疏性以加速学习,并塑造奖励地貌以避开糟糕的局部最优。该论文已被 NeurIPS 2026 接收。
正文 · 原文
Abstract:While animals and people tend to learn a task more quickly and reliably when they first train on simpler versions of it, curriculum learning's effectiveness in artificial settings varies, and appears substantially greater in reinforcement learning than in supervised learning. In this work, we construct and analyze a minimal model of policy learning to better understand why. We consider an open-loop, episodic target interception task whose parameters---especially how close the agent must be to the target to receive an informative reward signal---can be chosen so that the agent either receives informative rewards frequently ('dense' rewards) or rarely ('sparse' rewards). We mathematically and numerically analyze the dynamics of REINFORCE-based policy learning in both cases. In the dense reward case, curricula have only marginal benefits; in the sparse case, curricula can be required for learning to occur at all. We find that this is especially true when the agent has the conflicting goals of minimizing effort and accumulating high reward, since this can produce distinct reward landscape optima which compete with one another. Our characterization of useful curricula in this setting indicates that they address two issues: they (i) make rewards less sparse to speed up learning, and (ii) shape the reward landscape to steer agents away from bad local optima.
| Comments: | Accepted to NeurIPS 2026 |
| Subjects: | Machine Learning (cs.LG); Artificial Intelligence (cs.AI) |
| Cite as: | arXiv:2610.31884 [cs.LG] |
| (or arXiv:2610.31884v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2610.31884 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Ann Zixiang Huang [view email]
[v1]
Thu, 22 Oct 2026 20:25:52 UTC (3,359 KB)
来源:arXiv cs.AI · arxiv.org