The paper "Improving Code Generation via Small Language Model-as-a-judge" investigates a cost-effective strategy to enhance automated code generation by using Small Language Models (SLMs)—defined as models with fewer than 5 billion parameters—to rival the performance of massive Large Language Models (LLMs).

The researchers address the challenge that while massive LLMs are effective for coding, their deployment is often prohibitively expensive for small and medium enterprises, costing upwards of $17,000 to $50,000 in hardware infrastructure. To solve this, they propose a "team-based" approach: one SLM generates multiple candidate solutions, and a second, fine-tuned SLM acts as a judge to select the most likely correct implementation.

Key findings from the study include:

• Judge Proficiency: While SLMs fail to judge code correctness in zero-shot settings, fine-tuning them allows them to achieve a "moderate agreement" with ground-truth test results. Remarkably, a fine-tuned Qwen2.5 Coder 3B judge achieved higher accuracy (Kappa score of 0.57) than the commercial GPT-4.1-mini (0.54).
• Performance Breakthrough: By generating 10 candidate solutions and using an SLM judge to pick the best one, the code generation performance of small models improved significantly (e.g., a 15.6% boost for Qwen2.5 Coder 3B). In four out of five tested model families, these SLM teams outperformed LLMs 5–25× larger than the generator itself.
• Cost-Effectiveness: A two-SLM team (generator and judge) can be run on consumer-grade hardware (e.g., two NVIDIA RTX 3060 GPUs) for approximately $600, compared to the $17,500 required for a single ~30B parameter model.
• Reliability: The authors found that a judge's confidence score is a strong indicator of its judgment reliability, allowing for even higher precision if a confidence threshold is applied.

Ultimately, the study demonstrates that fine-tuning SLMs to act as judges is a scalable and budget-friendly strategy for companies to build high-quality, in-house AI coding assistants.