← 返回论文检索
NeurIPS 2025{location} PosterAccept (poster)

Learning to Solve Complex Problems via Dataset Decomposition

Wanru Zhao, Lucas Page-Caccia, Zhengyan Shi, Minseon Kim, Weijia Xu, Alessandro Sordoni

University of Cambridge, Microsoft Research · McGill University · Microsoft Research · Microsoft · Research, Microsoft · Microsoft Research Montreal

PDF 由论文原始站点提供,PaperCompass 不保存论文文件。

摘要

Curriculum learning is a class of training strategies that organizes the data being exposed to a model by difficulty, gradually from simpler to more complex examples. This research explores a reverse curriculum generation approach that recursively decomposes complex datasets into simpler, more learnable components. We propose a teacher-student framework where the teacher is equipped with the ability to reason step-by-step, which is used to recursively generate easier versions of examples, enabling the student model to progressively master difficult tasks. We propose a novel scoring system to measure data difficulty based on its structural complexity and conceptual depth, allowing curriculum construction over decomposed data. Experiments on math datasets (MATH and AIME) and code generation datasets demonstrate that models trained with curricula generated by our approach exhibit superior performance compared to standard training on original datasets.