Challenge: Existing methods for code retrieval are based on question-description relevance . code retrievals are a key task aiming to match natural and programming languages .
Approach: They propose to use question-description relevance to regularize adversarial learning for code retrieval . they adapt a simple adversarial learning technique to generate difficult code snippets .
Outcome: The proposed method can improve the performance of state-of-the-art models on large-scale code retrieval datasets of two programming languages.

Similar Papers

CoSQA: 20,000+ Web Queries for Code Search and Question Answering (2021.acl-long)

Copied to clipboard

Challenge: Using deep neural networks to find codes is difficult . we present a dataset that includes 20,604 labels for natural language queries and codes .
Approach: They introduce a contrastive learning method to enhance text-code matching . they find that CoSQA improves the accuracy of code question answering by 5.1% .
Outcome: The proposed method improves the accuracy of code question answering by 5.1% and improves by 10.5% on a CodeBERT model.
Addressing Leakage in Self-Supervised Contextualized Code Retrieval (2022.coling-1)

Copied to clipboard

Challenge: a recent study addresses the use of contextualized code retrieval to fill gaps in a partial input program.
Approach: They propose a self-supervised approach to contextualized code retrieval . they propose mutual identifier masking, dedentation, and the selection of syntax-aligned targets .
Outcome: The proposed approach improves retrieval substantially and yields state-of-the-art results for code clone and defect detection.
Contrastive Learning with Keyword-based Data Augmentation for Code Search and Code Question Answering (2023.eacl-main)

Copied to clipboard

Challenge: Recent work on code search proposes data augmentation of queries for contrastive learning.
Approach: They propose to augment query-code pairs with key words to preserve key words . they use keyDAC to fine-tune various pre-trained language models .
Outcome: The proposed approach outperforms the current state-of-the-art in code search and question answering tasks.
Open-Domain Why-Question Answering with Adversarial Learning to Encode Answer Texts (P19-1)

Copied to clipboard

Challenge: Existing why-QA methods retrieve “answer passages” that consist of several sentences . AGR is a vector representation of the non-redundant reason sought by a why-question .
Approach: They propose a method for why-question answering that uses an adversarial learning framework.
Outcome: The proposed method improves state-of-the-art open-domain QA on Japanese datasets . it also improves a state- of-the art method on publicly available English datasets.
Exploring Representation-level Augmentation for Code Search (2022.emnlp-main)

Copied to clipboard

Challenge: Recent data augmentations for code search are at the raw-data level, which requires additional code analysis and training cost.
Approach: They propose a general format of representation-level augmentation that unifies existing methods.
Outcome: The proposed methods can boost the performance of code search models on a large-scale dataset.
SACL: Understanding and Combating Textual Bias in Code Retrieval with Semantic-Augmented Reranking and Localization (2025.findings-emnlp)

Copied to clipboard

Challenge: a recent study shows that code retrievers exhibit a strong bias towards well-documented code .
Approach: They propose a framework that augments textual information with semantic information to mask specific features while preserving code functionality.
Outcome: The proposed framework enhances textual information and reduces bias by augmenting code or structural knowledge with semantic information.
ReACC: A Retrieval-Augmented Code Completion Framework (2022.acl-long)

Copied to clipboard

Challenge: Recent work has shown that statistical language modeling with transformers can greatly improve the performance in code completion tasks.
Approach: They propose a retrieval-augmented code completion framework that combines a source code retriever and an auto-regressive language model for programming language.
Outcome: The proposed framework achieves state-of-the-art on CodeXGLUE benchmark.
Fine-Grained Features-based Code Search for Precise Query-Code Matching (2025.coling-main)

Copied to clipboard

Challenge: Existing methods to locate code snippets from databases represent the semantics of code and query by averaging the features of each token and word.
Approach: They propose a fine-grained code search model that consists of a cross-modal encoder, mapping layer and classification layer to capture fine-granular interactions between code and query.
Outcome: The proposed model significantly outperforms existing methods across multiple programming language datasets.
Contrastive Code Representation Learning (2021.emnlp-main)

Copied to clipboard

Challenge: Recent work learns contextual representations of source code by reconstructing tokens from their context.
Approach: They propose a contrastive pre-training task that learns code functionality, not form . they propose scalable compilers that can generate variants of a program .
Outcome: The proposed task outperforms RoBERTa on an adversarial code clone detection benchmark by 39% AUROC.
ProCQA: A Large-scale Community-based Programming Question Answering Dataset for Code Search (2024.lrec-main)

Copied to clipboard

Challenge: Existing approaches to code question answering use bi-modal and unimodal pretraining to align text and code representations.
Approach: They propose a modality-agnostic contrastive pre-training approach to improve alignment of text and code representations of current code language models.
Outcome: The proposed model exhibits significant performance improvements across a wide range of code retrieval benchmarks.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations