Beyond the Surface: A Solution-Aware Retrieval Model for Competition-level Code Generation (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing retrieval models emphasize surface-level semantic similarity, neglecting deeper solution-level logical similarities. |
| Approach: | They propose a solution-aware ranking model empowered by synthetic data for competitive programming tasks. |
| Outcome: | The proposed ranking model outperforms existing retrieval models in precision and recall metrics. |
Similar Papers
CodeRAG-Bench: Can Retrieval Augment Code Generation? (2025.findings-naacl)
Copied to clipboard
Zora Zhiruo Wang, Akari Asai, Xinyan Velocity Yu, Frank F. Xu, Yiqing Xie, Graham Neubig, Daniel Fried
| Challenge: | Language models excel at generating code, but many programs are difficult to generate using only parametric knowledge. |
| Approach: | They propose a retrieval-augmented code generation benchmark that provides reproducible evaluations on retrieval and end-to-end code generation performance. |
| Outcome: | The proposed benchmark covers programming, open-domain, and repository-level tasks and provides reproducible evaluations on retrieval and end-to-end code generation performance. |
Idea First, Code Later: Disentangling Problem Solving from Code Generation in Evaluating LLMs for Competitive Programming (2026.findings-acl)
Copied to clipboard
Sama Hadhoud, Alaa Elsetohy, Frederikus Hudi, Jan Christian Blaise Cruz, Steven Halim, Alham Fikri Aji
| Challenge: | Existing evaluations conflate algorithmic reasoning with code-level implementation. |
| Approach: | They propose to center editorials in both solution generation and evaluation . they propose to compare editorials to gold standards and validate an LLM-as-a-judge protocol . |
| Outcome: | The proposed approach improves solve rates on some LLMs with gold editorials . but the gap between gold and generated editorials shows bottlenecks in implementation . |
Functional Overlap Reranking for Neural Code Generation (2024.findings-acl)
Copied to clipboard
| Challenge: | Code Large Language Models (CodeLLMs) have ushered in a new era in code generation, but selecting the best code solutions remains a challenge. |
| Approach: | They propose a new reranking strategy that quantifies the functional overlap between solution clusters to provide a better ranking strategy for code solutions. |
| Outcome: | Empirical results show that the proposed method surpasses state-of-the-art methods on the pass@1 score. |
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. |
MATCH: Task-Driven Code Evaluation through Contrastive Learning (2025.findings-emnlp)
Copied to clipboard
| Challenge: | GitHub Copilot generates 46% of the code on GitHub. |
| Approach: | They propose a reference-free metric that uses Contrastive Learning to generate meaningful embeddings for code and natural language task descriptions. |
| Outcome: | This paper compares the performance of a new similarity score with existing metrics. |
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. |
Beyond [CLS] through Ranking by Generation (2020.emnlp-main)
Copied to clipboard
| Challenge: | Recent work on generative ranking models for Information Retrieval has focused on discriminative methods that learn a similarity function to compare questions and candidates answers. |
| Approach: | They propose to use a language model to train a ranking function that model the semantic similarity of documents and queries instead of discriminative ranking functions. |
| Outcome: | The proposed approaches are as effective as state-of-the-art discriminative models for the answer selection task and show unlikelihood losses are reduced for IR. |
Rewriting the Code: A Simple Method for Large Language Model Augmented Code Search (2024.acl-long)
Copied to clipboard
| Challenge: | Experimental results show that ReCo significantly boosts retrieval accuracy across sparse, zero-shot dense and fine-tuned dense search settings. |
| Approach: | They propose a generation-augmented retrieval framework that additionally Rewrites the Code (ReCo) within the codebase for style normalization. |
| Outcome: | The proposed method significantly boosts retrieval accuracy across sparse, zero-shot dense, and fine-tuned dense retrieval settings in diverse search scenarios. |
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. |
cAST: Enhancing Code Retrieval-Augmented Generation with Structural Chunking via Abstract Syntax Tree (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing line-based chunking heuristics often break semantic structures, splitting functions or merging unrelated code. |
| Approach: | They propose a structure-aware method that breaks large AST nodes into smaller chunks . this method generates self-contained, semantically coherent units across programming languages . |
| Outcome: | The proposed method boosts Recall@5 by 4.3 points on RepoEval retrieval and Pass@1 by 2.67 points on SWE-bench generation. |