PDC & DM-SFT: A Road for LLM SQL Bug-Fix Enhancing
Not on the map. Why?
Abstract (arXiv)
Code Large Language Models (Code LLMs), such as Code llama and DeepSeek-Coder, have demonstrated exceptional performance in the code generation tasks. However, most existing models focus on the abilities of generating correct code, but often struggle with bug repair. We introduce a suit of methods to enhance LLM's SQL bug-fixing abilities. The methods are mainly consisted of two parts: A Progressive Dataset Construction (PDC) from scratch and Dynamic Mask Supervised Fine-tuning (DM-SFT). PDC proposes two data expansion methods from the perspectives of breadth first and depth first respectively. DM-SFT introduces an efficient bug-fixing supervised learning approach, which effectively reduce the total training steps and mitigate the "disorientation" in SQL code bug-fixing training. In our evaluation, the code LLM models trained with two methods have exceeds all current best performing model which size is much larger.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 10 of its 17 references that are in the map. First posted on arXiv 11 Nov 2024.
Builds on
10 of 17 references.
References · 10
- 2023GPT-4 Technical Reportcited by 18,396
- 2023Code Llama: Open Foundation Models for Codecited by 2,139
- 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,301
- 2024DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligencecited by 1,181
- 2023Teaching Large Language Models to Self-Debugcited by 988
- 2023WizardCoder: Empowering Code Large Language Models with Evol-Instructcited by 733
- 2024DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligencecited by 331
- 2024RepairAgent: An Autonomous, LLM-Based Agent for Program Repaircited by 232
- 2021Break-It-Fix-It: Unsupervised Learning for Program Repaircited by 71
- 2021Self-Supervised Bug Detection and Repaircited by 59
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.