†DAGGER: Distractor-Aware Graph Generation for Executable Reasoning in Math Problems
Abstract
AbstractChain-of-Thought (CoT) prompting is widely adopted for mathematical problem solving, including in low-resource languages, yet its robustness under irrelevant context - a known vulnerability in English - remains unexamined in such settings. To systematically probe this challenge, we introduce DISTRACTMATH-BN, a Bangla benchmark that augments MGSM and MSVAMP with semantically coherent but computationally irrelevant information. Evaluating seven models ranging from 3B to 12B parameters, we observe substantial performance degradation under distractors: standard models drop up to 41 points, while reasoning-specialized models decline 14-20 points despite consuming 5× more tokens. We propose †DAGGER, which reformulates mathematical problem solving as executable computational graph generation with dedicated modeling of distractor nodes. Fine-tuning Gemma-3 models using Supervised Fine-Tuning followed by Group Relative Policy Optimization achieves comparable weighted accuracy on augmented benchmarks while using 89% fewer tokens than reasoning models. Importantly, this robustness emerges without explicit training on distractor-augmented examples. Our results suggest that enforcing structured intermediate representations can improve robustness and inference efficiency in mathematical understanding compared to free-form reasoning, particularly in noisy, low-resource settings.