RepoShapley: Shapley-Enhanced Context Filtering for Repository-Level Code Completion (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models have strong reasoning, coding, and generation capabilities, but retrieval-augmented generation remains difficult under fixed context budgets. |
| Approach: | They propose a coalition-aware context filtering framework supervised by Shapley-style marginal contributions that captures sign effects via teacher-forced probing and computes exact Shaply values for small retrieval sets. |
| Outcome: | Experiments show that RepoShapley improves completion quality while reducing harmful context and unnecessary retrieval. |
Similar Papers
RepoCoder: Repository-Level Code Completion Through Iterative Retrieval and Generation (2023.emnlp-main)
Copied to clipboard
Fengji Zhang, Bei Chen, Yue Zhang, Jacky Keung, Jin Liu, Daoguang Zan, Yi Mao, Jian-Guang Lou, Weizhu Chen
| Challenge: | RepoCoder is a repository-level code completion framework that utilizes the useful information scattered in files. |
| Approach: | They propose a repository-level code completion framework called RepoCoder . it integrates a similarity-based retriever and a pre-trained code language model . they propose 'repoBench' benchmark to validate the framework's effectiveness . |
| Outcome: | The proposed framework outperforms the vanilla retrieval-augmented code completion approach in the real-world. |
Late Code Chunking: A Code Chunking Strategy for Repository-Level Code Completion (2026.acl-short)
Copied to clipboard
| Challenge: | Despite significant advancements in Large Language Models (LLMs), repository-level code completion remains a challenging area. |
| Approach: | They propose a chunking strategy to improve the semantic understanding of code segments for Large Language Models. |
| Outcome: | The proposed strategy improves the semantic understanding of code segments for Large Language Models. |
HASH-RAG: Bridging Deep Hashing with Retriever for Efficient, Fine Retrieval and Augmented Generation (2025.findings-acl)
Copied to clipboard
| Challenge: | Experimental evaluations on NQ, TriviaQA, and HotpotQA datasets demonstrate that our approach achieves a 90% reduction in retrieval time compared to conventional methods while maintaining considerate recall performance. |
| Approach: | They propose a framework that integrates deep hashing techniques with systematic optimizations to address these limitations. |
| Outcome: | The proposed framework outperforms retrieval/non-retrieval baselines by 1.4-4.3% in EM scores on NQ, TriviaQA, and HotpotQA datasets. |
AED-RAG: Continuous Multi-Granular Context Fusion for Retrieval-Augmented Generation via Adaptive Ensemble Decoding (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing alignment strategies that rely on discrete reranking struggle to address this granularity mismatch or effectively balance external evidence with internal knowledge. |
| Approach: | They propose a framework that synergizes discrete retrieval with continuous reranking to discern the information density differences between unstructured narrative passages and structured knowledge triplets. |
| Outcome: | Extensive experiments on four open-domain QA benchmarks show that AED-RAG significantly outperforms competitive baselines. |
RepoDistill: Distilling Repository Knowledge through Compression-Aware Budget Allocation and Policy Optimization (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have strong performance on code translation tasks, but they struggle with repository-level scenarios where context is extensive and interdependent. |
| Approach: | They propose a framework that integrates retrieval with learning budget allocation for fine-grained context compression. |
| Outcome: | The proposed framework outperforms baselines on SWE-QA, CoderEval, and LongCodeU. |
AIRCoder: Adaptive Integration of Multi-dimensional Retrieval for Repository-level Code Completion (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for retrieving code from large codebases use textual similarity or dependency existence, resulting in inconsistent performance. |
| Approach: | They propose a retrieval framework that integrates eight complementary metrics across three dimensions: textual similarity, dependency existence, and structural hierarchy. |
| Outcome: | Experiments on CrossCodeEval and RepoEval show that AIRCoder improves accuracy and performance by 10.2 over baseline methods. |
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. |
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. |
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. |
Dataflow-Guided Retrieval Augmentation for Repository-Level Code Completion (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods to generate correct code completions in private repositories are insufficiently relevant. |
| Approach: | They propose a dataflow-guided retrieval augmentation approach for repository-level code completion . they parses a private repository into code entities and establishes their relations through an extended dataflow analysis . |
| Outcome: | The proposed method improves code exact match and identifier F1-score by 3.43% compared to the state-of-the-art approach. |