Seamlessly Integrating Tree-Based Positional Embeddings into Transformer Models for Source Code Representation
Seamlessly Integrating Tree-Based Positional Embeddings into Transformer Models for Source Code Representation
Transformer-based models have demonstrated significant success in various source code representation tasks. Nonetheless, traditional positional embeddings employed by these models inadequately capture the hierarchical structure intrinsic to source code, typically represented as Abstract Syntax Trees (ASTs). To address this, we propose a novel tree-based positional embedding approach that explicitly encodes hierarchical relationships derived from ASTs, including node depth and sibling indices. These hierarchical embeddings are integrated into the transformer architecture, specifically enhancing the CodeBERTa model. We thoroughly evaluate our proposed model through masked language modeling (MLM) pretraining and clone detection fine-tuning tasks. Experimental results indicate that our Tree-Enhanced CodeBERTa consistently surpasses the baseline model in terms of loss, accuracy, F1 score, precision, and recall, emphasizing the importance of incorporating explicit structural information into transformer-based representations of source code.
Patryk Bartkowiak、Filip Graliński
计算技术、计算机技术
Patryk Bartkowiak,Filip Graliński.Seamlessly Integrating Tree-Based Positional Embeddings into Transformer Models for Source Code Representation[EB/OL].(2025-07-05)[2025-07-18].https://arxiv.org/abs/2507.04003.点此复制
评论