How Small is Enough? Empirical Evidence of Quantized Small Language Models for Automated Program Repair

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Kusama, Kazuki, Shu, Honglin, Kondo, Masanari, Kamei, Yasutaka
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911116915900416
author Kusama, Kazuki
Shu, Honglin
Kondo, Masanari
Kamei, Yasutaka
author_facet Kusama, Kazuki
Shu, Honglin
Kondo, Masanari
Kamei, Yasutaka
contents Background: Large language models (LLMs) have greatly improved the accuracy of automated program repair (APR) methods. However, LLMs are constrained by high computational resource requirements. Aims: We focus on small language models (SLMs), which perform well even with limited computational resources compared to LLMs. We aim to evaluate whether SLMs can achieve competitive performance in APR tasks. Method: We conducted experiments on the QuixBugs benchmark to compare the bug-fixing accuracy of SLMs and LLMs. We also analyzed the impact of int8 quantization on APR performance. Results: The latest SLMs can fix bugs as accurately as--or even more accurately than--LLMs. Also, int8 quantization had minimal effect on APR accuracy while significantly reducing memory requirements. Conclusions: SLMs present a viable alternative to LLMs for APR, offering competitive accuracy with lower computational costs, and quantization can further enhance their efficiency without compromising effectiveness.
format Preprint
id arxiv_https___arxiv_org_abs_2508_16499
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle How Small is Enough? Empirical Evidence of Quantized Small Language Models for Automated Program Repair
Kusama, Kazuki
Shu, Honglin
Kondo, Masanari
Kamei, Yasutaka
Software Engineering
Background: Large language models (LLMs) have greatly improved the accuracy of automated program repair (APR) methods. However, LLMs are constrained by high computational resource requirements. Aims: We focus on small language models (SLMs), which perform well even with limited computational resources compared to LLMs. We aim to evaluate whether SLMs can achieve competitive performance in APR tasks. Method: We conducted experiments on the QuixBugs benchmark to compare the bug-fixing accuracy of SLMs and LLMs. We also analyzed the impact of int8 quantization on APR performance. Results: The latest SLMs can fix bugs as accurately as--or even more accurately than--LLMs. Also, int8 quantization had minimal effect on APR accuracy while significantly reducing memory requirements. Conclusions: SLMs present a viable alternative to LLMs for APR, offering competitive accuracy with lower computational costs, and quantization can further enhance their efficiency without compromising effectiveness.
title How Small is Enough? Empirical Evidence of Quantized Small Language Models for Automated Program Repair
topic Software Engineering
url https://arxiv.org/abs/2508.16499