Error-Driven Prompt Optimization for Arithmetic Reasoning: A Code Generation Approach Using On-Premises Small Language Models on Tabular Data
Abstract
Recent advancements in artificial intelligence have sparked interest in industrial agents capable of supporting analysts in regulated sectors, such as finance and healthcare, within tabular data workflows. A key capability for such systems is performing accurate arithmetic operations on structured data while ensuring sensitive information never leaves secure, on-premises environments. Here, we introduce an error-driven optimization framework for arithmetic reasoning that enhances a Code Generation Agent (CGA), specifically applied to on-premises small language models (SLMs). Through a systematic evaluation of a leading SLMs (Qwen3 4B, Gemma 3N E4B, Gemma3 4B), we find that while the base model exhibits fundamental limitations in arithmetic tasks, our proposed error-driven method, which clusters erroneous predictions to refine prompt-rules iteratively, dramatically improves performance, elevating the model’s accuracy to 66.45%. Our results suggest that developing reliable, interpretable, and industrially deployable AI assistants can be achieved not only through costly fine-tuning but also via systematic, error-driven prompt optimization, enabling small models to surpass larger language models (GPT-3.5 Turbo) in a privacy-compliant manner.
Fields of Study & Subjects
Machine Learning and Data Classification
Multimodal Machine Learning Applications
Topic Modeling
Publication details
- Journal / source
- IEEE Access
- Volume
- 14
- Pages
- 62570–62583
- Publication date
- 1 January 2026
- Language
- EN