<p>This study considers neural network methods for selecting and generating synthetic variations of mathematical combinatorial problems using large language models. The authors filtered 1000 problems from the NuminaMath-CoT dataset and introduce three new variations, namely, fictional, adversarial, and contextual disguise. We propose the Variation Consistency Score to measure the accuracy in the solution generation rate of the variations and their correlation rate with the original problems. Experiments with GPT-4o-mini showed consistent performance in the generation process, demonstrating the highest score on the fictional variation with the greatest average statement length and the lowest score on the contextual disguise variation. The model demonstrates the ability to generate diverse variations while preserving their mathematical core.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Neural Network Methods for Selecting and Generating Synthetic Variations of Combinatorial Problems

  • A. Nikolaiev,
  • A. Anisimov

摘要

This study considers neural network methods for selecting and generating synthetic variations of mathematical combinatorial problems using large language models. The authors filtered 1000 problems from the NuminaMath-CoT dataset and introduce three new variations, namely, fictional, adversarial, and contextual disguise. We propose the Variation Consistency Score to measure the accuracy in the solution generation rate of the variations and their correlation rate with the original problems. Experiments with GPT-4o-mini showed consistent performance in the generation process, demonstrating the highest score on the fictional variation with the greatest average statement length and the lowest score on the contextual disguise variation. The model demonstrates the ability to generate diverse variations while preserving their mathematical core.