Haochen Li, Yuan Huang, Hongyu Zhang, Chunyan Miao, Cyril Leung, Yanlin Wang, Yanxian Huang
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Code search, which aims at retrieving the most relevant code fragment for a given natural language query, is a common activity in software development practice. Recently, contrastive learning is widely used in code search research, where many data augmentation approaches for source code (e.g., semantic-preserving program transformation) are proposed to learn better representations. However, these augmentations are at the raw-data level, which requires additional code analysis in the preprocessing stage and additional training costs in the training stage. In this paper, we explore augmentation methods that augment data (both code and query) at representation level which does not require additional data processing and training, and based on this we propose a general format of representationlevel augmentation that unifies existing methods. Then, we propose three new augmentation methods (linear extrapolation, binary interpolation, and Gaussian scaling) based on the general format. Furthermore, we theoretically analyze the advantages of the proposed augmentation methods over traditional contrastive learning methods on code search. We experimentally evaluate the proposed representationlevel augmentation methods with state-of-theart code search models on a large-scale public dataset consisting of six programming languages. The experimental results show that our approach can consistently boost the performance of the studied code search models. Our source code is available at https://github. com/Alex-HaochenLi/RACS.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2210.12285")
get_code_for_paper("2210.12285")
have("2210.12285")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2210.12285.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2210.12285)
Connect an agent — have() is free.