arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.04604cs.CLcs.PL
收藏

学习任务分解以协助人类进行竞赛编程

Learning Task Decomposition to Assist Humans in Competitive Programming

Tsinghua University(清华大学);University of California, Berkeley(加州大学伯克利分校)

Jiaxin Wen, Ruiqi Zhong, Pei Ke, Zhihong Shao, Hongning Wang, Minlie Huang

AI总结:

针对人类难以理解和修复语言模型生成的复杂解决方案的问题,提出学习任务分解方法,通过引入辅助价值目标并利用人类修复经验数据进行批评、优化和排序,在竞赛编程中显著提升了非专家的解题效率与能力。

摘要:

在使用语言模型(LM)解决复杂问题时,人类可能难以理解LM生成的解决方案并修复其中的缺陷。为了协助人类进行修复,我们提出将复杂解决方案自动分解为对应特定子任务的多个更简单的片段。我们引入了一种用于学习任务分解的新颖目标,称为辅助价值(AssistV),它衡量人类修复分解后解决方案的可行性与速度。我们收集了人类在不同分解解决方案上的修复经验数据集。利用收集到的数据作为上下文示例,我们随后学习对分解解决方案进行批评、优化和排序,以提高AssistV。我们在竞赛编程问题下验证了方法:在177小时的人类研究中,我们的方法使非专家多解决33.3%的问题,速度提升3.3倍,并使他们能匹敌无辅助的专家。

英文摘要:

When using language models (LMs) to solve complex problems, humans might struggle to understand the LM-generated solutions and repair the flawed ones. To assist humans in repairing them, we propose to automatically decompose complex solutions into multiple simpler pieces that correspond to specific subtasks. We introduce a novel objective for learning task decomposition, termed assistive value (AssistV), which measures the feasibility and speed for humans to repair the decomposed solution. We collect a dataset of human repair experiences on different decomposed solutions. Utilizing the collected data as in-context examples, we then learn to critique, refine, and rank decomposed solutions to improve AssistV. We validate our method under competitive programming problems: under 177 hours of human study, our method enables non-experts to solve 33.3\% more problems, speeds them up by 3.3x, and empowers them to match unassisted experts.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑