Skip to content
AI News HubLIVE
Original source2 min read

CODEBLOCK: Learning to Supervise Code at the Right Granularity

Summary

CODEBLOCK is a structure-aware sparse supervision framework for fine-tuning code LLMs. It selects structure-complete code blocks rather than isolated tokens, achieving stronger average pass@1 on six benchmarks while using only 1.9% of supervised tokens.

SourcearXiv Machine LearningAuthor: Zhijie Deng, Ling Li, Jinlong Pang, Kaiqin Hu, Qi Xuan, Zhaowei Zhu, Jiaheng Wei
CODEBLOCK: Learning to Supervise Code at the Right Granularity
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[2606.18286] CODEBLOCK: Learning to Supervise Code at the Right Granularity

[Submitted on 10 Jun 2026]

Title:CODEBLOCK: Learning to Supervise Code at the Right Granularity

View a PDF of the paper titled CODEBLOCK: Learning to Supervise Code at the Right Granularity, by Zhijie Deng and 6 other authors

View PDF HTML (experimental)

Abstract:Supervised fine-tuning of code LLMs typically applies uniform cross-entropy loss to all response tokens, implicitly assuming that every token provides equally useful learning signal. Recent token-level selection methods challenge this assumption in natural-language SFT by supervising only high-value tokens. However, directly transferring token-level masking to code can break syntactically and semantically coherent program units, because code depends on structural completeness and definition-use relations. We therefore propose CodeBlock, a structure-aware sparse supervision framework that selects structure-complete code evidence rather than isolated tokens. CodeBlock first selects high-quality instruction-response pairs, then partitions code responses into syntactically coherent coding items, estimates their utility by aggregating generalized cross-entropy over core logic tokens, and reranks them with data-flow reach and bridge signals to prioritize blocks that propagate or connect important program dependencies. During training, the full response remains available as context, while loss is applied only to selected code items and informative natural-language tokens. Experiments on six code-generation benchmarks show that CodeBlock achieves stronger average pass@1 than full-token SFT and competitive selection baselines, while using only 1.9% of supervised response tokens.

Subjects:

Machine Learning (cs.LG)

Cite as: arXiv:2606.18286 [cs.LG]

(or arXiv:2606.18286v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2606.18286

arXiv-issued DOI via DataCite

Submission history

From: Zhijie Deng [view email] [v1] Wed, 10 Jun 2026 04:46:04 UTC (433 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled CODEBLOCK: Learning to Supervise Code at the Right Granularity, by Zhijie Deng and 6 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.LG

new | recent | 2026-06

Change to browse by:

cs

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • Traditional SFT applies uniform loss to all tokens, ignoring code's structural completeness.
  • CODEBLOCK partitions code responses into syntactically coherent items and uses data-flow signals to prioritize high-value blocks.
  • Experiments show CODEBLOCK outperforms full-token SFT on six benchmarks using only 1.9% tokens.

Highlights and analysis are generated automatically and may contain errors. Check the original source.